/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/podwr001_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:00:37,821 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:00:37,823 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:00:37,835 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:00:37,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:00:37,837 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:00:37,838 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:00:37,840 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:00:37,842 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:00:37,843 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:00:37,844 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:00:37,845 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:00:37,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:00:37,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:00:37,848 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:00:37,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:00:37,850 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:00:37,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:00:37,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:00:37,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:00:37,857 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:00:37,858 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:00:37,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:00:37,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:00:37,862 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:00:37,862 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:00:37,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:00:37,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:00:37,864 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:00:37,865 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:00:37,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:00:37,866 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:00:37,867 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:00:37,868 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:00:37,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:00:37,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:00:37,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:00:37,870 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:00:37,870 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:00:37,871 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:00:37,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:00:37,872 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 07:00:37,887 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:00:37,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:00:37,888 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:00:37,889 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:00:37,889 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:00:37,889 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:00:37,889 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:00:37,890 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:00:37,890 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:00:37,890 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:00:37,890 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:00:37,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:00:37,891 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:00:37,892 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:00:37,892 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:00:37,892 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:00:37,892 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:00:37,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:00:37,892 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:00:37,893 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:00:37,893 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:00:37,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:00:37,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:00:37,893 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:00:37,894 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:00:37,894 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:00:37,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:00:37,894 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:00:37,894 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:00:37,894 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:00:38,163 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:00:38,177 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:00:38,180 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:00:38,181 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:00:38,182 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:00:38,183 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr001_pso.opt.i [2019-12-27 07:00:38,255 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d2eedd76/30a8d01bb7744527ba4a8f18e5fc9ed9/FLAG33f7966af [2019-12-27 07:00:38,811 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:00:38,812 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr001_pso.opt.i [2019-12-27 07:00:38,828 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d2eedd76/30a8d01bb7744527ba4a8f18e5fc9ed9/FLAG33f7966af [2019-12-27 07:00:39,136 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d2eedd76/30a8d01bb7744527ba4a8f18e5fc9ed9 [2019-12-27 07:00:39,145 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:00:39,147 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:00:39,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:00:39,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:00:39,152 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:00:39,153 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:00:39" (1/1) ... [2019-12-27 07:00:39,156 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b25d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:00:39, skipping insertion in model container [2019-12-27 07:00:39,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:00:39" (1/1) ... [2019-12-27 07:00:39,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:00:39,234 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:00:39,703 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:00:39,722 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:00:39,819 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:00:39,894 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:00:39,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:00:39 WrapperNode [2019-12-27 07:00:39,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:00:39,896 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:00:39,896 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:00:39,896 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:00:39,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:00:39" (1/1) ... [2019-12-27 07:00:39,926 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:00:39" (1/1) ... [2019-12-27 07:00:39,960 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:00:39,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:00:39,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:00:39,961 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:00:39,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:00:39" (1/1) ... [2019-12-27 07:00:39,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:00:39" (1/1) ... [2019-12-27 07:00:39,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:00:39" (1/1) ... [2019-12-27 07:00:39,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:00:39" (1/1) ... [2019-12-27 07:00:39,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:00:39" (1/1) ... [2019-12-27 07:00:39,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:00:39" (1/1) ... [2019-12-27 07:00:39,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:00:39" (1/1) ... [2019-12-27 07:00:40,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:00:40,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:00:40,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:00:40,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:00:40,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:00:39" (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 07:00:40,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:00:40,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:00:40,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:00:40,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:00:40,084 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:00:40,084 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:00:40,084 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:00:40,084 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:00:40,084 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 07:00:40,085 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 07:00:40,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:00:40,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:00:40,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:00:40,088 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 07:00:40,839 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:00:40,839 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:00:40,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:00:40 BoogieIcfgContainer [2019-12-27 07:00:40,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:00:40,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:00:40,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:00:40,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:00:40,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:00:39" (1/3) ... [2019-12-27 07:00:40,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f8f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:00:40, skipping insertion in model container [2019-12-27 07:00:40,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:00:39" (2/3) ... [2019-12-27 07:00:40,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f8f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:00:40, skipping insertion in model container [2019-12-27 07:00:40,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:00:40" (3/3) ... [2019-12-27 07:00:40,850 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr001_pso.opt.i [2019-12-27 07:00:40,862 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:00:40,862 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:00:40,871 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:00:40,872 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:00:40,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,918 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,919 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,919 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,920 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,920 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,927 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,928 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,953 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,953 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,981 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,983 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,990 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,990 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,991 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,992 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,993 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:40,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:00:41,009 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 07:00:41,030 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:00:41,030 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:00:41,030 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:00:41,030 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:00:41,030 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:00:41,030 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:00:41,031 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:00:41,031 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:00:41,048 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 07:00:41,050 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 07:00:41,171 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 07:00:41,171 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:00:41,191 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:00:41,213 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 07:00:41,287 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 07:00:41,287 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:00:41,298 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:00:41,320 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 07:00:41,321 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:00:44,745 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 07:00:44,878 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 07:00:44,904 INFO L206 etLargeBlockEncoding]: Checked pairs total: 85326 [2019-12-27 07:00:44,905 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 07:00:44,908 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 108 transitions [2019-12-27 07:01:07,662 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129058 states. [2019-12-27 07:01:07,664 INFO L276 IsEmpty]: Start isEmpty. Operand 129058 states. [2019-12-27 07:01:07,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 07:01:07,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:01:07,670 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 07:01:07,676 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 07:01:07,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:01:07,682 INFO L82 PathProgramCache]: Analyzing trace with hash 910080, now seen corresponding path program 1 times [2019-12-27 07:01:07,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:01:07,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063129924] [2019-12-27 07:01:07,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:01:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:01:07,909 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 07:01:07,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063129924] [2019-12-27 07:01:07,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:01:07,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:01:07,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866197441] [2019-12-27 07:01:07,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:01:07,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:01:07,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:01:07,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:01:07,930 INFO L87 Difference]: Start difference. First operand 129058 states. Second operand 3 states. [2019-12-27 07:01:09,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:01:09,382 INFO L93 Difference]: Finished difference Result 120110 states and 517368 transitions. [2019-12-27 07:01:09,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:01:09,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 07:01:09,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:01:13,133 INFO L225 Difference]: With dead ends: 120110 [2019-12-27 07:01:13,134 INFO L226 Difference]: Without dead ends: 112648 [2019-12-27 07:01:13,135 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 07:01:17,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112648 states. [2019-12-27 07:01:20,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112648 to 112648. [2019-12-27 07:01:20,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112648 states. [2019-12-27 07:01:21,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112648 states to 112648 states and 484580 transitions. [2019-12-27 07:01:21,097 INFO L78 Accepts]: Start accepts. Automaton has 112648 states and 484580 transitions. Word has length 3 [2019-12-27 07:01:21,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:01:21,098 INFO L462 AbstractCegarLoop]: Abstraction has 112648 states and 484580 transitions. [2019-12-27 07:01:21,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:01:21,098 INFO L276 IsEmpty]: Start isEmpty. Operand 112648 states and 484580 transitions. [2019-12-27 07:01:21,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:01:21,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:01:21,102 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:01:21,103 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 07:01:21,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:01:21,103 INFO L82 PathProgramCache]: Analyzing trace with hash 459684969, now seen corresponding path program 1 times [2019-12-27 07:01:21,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:01:21,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071879965] [2019-12-27 07:01:21,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:01:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:01:21,221 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 07:01:21,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071879965] [2019-12-27 07:01:21,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:01:21,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:01:21,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565115324] [2019-12-27 07:01:21,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:01:21,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:01:21,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:01:21,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:01:21,225 INFO L87 Difference]: Start difference. First operand 112648 states and 484580 transitions. Second operand 4 states. [2019-12-27 07:01:25,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:01:25,980 INFO L93 Difference]: Finished difference Result 175220 states and 723657 transitions. [2019-12-27 07:01:25,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:01:25,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:01:25,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:01:26,576 INFO L225 Difference]: With dead ends: 175220 [2019-12-27 07:01:26,577 INFO L226 Difference]: Without dead ends: 175171 [2019-12-27 07:01:26,578 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 07:01:32,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175171 states. [2019-12-27 07:01:41,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175171 to 161661. [2019-12-27 07:01:41,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161661 states. [2019-12-27 07:01:41,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161661 states to 161661 states and 675776 transitions. [2019-12-27 07:01:41,737 INFO L78 Accepts]: Start accepts. Automaton has 161661 states and 675776 transitions. Word has length 11 [2019-12-27 07:01:41,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:01:41,737 INFO L462 AbstractCegarLoop]: Abstraction has 161661 states and 675776 transitions. [2019-12-27 07:01:41,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:01:41,737 INFO L276 IsEmpty]: Start isEmpty. Operand 161661 states and 675776 transitions. [2019-12-27 07:01:41,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:01:41,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:01:41,743 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:01:41,743 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 07:01:41,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:01:41,744 INFO L82 PathProgramCache]: Analyzing trace with hash 8923152, now seen corresponding path program 1 times [2019-12-27 07:01:41,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:01:41,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223641250] [2019-12-27 07:01:41,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:01:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:01:41,796 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 07:01:41,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223641250] [2019-12-27 07:01:41,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:01:41,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:01:41,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786568868] [2019-12-27 07:01:41,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:01:41,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:01:41,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:01:41,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:01:41,800 INFO L87 Difference]: Start difference. First operand 161661 states and 675776 transitions. Second operand 3 states. [2019-12-27 07:01:41,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:01:41,926 INFO L93 Difference]: Finished difference Result 34935 states and 114696 transitions. [2019-12-27 07:01:41,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:01:41,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 07:01:41,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:01:42,009 INFO L225 Difference]: With dead ends: 34935 [2019-12-27 07:01:42,010 INFO L226 Difference]: Without dead ends: 34935 [2019-12-27 07:01:42,010 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 07:01:47,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34935 states. [2019-12-27 07:01:47,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34935 to 34935. [2019-12-27 07:01:47,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34935 states. [2019-12-27 07:01:48,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34935 states to 34935 states and 114696 transitions. [2019-12-27 07:01:48,032 INFO L78 Accepts]: Start accepts. Automaton has 34935 states and 114696 transitions. Word has length 13 [2019-12-27 07:01:48,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:01:48,033 INFO L462 AbstractCegarLoop]: Abstraction has 34935 states and 114696 transitions. [2019-12-27 07:01:48,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:01:48,033 INFO L276 IsEmpty]: Start isEmpty. Operand 34935 states and 114696 transitions. [2019-12-27 07:01:48,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 07:01:48,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:01:48,035 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:01:48,036 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 07:01:48,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:01:48,036 INFO L82 PathProgramCache]: Analyzing trace with hash 846496093, now seen corresponding path program 1 times [2019-12-27 07:01:48,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:01:48,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627302940] [2019-12-27 07:01:48,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:01:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:01:48,108 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 07:01:48,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627302940] [2019-12-27 07:01:48,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:01:48,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:01:48,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406336922] [2019-12-27 07:01:48,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:01:48,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:01:48,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:01:48,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:01:48,111 INFO L87 Difference]: Start difference. First operand 34935 states and 114696 transitions. Second operand 3 states. [2019-12-27 07:01:48,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:01:48,305 INFO L93 Difference]: Finished difference Result 52469 states and 171833 transitions. [2019-12-27 07:01:48,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:01:48,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 07:01:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:01:48,419 INFO L225 Difference]: With dead ends: 52469 [2019-12-27 07:01:48,419 INFO L226 Difference]: Without dead ends: 52469 [2019-12-27 07:01:48,420 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 07:01:48,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52469 states. [2019-12-27 07:01:49,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52469 to 39684. [2019-12-27 07:01:49,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39684 states. [2019-12-27 07:01:49,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39684 states to 39684 states and 131828 transitions. [2019-12-27 07:01:49,737 INFO L78 Accepts]: Start accepts. Automaton has 39684 states and 131828 transitions. Word has length 16 [2019-12-27 07:01:49,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:01:49,738 INFO L462 AbstractCegarLoop]: Abstraction has 39684 states and 131828 transitions. [2019-12-27 07:01:49,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:01:49,738 INFO L276 IsEmpty]: Start isEmpty. Operand 39684 states and 131828 transitions. [2019-12-27 07:01:49,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 07:01:49,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:01:49,741 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:01:49,741 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 07:01:49,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:01:49,741 INFO L82 PathProgramCache]: Analyzing trace with hash 973495126, now seen corresponding path program 1 times [2019-12-27 07:01:49,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:01:49,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781900208] [2019-12-27 07:01:49,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:01:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:01:49,823 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 07:01:49,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781900208] [2019-12-27 07:01:49,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:01:49,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:01:49,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807951002] [2019-12-27 07:01:49,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:01:49,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:01:49,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:01:49,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:01:49,826 INFO L87 Difference]: Start difference. First operand 39684 states and 131828 transitions. Second operand 5 states. [2019-12-27 07:01:50,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:01:50,338 INFO L93 Difference]: Finished difference Result 54128 states and 176711 transitions. [2019-12-27 07:01:50,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:01:50,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 07:01:50,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:01:50,429 INFO L225 Difference]: With dead ends: 54128 [2019-12-27 07:01:50,429 INFO L226 Difference]: Without dead ends: 54128 [2019-12-27 07:01:50,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:01:50,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54128 states. [2019-12-27 07:01:51,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54128 to 45196. [2019-12-27 07:01:51,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45196 states. [2019-12-27 07:01:51,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45196 states to 45196 states and 149182 transitions. [2019-12-27 07:01:51,310 INFO L78 Accepts]: Start accepts. Automaton has 45196 states and 149182 transitions. Word has length 16 [2019-12-27 07:01:51,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:01:51,310 INFO L462 AbstractCegarLoop]: Abstraction has 45196 states and 149182 transitions. [2019-12-27 07:01:51,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:01:51,310 INFO L276 IsEmpty]: Start isEmpty. Operand 45196 states and 149182 transitions. [2019-12-27 07:01:51,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 07:01:51,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:01:51,324 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 07:01:51,324 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 07:01:51,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:01:51,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1203621831, now seen corresponding path program 1 times [2019-12-27 07:01:51,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:01:51,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274929461] [2019-12-27 07:01:51,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:01:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:01:51,419 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 07:01:51,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274929461] [2019-12-27 07:01:51,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:01:51,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:01:51,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215906666] [2019-12-27 07:01:51,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:01:51,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:01:51,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:01:51,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:01:51,421 INFO L87 Difference]: Start difference. First operand 45196 states and 149182 transitions. Second operand 6 states. [2019-12-27 07:01:52,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:01:52,391 INFO L93 Difference]: Finished difference Result 67629 states and 216350 transitions. [2019-12-27 07:01:52,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:01:52,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 07:01:52,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:01:52,993 INFO L225 Difference]: With dead ends: 67629 [2019-12-27 07:01:52,993 INFO L226 Difference]: Without dead ends: 67622 [2019-12-27 07:01:52,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:01:53,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67622 states. [2019-12-27 07:01:53,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67622 to 44823. [2019-12-27 07:01:53,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44823 states. [2019-12-27 07:01:53,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44823 states to 44823 states and 147733 transitions. [2019-12-27 07:01:53,879 INFO L78 Accepts]: Start accepts. Automaton has 44823 states and 147733 transitions. Word has length 22 [2019-12-27 07:01:53,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:01:53,879 INFO L462 AbstractCegarLoop]: Abstraction has 44823 states and 147733 transitions. [2019-12-27 07:01:53,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:01:53,879 INFO L276 IsEmpty]: Start isEmpty. Operand 44823 states and 147733 transitions. [2019-12-27 07:01:53,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:01:53,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:01:53,897 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 07:01:53,897 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 07:01:53,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:01:53,897 INFO L82 PathProgramCache]: Analyzing trace with hash -573645910, now seen corresponding path program 1 times [2019-12-27 07:01:53,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:01:53,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457009775] [2019-12-27 07:01:53,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:01:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:01:53,958 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 07:01:53,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457009775] [2019-12-27 07:01:53,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:01:53,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:01:53,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175185812] [2019-12-27 07:01:53,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:01:53,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:01:53,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:01:53,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:01:53,960 INFO L87 Difference]: Start difference. First operand 44823 states and 147733 transitions. Second operand 4 states. [2019-12-27 07:01:54,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:01:54,039 INFO L93 Difference]: Finished difference Result 18428 states and 57604 transitions. [2019-12-27 07:01:54,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:01:54,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 07:01:54,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:01:54,066 INFO L225 Difference]: With dead ends: 18428 [2019-12-27 07:01:54,066 INFO L226 Difference]: Without dead ends: 18428 [2019-12-27 07:01:54,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:01:54,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18428 states. [2019-12-27 07:01:54,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18428 to 18100. [2019-12-27 07:01:54,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18100 states. [2019-12-27 07:01:54,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18100 states to 18100 states and 56668 transitions. [2019-12-27 07:01:54,351 INFO L78 Accepts]: Start accepts. Automaton has 18100 states and 56668 transitions. Word has length 25 [2019-12-27 07:01:54,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:01:54,351 INFO L462 AbstractCegarLoop]: Abstraction has 18100 states and 56668 transitions. [2019-12-27 07:01:54,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:01:54,351 INFO L276 IsEmpty]: Start isEmpty. Operand 18100 states and 56668 transitions. [2019-12-27 07:01:54,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 07:01:54,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:01:54,366 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 07:01:54,366 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 07:01:54,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:01:54,366 INFO L82 PathProgramCache]: Analyzing trace with hash -558988390, now seen corresponding path program 1 times [2019-12-27 07:01:54,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:01:54,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133495479] [2019-12-27 07:01:54,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:01:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:01:54,472 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 07:01:54,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133495479] [2019-12-27 07:01:54,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:01:54,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:01:54,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337940848] [2019-12-27 07:01:54,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:01:54,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:01:54,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:01:54,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:01:54,474 INFO L87 Difference]: Start difference. First operand 18100 states and 56668 transitions. Second operand 6 states. [2019-12-27 07:01:55,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:01:55,162 INFO L93 Difference]: Finished difference Result 25507 states and 76943 transitions. [2019-12-27 07:01:55,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:01:55,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 07:01:55,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:01:55,219 INFO L225 Difference]: With dead ends: 25507 [2019-12-27 07:01:55,219 INFO L226 Difference]: Without dead ends: 25507 [2019-12-27 07:01:55,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:01:55,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25507 states. [2019-12-27 07:01:55,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25507 to 20897. [2019-12-27 07:01:55,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20897 states. [2019-12-27 07:01:56,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20897 states to 20897 states and 64463 transitions. [2019-12-27 07:01:56,008 INFO L78 Accepts]: Start accepts. Automaton has 20897 states and 64463 transitions. Word has length 27 [2019-12-27 07:01:56,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:01:56,008 INFO L462 AbstractCegarLoop]: Abstraction has 20897 states and 64463 transitions. [2019-12-27 07:01:56,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:01:56,008 INFO L276 IsEmpty]: Start isEmpty. Operand 20897 states and 64463 transitions. [2019-12-27 07:01:56,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 07:01:56,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:01:56,033 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 07:01:56,033 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 07:01:56,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:01:56,033 INFO L82 PathProgramCache]: Analyzing trace with hash -856650103, now seen corresponding path program 1 times [2019-12-27 07:01:56,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:01:56,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413957804] [2019-12-27 07:01:56,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:01:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:01:56,121 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 07:01:56,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413957804] [2019-12-27 07:01:56,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:01:56,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:01:56,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945805581] [2019-12-27 07:01:56,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:01:56,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:01:56,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:01:56,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:01:56,123 INFO L87 Difference]: Start difference. First operand 20897 states and 64463 transitions. Second operand 7 states. [2019-12-27 07:01:57,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:01:57,335 INFO L93 Difference]: Finished difference Result 28486 states and 85230 transitions. [2019-12-27 07:01:57,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 07:01:57,336 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 07:01:57,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:01:57,378 INFO L225 Difference]: With dead ends: 28486 [2019-12-27 07:01:57,378 INFO L226 Difference]: Without dead ends: 28486 [2019-12-27 07:01:57,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 07:01:57,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28486 states. [2019-12-27 07:01:57,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28486 to 19834. [2019-12-27 07:01:57,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19834 states. [2019-12-27 07:01:57,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19834 states to 19834 states and 61281 transitions. [2019-12-27 07:01:57,731 INFO L78 Accepts]: Start accepts. Automaton has 19834 states and 61281 transitions. Word has length 33 [2019-12-27 07:01:57,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:01:57,731 INFO L462 AbstractCegarLoop]: Abstraction has 19834 states and 61281 transitions. [2019-12-27 07:01:57,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:01:57,732 INFO L276 IsEmpty]: Start isEmpty. Operand 19834 states and 61281 transitions. [2019-12-27 07:01:57,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 07:01:57,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:01:57,758 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 07:01:57,758 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 07:01:57,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:01:57,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1785376658, now seen corresponding path program 1 times [2019-12-27 07:01:57,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:01:57,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489547715] [2019-12-27 07:01:57,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:01:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:01:57,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:01:57,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489547715] [2019-12-27 07:01:57,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:01:57,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:01:57,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737344841] [2019-12-27 07:01:57,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:01:57,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:01:57,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:01:57,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:01:57,868 INFO L87 Difference]: Start difference. First operand 19834 states and 61281 transitions. Second operand 5 states. [2019-12-27 07:01:58,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:01:58,645 INFO L93 Difference]: Finished difference Result 28283 states and 86522 transitions. [2019-12-27 07:01:58,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:01:58,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 07:01:58,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:01:58,697 INFO L225 Difference]: With dead ends: 28283 [2019-12-27 07:01:58,697 INFO L226 Difference]: Without dead ends: 28283 [2019-12-27 07:01:58,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 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 07:01:58,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28283 states. [2019-12-27 07:01:59,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28283 to 26386. [2019-12-27 07:01:59,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26386 states. [2019-12-27 07:01:59,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26386 states to 26386 states and 81240 transitions. [2019-12-27 07:01:59,146 INFO L78 Accepts]: Start accepts. Automaton has 26386 states and 81240 transitions. Word has length 39 [2019-12-27 07:01:59,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:01:59,146 INFO L462 AbstractCegarLoop]: Abstraction has 26386 states and 81240 transitions. [2019-12-27 07:01:59,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:01:59,146 INFO L276 IsEmpty]: Start isEmpty. Operand 26386 states and 81240 transitions. [2019-12-27 07:01:59,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 07:01:59,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:01:59,176 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 07:01:59,177 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 07:01:59,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:01:59,177 INFO L82 PathProgramCache]: Analyzing trace with hash -967157718, now seen corresponding path program 2 times [2019-12-27 07:01:59,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:01:59,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880750253] [2019-12-27 07:01:59,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:01:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:01:59,236 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 07:01:59,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880750253] [2019-12-27 07:01:59,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:01:59,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:01:59,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317857207] [2019-12-27 07:01:59,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:01:59,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:01:59,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:01:59,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:01:59,239 INFO L87 Difference]: Start difference. First operand 26386 states and 81240 transitions. Second operand 5 states. [2019-12-27 07:01:59,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:01:59,639 INFO L93 Difference]: Finished difference Result 24998 states and 77951 transitions. [2019-12-27 07:01:59,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:01:59,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 07:01:59,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:01:59,676 INFO L225 Difference]: With dead ends: 24998 [2019-12-27 07:01:59,676 INFO L226 Difference]: Without dead ends: 24998 [2019-12-27 07:01:59,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:01:59,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24998 states. [2019-12-27 07:02:00,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24998 to 24032. [2019-12-27 07:02:00,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24032 states. [2019-12-27 07:02:00,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24032 states to 24032 states and 75345 transitions. [2019-12-27 07:02:00,047 INFO L78 Accepts]: Start accepts. Automaton has 24032 states and 75345 transitions. Word has length 39 [2019-12-27 07:02:00,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:00,047 INFO L462 AbstractCegarLoop]: Abstraction has 24032 states and 75345 transitions. [2019-12-27 07:02:00,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:02:00,047 INFO L276 IsEmpty]: Start isEmpty. Operand 24032 states and 75345 transitions. [2019-12-27 07:02:00,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 07:02:00,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:00,073 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 07:02:00,074 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 07:02:00,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:00,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1198798044, now seen corresponding path program 1 times [2019-12-27 07:02:00,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:00,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739392321] [2019-12-27 07:02:00,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:00,172 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 07:02:00,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739392321] [2019-12-27 07:02:00,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:00,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:02:00,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059059558] [2019-12-27 07:02:00,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:02:00,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:00,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:02:00,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:02:00,174 INFO L87 Difference]: Start difference. First operand 24032 states and 75345 transitions. Second operand 7 states. [2019-12-27 07:02:00,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:00,674 INFO L93 Difference]: Finished difference Result 67799 states and 211747 transitions. [2019-12-27 07:02:00,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 07:02:00,675 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 07:02:00,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:00,754 INFO L225 Difference]: With dead ends: 67799 [2019-12-27 07:02:00,754 INFO L226 Difference]: Without dead ends: 51948 [2019-12-27 07:02:00,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:02:00,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51948 states. [2019-12-27 07:02:01,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51948 to 27688. [2019-12-27 07:02:01,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27688 states. [2019-12-27 07:02:01,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27688 states to 27688 states and 87532 transitions. [2019-12-27 07:02:01,393 INFO L78 Accepts]: Start accepts. Automaton has 27688 states and 87532 transitions. Word has length 64 [2019-12-27 07:02:01,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:01,393 INFO L462 AbstractCegarLoop]: Abstraction has 27688 states and 87532 transitions. [2019-12-27 07:02:01,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:02:01,393 INFO L276 IsEmpty]: Start isEmpty. Operand 27688 states and 87532 transitions. [2019-12-27 07:02:01,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 07:02:01,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:01,438 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 07:02:01,438 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 07:02:01,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:01,438 INFO L82 PathProgramCache]: Analyzing trace with hash 207970498, now seen corresponding path program 2 times [2019-12-27 07:02:01,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:01,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257096700] [2019-12-27 07:02:01,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:01,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:02:01,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257096700] [2019-12-27 07:02:01,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:01,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:02:01,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401002913] [2019-12-27 07:02:01,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:02:01,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:01,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:02:01,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:02:01,539 INFO L87 Difference]: Start difference. First operand 27688 states and 87532 transitions. Second operand 7 states. [2019-12-27 07:02:02,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:02,158 INFO L93 Difference]: Finished difference Result 76922 states and 238949 transitions. [2019-12-27 07:02:02,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:02:02,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 07:02:02,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:02,249 INFO L225 Difference]: With dead ends: 76922 [2019-12-27 07:02:02,249 INFO L226 Difference]: Without dead ends: 54229 [2019-12-27 07:02:02,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 07:02:02,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54229 states. [2019-12-27 07:02:03,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54229 to 32348. [2019-12-27 07:02:03,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32348 states. [2019-12-27 07:02:03,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32348 states to 32348 states and 102236 transitions. [2019-12-27 07:02:03,333 INFO L78 Accepts]: Start accepts. Automaton has 32348 states and 102236 transitions. Word has length 64 [2019-12-27 07:02:03,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:03,333 INFO L462 AbstractCegarLoop]: Abstraction has 32348 states and 102236 transitions. [2019-12-27 07:02:03,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:02:03,333 INFO L276 IsEmpty]: Start isEmpty. Operand 32348 states and 102236 transitions. [2019-12-27 07:02:03,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 07:02:03,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:03,371 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 07:02:03,372 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 07:02:03,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:03,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1789319912, now seen corresponding path program 3 times [2019-12-27 07:02:03,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:03,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856372700] [2019-12-27 07:02:03,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:03,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 07:02:03,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856372700] [2019-12-27 07:02:03,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:03,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:02:03,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596460123] [2019-12-27 07:02:03,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:02:03,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:03,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:02:03,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:02:03,468 INFO L87 Difference]: Start difference. First operand 32348 states and 102236 transitions. Second operand 7 states. [2019-12-27 07:02:04,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:04,170 INFO L93 Difference]: Finished difference Result 65367 states and 203736 transitions. [2019-12-27 07:02:04,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 07:02:04,170 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 07:02:04,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:04,305 INFO L225 Difference]: With dead ends: 65367 [2019-12-27 07:02:04,305 INFO L226 Difference]: Without dead ends: 58008 [2019-12-27 07:02:04,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:02:04,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58008 states. [2019-12-27 07:02:05,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58008 to 32656. [2019-12-27 07:02:05,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32656 states. [2019-12-27 07:02:05,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32656 states to 32656 states and 103187 transitions. [2019-12-27 07:02:05,150 INFO L78 Accepts]: Start accepts. Automaton has 32656 states and 103187 transitions. Word has length 64 [2019-12-27 07:02:05,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:05,151 INFO L462 AbstractCegarLoop]: Abstraction has 32656 states and 103187 transitions. [2019-12-27 07:02:05,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:02:05,151 INFO L276 IsEmpty]: Start isEmpty. Operand 32656 states and 103187 transitions. [2019-12-27 07:02:05,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 07:02:05,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:05,188 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 07:02:05,188 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 07:02:05,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:05,188 INFO L82 PathProgramCache]: Analyzing trace with hash 755538776, now seen corresponding path program 4 times [2019-12-27 07:02:05,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:05,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364041360] [2019-12-27 07:02:05,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:05,267 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 07:02:05,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364041360] [2019-12-27 07:02:05,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:05,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:02:05,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382700394] [2019-12-27 07:02:05,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:02:05,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:05,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:02:05,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:02:05,269 INFO L87 Difference]: Start difference. First operand 32656 states and 103187 transitions. Second operand 3 states. [2019-12-27 07:02:05,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:05,763 INFO L93 Difference]: Finished difference Result 39410 states and 123345 transitions. [2019-12-27 07:02:05,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:02:05,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 07:02:05,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:05,840 INFO L225 Difference]: With dead ends: 39410 [2019-12-27 07:02:05,841 INFO L226 Difference]: Without dead ends: 39410 [2019-12-27 07:02:05,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:02:05,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39410 states. [2019-12-27 07:02:06,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39410 to 34552. [2019-12-27 07:02:06,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34552 states. [2019-12-27 07:02:06,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34552 states to 34552 states and 109132 transitions. [2019-12-27 07:02:06,443 INFO L78 Accepts]: Start accepts. Automaton has 34552 states and 109132 transitions. Word has length 64 [2019-12-27 07:02:06,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:06,444 INFO L462 AbstractCegarLoop]: Abstraction has 34552 states and 109132 transitions. [2019-12-27 07:02:06,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:02:06,444 INFO L276 IsEmpty]: Start isEmpty. Operand 34552 states and 109132 transitions. [2019-12-27 07:02:06,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:02:06,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:06,484 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 07:02:06,484 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 07:02:06,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:06,485 INFO L82 PathProgramCache]: Analyzing trace with hash -2009701319, now seen corresponding path program 1 times [2019-12-27 07:02:06,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:06,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633846716] [2019-12-27 07:02:06,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:06,544 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 07:02:06,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633846716] [2019-12-27 07:02:06,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:06,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:02:06,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515727334] [2019-12-27 07:02:06,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:02:06,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:06,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:02:06,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:02:06,546 INFO L87 Difference]: Start difference. First operand 34552 states and 109132 transitions. Second operand 4 states. [2019-12-27 07:02:06,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:06,947 INFO L93 Difference]: Finished difference Result 53912 states and 170313 transitions. [2019-12-27 07:02:06,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:02:06,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 07:02:06,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:07,031 INFO L225 Difference]: With dead ends: 53912 [2019-12-27 07:02:07,032 INFO L226 Difference]: Without dead ends: 53912 [2019-12-27 07:02:07,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 07:02:07,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53912 states. [2019-12-27 07:02:07,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53912 to 37800. [2019-12-27 07:02:07,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37800 states. [2019-12-27 07:02:07,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37800 states to 37800 states and 120622 transitions. [2019-12-27 07:02:07,781 INFO L78 Accepts]: Start accepts. Automaton has 37800 states and 120622 transitions. Word has length 65 [2019-12-27 07:02:07,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:07,781 INFO L462 AbstractCegarLoop]: Abstraction has 37800 states and 120622 transitions. [2019-12-27 07:02:07,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:02:07,781 INFO L276 IsEmpty]: Start isEmpty. Operand 37800 states and 120622 transitions. [2019-12-27 07:02:07,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:02:07,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:07,821 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 07:02:07,821 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 07:02:07,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:07,821 INFO L82 PathProgramCache]: Analyzing trace with hash 2089376379, now seen corresponding path program 2 times [2019-12-27 07:02:07,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:07,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356847931] [2019-12-27 07:02:07,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:07,872 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 07:02:07,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356847931] [2019-12-27 07:02:07,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:07,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:02:07,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100698712] [2019-12-27 07:02:07,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:02:07,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:07,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:02:07,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:02:07,874 INFO L87 Difference]: Start difference. First operand 37800 states and 120622 transitions. Second operand 3 states. [2019-12-27 07:02:08,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:08,567 INFO L93 Difference]: Finished difference Result 53096 states and 168447 transitions. [2019-12-27 07:02:08,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:02:08,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:02:08,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:08,659 INFO L225 Difference]: With dead ends: 53096 [2019-12-27 07:02:08,659 INFO L226 Difference]: Without dead ends: 53096 [2019-12-27 07:02:08,660 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 07:02:08,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53096 states. [2019-12-27 07:02:09,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53096 to 38139. [2019-12-27 07:02:09,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38139 states. [2019-12-27 07:02:09,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38139 states to 38139 states and 121744 transitions. [2019-12-27 07:02:09,345 INFO L78 Accepts]: Start accepts. Automaton has 38139 states and 121744 transitions. Word has length 65 [2019-12-27 07:02:09,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:09,346 INFO L462 AbstractCegarLoop]: Abstraction has 38139 states and 121744 transitions. [2019-12-27 07:02:09,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:02:09,346 INFO L276 IsEmpty]: Start isEmpty. Operand 38139 states and 121744 transitions. [2019-12-27 07:02:09,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:02:09,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:09,393 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 07:02:09,393 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 07:02:09,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:09,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1218113347, now seen corresponding path program 3 times [2019-12-27 07:02:09,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:09,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325453468] [2019-12-27 07:02:09,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:09,445 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 07:02:09,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325453468] [2019-12-27 07:02:09,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:09,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:02:09,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505966070] [2019-12-27 07:02:09,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:02:09,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:09,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:02:09,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:02:09,448 INFO L87 Difference]: Start difference. First operand 38139 states and 121744 transitions. Second operand 4 states. [2019-12-27 07:02:09,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:09,863 INFO L93 Difference]: Finished difference Result 47614 states and 149860 transitions. [2019-12-27 07:02:09,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:02:09,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 07:02:09,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:09,961 INFO L225 Difference]: With dead ends: 47614 [2019-12-27 07:02:09,961 INFO L226 Difference]: Without dead ends: 47614 [2019-12-27 07:02:09,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:02:10,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47614 states. [2019-12-27 07:02:10,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47614 to 38055. [2019-12-27 07:02:10,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38055 states. [2019-12-27 07:02:10,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38055 states to 38055 states and 121477 transitions. [2019-12-27 07:02:10,691 INFO L78 Accepts]: Start accepts. Automaton has 38055 states and 121477 transitions. Word has length 65 [2019-12-27 07:02:10,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:10,691 INFO L462 AbstractCegarLoop]: Abstraction has 38055 states and 121477 transitions. [2019-12-27 07:02:10,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:02:10,691 INFO L276 IsEmpty]: Start isEmpty. Operand 38055 states and 121477 transitions. [2019-12-27 07:02:10,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:02:10,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:10,731 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 07:02:10,731 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 07:02:10,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:10,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1789961201, now seen corresponding path program 4 times [2019-12-27 07:02:10,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:10,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080417294] [2019-12-27 07:02:10,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:10,814 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 07:02:10,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080417294] [2019-12-27 07:02:10,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:10,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:02:10,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60423002] [2019-12-27 07:02:10,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:02:10,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:10,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:02:10,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:02:10,816 INFO L87 Difference]: Start difference. First operand 38055 states and 121477 transitions. Second operand 7 states. [2019-12-27 07:02:11,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:11,744 INFO L93 Difference]: Finished difference Result 80005 states and 251266 transitions. [2019-12-27 07:02:11,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 07:02:11,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 07:02:11,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:11,907 INFO L225 Difference]: With dead ends: 80005 [2019-12-27 07:02:11,908 INFO L226 Difference]: Without dead ends: 73765 [2019-12-27 07:02:11,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 07:02:12,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73765 states. [2019-12-27 07:02:12,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73765 to 38119. [2019-12-27 07:02:12,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38119 states. [2019-12-27 07:02:12,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38119 states to 38119 states and 121695 transitions. [2019-12-27 07:02:12,769 INFO L78 Accepts]: Start accepts. Automaton has 38119 states and 121695 transitions. Word has length 65 [2019-12-27 07:02:12,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:12,769 INFO L462 AbstractCegarLoop]: Abstraction has 38119 states and 121695 transitions. [2019-12-27 07:02:12,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:02:12,769 INFO L276 IsEmpty]: Start isEmpty. Operand 38119 states and 121695 transitions. [2019-12-27 07:02:12,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:02:12,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:12,812 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 07:02:12,812 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 07:02:12,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:12,812 INFO L82 PathProgramCache]: Analyzing trace with hash 206855563, now seen corresponding path program 5 times [2019-12-27 07:02:12,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:12,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957067472] [2019-12-27 07:02:12,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:12,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:02:12,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957067472] [2019-12-27 07:02:12,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:12,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:02:12,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369958983] [2019-12-27 07:02:12,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:02:12,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:12,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:02:12,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:02:12,915 INFO L87 Difference]: Start difference. First operand 38119 states and 121695 transitions. Second operand 7 states. [2019-12-27 07:02:13,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:13,619 INFO L93 Difference]: Finished difference Result 60800 states and 193788 transitions. [2019-12-27 07:02:13,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:02:13,619 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 07:02:13,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:13,723 INFO L225 Difference]: With dead ends: 60800 [2019-12-27 07:02:13,723 INFO L226 Difference]: Without dead ends: 60800 [2019-12-27 07:02:13,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:02:13,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60800 states. [2019-12-27 07:02:15,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60800 to 39093. [2019-12-27 07:02:15,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39093 states. [2019-12-27 07:02:15,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39093 states to 39093 states and 124695 transitions. [2019-12-27 07:02:15,089 INFO L78 Accepts]: Start accepts. Automaton has 39093 states and 124695 transitions. Word has length 65 [2019-12-27 07:02:15,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:15,090 INFO L462 AbstractCegarLoop]: Abstraction has 39093 states and 124695 transitions. [2019-12-27 07:02:15,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:02:15,090 INFO L276 IsEmpty]: Start isEmpty. Operand 39093 states and 124695 transitions. [2019-12-27 07:02:15,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:02:15,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:15,133 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 07:02:15,134 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 07:02:15,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:15,134 INFO L82 PathProgramCache]: Analyzing trace with hash -217073613, now seen corresponding path program 6 times [2019-12-27 07:02:15,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:15,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678475551] [2019-12-27 07:02:15,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:15,197 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 07:02:15,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678475551] [2019-12-27 07:02:15,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:15,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:02:15,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766919732] [2019-12-27 07:02:15,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:02:15,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:15,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:02:15,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:02:15,199 INFO L87 Difference]: Start difference. First operand 39093 states and 124695 transitions. Second operand 4 states. [2019-12-27 07:02:15,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:15,431 INFO L93 Difference]: Finished difference Result 47014 states and 149097 transitions. [2019-12-27 07:02:15,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:02:15,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 07:02:15,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:15,500 INFO L225 Difference]: With dead ends: 47014 [2019-12-27 07:02:15,500 INFO L226 Difference]: Without dead ends: 47014 [2019-12-27 07:02:15,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 07:02:15,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47014 states. [2019-12-27 07:02:16,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47014 to 36010. [2019-12-27 07:02:16,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36010 states. [2019-12-27 07:02:16,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36010 states to 36010 states and 114136 transitions. [2019-12-27 07:02:16,175 INFO L78 Accepts]: Start accepts. Automaton has 36010 states and 114136 transitions. Word has length 65 [2019-12-27 07:02:16,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:16,176 INFO L462 AbstractCegarLoop]: Abstraction has 36010 states and 114136 transitions. [2019-12-27 07:02:16,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:02:16,176 INFO L276 IsEmpty]: Start isEmpty. Operand 36010 states and 114136 transitions. [2019-12-27 07:02:16,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:02:16,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:16,223 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 07:02:16,223 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 07:02:16,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:16,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1865713068, now seen corresponding path program 1 times [2019-12-27 07:02:16,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:16,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729631345] [2019-12-27 07:02:16,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:16,284 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 07:02:16,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729631345] [2019-12-27 07:02:16,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:16,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:02:16,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583591094] [2019-12-27 07:02:16,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:02:16,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:16,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:02:16,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:02:16,286 INFO L87 Difference]: Start difference. First operand 36010 states and 114136 transitions. Second operand 3 states. [2019-12-27 07:02:16,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:16,448 INFO L93 Difference]: Finished difference Result 36010 states and 114135 transitions. [2019-12-27 07:02:16,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:02:16,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:02:16,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:16,541 INFO L225 Difference]: With dead ends: 36010 [2019-12-27 07:02:16,541 INFO L226 Difference]: Without dead ends: 36010 [2019-12-27 07:02:16,542 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 07:02:16,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36010 states. [2019-12-27 07:02:17,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36010 to 31976. [2019-12-27 07:02:17,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31976 states. [2019-12-27 07:02:17,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31976 states to 31976 states and 102860 transitions. [2019-12-27 07:02:17,575 INFO L78 Accepts]: Start accepts. Automaton has 31976 states and 102860 transitions. Word has length 65 [2019-12-27 07:02:17,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:17,575 INFO L462 AbstractCegarLoop]: Abstraction has 31976 states and 102860 transitions. [2019-12-27 07:02:17,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:02:17,575 INFO L276 IsEmpty]: Start isEmpty. Operand 31976 states and 102860 transitions. [2019-12-27 07:02:17,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:02:17,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:17,627 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 07:02:17,627 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 07:02:17,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:17,628 INFO L82 PathProgramCache]: Analyzing trace with hash 747197170, now seen corresponding path program 1 times [2019-12-27 07:02:17,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:17,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120196378] [2019-12-27 07:02:17,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:17,687 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 07:02:17,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120196378] [2019-12-27 07:02:17,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:17,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:02:17,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378423685] [2019-12-27 07:02:17,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:02:17,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:17,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:02:17,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:02:17,691 INFO L87 Difference]: Start difference. First operand 31976 states and 102860 transitions. Second operand 3 states. [2019-12-27 07:02:17,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:17,806 INFO L93 Difference]: Finished difference Result 26693 states and 84212 transitions. [2019-12-27 07:02:17,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:02:17,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 07:02:17,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:17,842 INFO L225 Difference]: With dead ends: 26693 [2019-12-27 07:02:17,842 INFO L226 Difference]: Without dead ends: 26693 [2019-12-27 07:02:17,843 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 07:02:17,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26693 states. [2019-12-27 07:02:18,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26693 to 24273. [2019-12-27 07:02:18,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24273 states. [2019-12-27 07:02:18,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24273 states to 24273 states and 76412 transitions. [2019-12-27 07:02:18,584 INFO L78 Accepts]: Start accepts. Automaton has 24273 states and 76412 transitions. Word has length 66 [2019-12-27 07:02:18,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:18,584 INFO L462 AbstractCegarLoop]: Abstraction has 24273 states and 76412 transitions. [2019-12-27 07:02:18,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:02:18,584 INFO L276 IsEmpty]: Start isEmpty. Operand 24273 states and 76412 transitions. [2019-12-27 07:02:18,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:02:18,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:18,615 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 07:02:18,615 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 07:02:18,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:18,615 INFO L82 PathProgramCache]: Analyzing trace with hash 863231349, now seen corresponding path program 1 times [2019-12-27 07:02:18,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:18,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974847146] [2019-12-27 07:02:18,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:18,773 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 07:02:18,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974847146] [2019-12-27 07:02:18,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:18,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:02:18,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443839555] [2019-12-27 07:02:18,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 07:02:18,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:18,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 07:02:18,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:02:18,778 INFO L87 Difference]: Start difference. First operand 24273 states and 76412 transitions. Second operand 10 states. [2019-12-27 07:02:20,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:20,067 INFO L93 Difference]: Finished difference Result 35523 states and 111659 transitions. [2019-12-27 07:02:20,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 07:02:20,068 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 07:02:20,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:20,111 INFO L225 Difference]: With dead ends: 35523 [2019-12-27 07:02:20,111 INFO L226 Difference]: Without dead ends: 28791 [2019-12-27 07:02:20,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-12-27 07:02:20,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28791 states. [2019-12-27 07:02:20,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28791 to 24621. [2019-12-27 07:02:20,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24621 states. [2019-12-27 07:02:20,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24621 states to 24621 states and 77383 transitions. [2019-12-27 07:02:20,516 INFO L78 Accepts]: Start accepts. Automaton has 24621 states and 77383 transitions. Word has length 67 [2019-12-27 07:02:20,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:20,516 INFO L462 AbstractCegarLoop]: Abstraction has 24621 states and 77383 transitions. [2019-12-27 07:02:20,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 07:02:20,516 INFO L276 IsEmpty]: Start isEmpty. Operand 24621 states and 77383 transitions. [2019-12-27 07:02:20,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:02:20,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:20,545 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 07:02:20,545 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 07:02:20,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:20,545 INFO L82 PathProgramCache]: Analyzing trace with hash -783490325, now seen corresponding path program 2 times [2019-12-27 07:02:20,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:20,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259216060] [2019-12-27 07:02:20,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:20,743 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 07:02:20,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259216060] [2019-12-27 07:02:20,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:20,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:02:20,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986873381] [2019-12-27 07:02:20,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 07:02:20,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:20,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 07:02:20,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:02:20,745 INFO L87 Difference]: Start difference. First operand 24621 states and 77383 transitions. Second operand 10 states. [2019-12-27 07:02:21,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:21,953 INFO L93 Difference]: Finished difference Result 36137 states and 112823 transitions. [2019-12-27 07:02:21,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 07:02:21,960 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 07:02:21,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:22,003 INFO L225 Difference]: With dead ends: 36137 [2019-12-27 07:02:22,003 INFO L226 Difference]: Without dead ends: 30919 [2019-12-27 07:02:22,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-27 07:02:22,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30919 states. [2019-12-27 07:02:22,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30919 to 25169. [2019-12-27 07:02:22,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25169 states. [2019-12-27 07:02:22,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25169 states to 25169 states and 78786 transitions. [2019-12-27 07:02:22,449 INFO L78 Accepts]: Start accepts. Automaton has 25169 states and 78786 transitions. Word has length 67 [2019-12-27 07:02:22,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:22,449 INFO L462 AbstractCegarLoop]: Abstraction has 25169 states and 78786 transitions. [2019-12-27 07:02:22,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 07:02:22,449 INFO L276 IsEmpty]: Start isEmpty. Operand 25169 states and 78786 transitions. [2019-12-27 07:02:22,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:02:22,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:22,476 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 07:02:22,477 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 07:02:22,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:22,477 INFO L82 PathProgramCache]: Analyzing trace with hash 17868619, now seen corresponding path program 3 times [2019-12-27 07:02:22,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:22,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184099663] [2019-12-27 07:02:22,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:22,654 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 07:02:22,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184099663] [2019-12-27 07:02:22,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:22,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:02:22,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940349859] [2019-12-27 07:02:22,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 07:02:22,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:22,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 07:02:22,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:02:22,657 INFO L87 Difference]: Start difference. First operand 25169 states and 78786 transitions. Second operand 11 states. [2019-12-27 07:02:24,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:24,279 INFO L93 Difference]: Finished difference Result 34459 states and 107407 transitions. [2019-12-27 07:02:24,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 07:02:24,280 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 07:02:24,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:24,327 INFO L225 Difference]: With dead ends: 34459 [2019-12-27 07:02:24,327 INFO L226 Difference]: Without dead ends: 30448 [2019-12-27 07:02:24,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-27 07:02:24,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30448 states. [2019-12-27 07:02:24,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30448 to 24805. [2019-12-27 07:02:24,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24805 states. [2019-12-27 07:02:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24805 states to 24805 states and 77645 transitions. [2019-12-27 07:02:24,763 INFO L78 Accepts]: Start accepts. Automaton has 24805 states and 77645 transitions. Word has length 67 [2019-12-27 07:02:24,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:24,764 INFO L462 AbstractCegarLoop]: Abstraction has 24805 states and 77645 transitions. [2019-12-27 07:02:24,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 07:02:24,764 INFO L276 IsEmpty]: Start isEmpty. Operand 24805 states and 77645 transitions. [2019-12-27 07:02:24,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:02:24,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:24,791 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 07:02:24,791 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 07:02:24,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:24,791 INFO L82 PathProgramCache]: Analyzing trace with hash 455548979, now seen corresponding path program 4 times [2019-12-27 07:02:24,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:24,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859432318] [2019-12-27 07:02:24,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:24,948 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 07:02:24,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859432318] [2019-12-27 07:02:24,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:24,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:02:24,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740610399] [2019-12-27 07:02:24,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 07:02:24,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:24,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 07:02:24,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:02:24,949 INFO L87 Difference]: Start difference. First operand 24805 states and 77645 transitions. Second operand 11 states. [2019-12-27 07:02:26,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:26,570 INFO L93 Difference]: Finished difference Result 34818 states and 109238 transitions. [2019-12-27 07:02:26,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 07:02:26,571 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 07:02:26,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:26,616 INFO L225 Difference]: With dead ends: 34818 [2019-12-27 07:02:26,616 INFO L226 Difference]: Without dead ends: 30605 [2019-12-27 07:02:26,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-27 07:02:26,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30605 states. [2019-12-27 07:02:27,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30605 to 25253. [2019-12-27 07:02:27,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25253 states. [2019-12-27 07:02:27,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25253 states to 25253 states and 78938 transitions. [2019-12-27 07:02:27,050 INFO L78 Accepts]: Start accepts. Automaton has 25253 states and 78938 transitions. Word has length 67 [2019-12-27 07:02:27,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:27,050 INFO L462 AbstractCegarLoop]: Abstraction has 25253 states and 78938 transitions. [2019-12-27 07:02:27,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 07:02:27,050 INFO L276 IsEmpty]: Start isEmpty. Operand 25253 states and 78938 transitions. [2019-12-27 07:02:27,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:02:27,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:27,079 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 07:02:27,080 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 07:02:27,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:27,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1968134607, now seen corresponding path program 5 times [2019-12-27 07:02:27,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:27,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882790129] [2019-12-27 07:02:27,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:27,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:02:27,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882790129] [2019-12-27 07:02:27,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:27,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 07:02:27,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056302470] [2019-12-27 07:02:27,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 07:02:27,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:27,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 07:02:27,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:02:27,221 INFO L87 Difference]: Start difference. First operand 25253 states and 78938 transitions. Second operand 12 states. [2019-12-27 07:02:28,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:28,702 INFO L93 Difference]: Finished difference Result 33339 states and 103850 transitions. [2019-12-27 07:02:28,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 07:02:28,702 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 07:02:28,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:28,748 INFO L225 Difference]: With dead ends: 33339 [2019-12-27 07:02:28,749 INFO L226 Difference]: Without dead ends: 31807 [2019-12-27 07:02:28,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-27 07:02:28,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31807 states. [2019-12-27 07:02:29,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31807 to 25153. [2019-12-27 07:02:29,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25153 states. [2019-12-27 07:02:29,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25153 states to 25153 states and 78612 transitions. [2019-12-27 07:02:29,578 INFO L78 Accepts]: Start accepts. Automaton has 25153 states and 78612 transitions. Word has length 67 [2019-12-27 07:02:29,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:29,578 INFO L462 AbstractCegarLoop]: Abstraction has 25153 states and 78612 transitions. [2019-12-27 07:02:29,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 07:02:29,578 INFO L276 IsEmpty]: Start isEmpty. Operand 25153 states and 78612 transitions. [2019-12-27 07:02:29,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:02:29,605 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:29,605 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 07:02:29,605 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 07:02:29,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:29,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1913997353, now seen corresponding path program 6 times [2019-12-27 07:02:29,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:29,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719659246] [2019-12-27 07:02:29,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02: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 07:02:30,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719659246] [2019-12-27 07:02:30,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:30,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 07:02:30,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128500508] [2019-12-27 07:02:30,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 07:02:30,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:30,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 07:02:30,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-12-27 07:02:30,208 INFO L87 Difference]: Start difference. First operand 25153 states and 78612 transitions. Second operand 17 states. [2019-12-27 07:02:32,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:32,309 INFO L93 Difference]: Finished difference Result 29039 states and 89500 transitions. [2019-12-27 07:02:32,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 07:02:32,309 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 07:02:32,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:32,353 INFO L225 Difference]: With dead ends: 29039 [2019-12-27 07:02:32,353 INFO L226 Difference]: Without dead ends: 28423 [2019-12-27 07:02:32,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2019-12-27 07:02:32,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28423 states. [2019-12-27 07:02:32,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28423 to 25522. [2019-12-27 07:02:32,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25522 states. [2019-12-27 07:02:32,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25522 states to 25522 states and 79471 transitions. [2019-12-27 07:02:32,758 INFO L78 Accepts]: Start accepts. Automaton has 25522 states and 79471 transitions. Word has length 67 [2019-12-27 07:02:32,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:32,758 INFO L462 AbstractCegarLoop]: Abstraction has 25522 states and 79471 transitions. [2019-12-27 07:02:32,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 07:02:32,758 INFO L276 IsEmpty]: Start isEmpty. Operand 25522 states and 79471 transitions. [2019-12-27 07:02:32,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:02:32,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:32,786 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 07:02:32,786 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 07:02:32,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:32,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1272640249, now seen corresponding path program 7 times [2019-12-27 07:02:32,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:32,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521627909] [2019-12-27 07:02:32,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:32,956 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 07:02:32,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521627909] [2019-12-27 07:02:32,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:32,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:02:32,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456577169] [2019-12-27 07:02:32,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 07:02:32,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:32,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 07:02:32,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:02:32,960 INFO L87 Difference]: Start difference. First operand 25522 states and 79471 transitions. Second operand 11 states. [2019-12-27 07:02:34,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:34,264 INFO L93 Difference]: Finished difference Result 52028 states and 162072 transitions. [2019-12-27 07:02:34,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 07:02:34,264 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 07:02:34,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:34,329 INFO L225 Difference]: With dead ends: 52028 [2019-12-27 07:02:34,329 INFO L226 Difference]: Without dead ends: 40204 [2019-12-27 07:02:34,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 07:02:34,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40204 states. [2019-12-27 07:02:34,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40204 to 23316. [2019-12-27 07:02:34,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23316 states. [2019-12-27 07:02:34,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23316 states to 23316 states and 72437 transitions. [2019-12-27 07:02:34,830 INFO L78 Accepts]: Start accepts. Automaton has 23316 states and 72437 transitions. Word has length 67 [2019-12-27 07:02:34,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:34,830 INFO L462 AbstractCegarLoop]: Abstraction has 23316 states and 72437 transitions. [2019-12-27 07:02:34,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 07:02:34,830 INFO L276 IsEmpty]: Start isEmpty. Operand 23316 states and 72437 transitions. [2019-12-27 07:02:34,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:02:34,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:34,858 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 07:02:34,858 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:02:34,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:34,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1730024245, now seen corresponding path program 8 times [2019-12-27 07:02:34,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:34,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729035302] [2019-12-27 07:02:34,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:35,024 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 07:02:35,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729035302] [2019-12-27 07:02:35,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:35,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 07:02:35,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460935031] [2019-12-27 07:02:35,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 07:02:35,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:35,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 07:02:35,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:02:35,027 INFO L87 Difference]: Start difference. First operand 23316 states and 72437 transitions. Second operand 12 states. [2019-12-27 07:02:36,262 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-12-27 07:02:36,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:36,473 INFO L93 Difference]: Finished difference Result 40222 states and 125091 transitions. [2019-12-27 07:02:36,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 07:02:36,474 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 07:02:36,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:36,528 INFO L225 Difference]: With dead ends: 40222 [2019-12-27 07:02:36,528 INFO L226 Difference]: Without dead ends: 39979 [2019-12-27 07:02:36,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 07:02:36,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39979 states. [2019-12-27 07:02:36,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39979 to 23140. [2019-12-27 07:02:36,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23140 states. [2019-12-27 07:02:36,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23140 states to 23140 states and 71981 transitions. [2019-12-27 07:02:36,990 INFO L78 Accepts]: Start accepts. Automaton has 23140 states and 71981 transitions. Word has length 67 [2019-12-27 07:02:36,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:36,990 INFO L462 AbstractCegarLoop]: Abstraction has 23140 states and 71981 transitions. [2019-12-27 07:02:36,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 07:02:36,990 INFO L276 IsEmpty]: Start isEmpty. Operand 23140 states and 71981 transitions. [2019-12-27 07:02:37,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:02:37,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:37,012 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 07:02:37,013 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:02:37,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:37,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1929562173, now seen corresponding path program 9 times [2019-12-27 07:02:37,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:37,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265797388] [2019-12-27 07:02:37,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:02:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:02:37,136 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:02:37,137 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:02:37,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$r_buff1_thd0~0_24) (= v_~z$r_buff0_thd3~0_78 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~z$w_buff0_used~0_113 0) (= v_~z$read_delayed_var~0.offset_6 0) (= 0 v_~__unbuffered_p0_EAX~0_15) (= |v_#NULL.offset_7| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1570~0.base_21|)) (= 0 v_~z$w_buff0~0_27) (= 0 v_~z$r_buff1_thd2~0_17) (= 0 v_~z$flush_delayed~0_13) (= v_~z$r_buff0_thd2~0_20 0) (= 0 v_~__unbuffered_cnt~0_21) (= 0 |v_ULTIMATE.start_main_~#t1570~0.offset_16|) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice2~0_32) (= v_~x~0_10 0) (= 0 v_~z$r_buff1_thd1~0_17) (= v_~z$r_buff0_thd1~0_24 0) (= v_~z$read_delayed_var~0.base_6 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1570~0.base_21| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1570~0.base_21|) |v_ULTIMATE.start_main_~#t1570~0.offset_16| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p2_EAX~0_16) (= 0 v_~z$w_buff1_used~0_72) (= 0 v_~weak$$choice0~0_7) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1570~0.base_21|) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd0~0_18 0) (= 0 |v_#NULL.base_7|) (= v_~z~0_27 0) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t1570~0.base_21| 1)) (= 0 v_~z$r_buff1_thd3~0_50) (= 0 v_~z$w_buff1~0_26) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1570~0.base_21| 4)) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #length=|v_#length_21|, ULTIMATE.start_main_~#t1571~0.base=|v_ULTIMATE.start_main_~#t1571~0.base_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ULTIMATE.start_main_~#t1572~0.base=|v_ULTIMATE.start_main_~#t1572~0.base_19|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_78, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ULTIMATE.start_main_~#t1570~0.offset=|v_ULTIMATE.start_main_~#t1570~0.offset_16|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_27, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ULTIMATE.start_main_~#t1572~0.offset=|v_ULTIMATE.start_main_~#t1572~0.offset_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t1570~0.base=|v_ULTIMATE.start_main_~#t1570~0.base_21|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24, ULTIMATE.start_main_~#t1571~0.offset=|v_ULTIMATE.start_main_~#t1571~0.offset_13|} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1571~0.base, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1572~0.base, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1570~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t1572~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t1570~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t1571~0.offset] because there is no mapped edge [2019-12-27 07:02:37,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1571~0.base_11|) 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1571~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1571~0.base_11|) |v_ULTIMATE.start_main_~#t1571~0.offset_9| 1)) |v_#memory_int_13|) (= |v_ULTIMATE.start_main_~#t1571~0.offset_9| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1571~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1571~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1571~0.base_11|)) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1571~0.base_11| 1) |v_#valid_38|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1571~0.base=|v_ULTIMATE.start_main_~#t1571~0.base_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1571~0.offset=|v_ULTIMATE.start_main_~#t1571~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t1571~0.base, #length, ULTIMATE.start_main_~#t1571~0.offset] because there is no mapped edge [2019-12-27 07:02:37,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_16 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8)) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd1~0_17 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd3~0_52 v_~z$r_buff1_thd3~0_33) (= v_~__unbuffered_p0_EAX~0_4 v_~x~0_4) (= v_~z$r_buff0_thd0~0_15 v_~z$r_buff1_thd0~0_10)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_17, ~x~0=v_~x~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_4, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_10, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_16, ~x~0=v_~x~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 07:02:37,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-2092395567 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-2092395567 256)))) (or (and (= ~z$w_buff1~0_In-2092395567 |P1Thread1of1ForFork2_#t~ite9_Out-2092395567|) (not .cse0) (not .cse1)) (and (= ~z~0_In-2092395567 |P1Thread1of1ForFork2_#t~ite9_Out-2092395567|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2092395567, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2092395567, ~z$w_buff1~0=~z$w_buff1~0_In-2092395567, ~z~0=~z~0_In-2092395567} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-2092395567|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2092395567, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2092395567, ~z$w_buff1~0=~z$w_buff1~0_In-2092395567, ~z~0=~z~0_In-2092395567} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 07:02:37,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 07:02:37,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L824-1-->L826: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1572~0.base_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1572~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1572~0.base_13|) |v_ULTIMATE.start_main_~#t1572~0.offset_11| 2)) |v_#memory_int_11|) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1572~0.base_13| 1) |v_#valid_36|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1572~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t1572~0.offset_11| 0) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1572~0.base_13|) 0) (not (= |v_ULTIMATE.start_main_~#t1572~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1572~0.offset=|v_ULTIMATE.start_main_~#t1572~0.offset_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1572~0.base=|v_ULTIMATE.start_main_~#t1572~0.base_13|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1572~0.offset, #length, ULTIMATE.start_main_~#t1572~0.base] because there is no mapped edge [2019-12-27 07:02:37,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1248591566 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In1248591566 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out1248591566| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1248591566| ~z$w_buff0_used~0_In1248591566)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1248591566, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1248591566} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1248591566, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1248591566|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1248591566} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 07:02:37,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In242572667 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In242572667 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In242572667 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In242572667 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out242572667| ~z$w_buff1_used~0_In242572667) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out242572667| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In242572667, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In242572667, ~z$w_buff1_used~0=~z$w_buff1_used~0_In242572667, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In242572667} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In242572667, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In242572667, ~z$w_buff1_used~0=~z$w_buff1_used~0_In242572667, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out242572667|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In242572667} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 07:02:37,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1123819815 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1123819815 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out-1123819815| ~z$r_buff0_thd2~0_In-1123819815) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out-1123819815| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1123819815, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1123819815} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1123819815, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1123819815|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1123819815} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 07:02:37,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L790-->L790-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In726228153 256) 0))) (or (and (= ~z$w_buff0_used~0_In726228153 |P2Thread1of1ForFork0_#t~ite27_Out726228153|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In726228153| |P2Thread1of1ForFork0_#t~ite26_Out726228153|)) (and (= ~z$w_buff0_used~0_In726228153 |P2Thread1of1ForFork0_#t~ite26_Out726228153|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In726228153 256)))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In726228153 256)) .cse1) (= (mod ~z$w_buff0_used~0_In726228153 256) 0) (and (= (mod ~z$w_buff1_used~0_In726228153 256) 0) .cse1))) (= |P2Thread1of1ForFork0_#t~ite27_Out726228153| |P2Thread1of1ForFork0_#t~ite26_Out726228153|) .cse0))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In726228153|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In726228153, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In726228153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In726228153, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In726228153, ~weak$$choice2~0=~weak$$choice2~0_In726228153} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out726228153|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out726228153|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In726228153, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In726228153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In726228153, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In726228153, ~weak$$choice2~0=~weak$$choice2~0_In726228153} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 07:02:37,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_63 v_~z$r_buff0_thd3~0_62) (not (= 0 (mod v_~weak$$choice2~0_24 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 07:02:37,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In85117382 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In85117382 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out85117382| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out85117382| ~z$w_buff0_used~0_In85117382)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In85117382, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In85117382} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out85117382|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In85117382, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In85117382} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 07:02:37,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_22 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 07:02:37,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse1 (= |P2Thread1of1ForFork0_#t~ite39_Out-435756992| |P2Thread1of1ForFork0_#t~ite38_Out-435756992|)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-435756992 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-435756992 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= |P2Thread1of1ForFork0_#t~ite38_Out-435756992| ~z$w_buff1~0_In-435756992)) (and (= ~z~0_In-435756992 |P2Thread1of1ForFork0_#t~ite38_Out-435756992|) .cse1 (or .cse0 .cse2)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-435756992, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-435756992, ~z$w_buff1~0=~z$w_buff1~0_In-435756992, ~z~0=~z~0_In-435756992} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-435756992|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-435756992|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-435756992, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-435756992, ~z$w_buff1~0=~z$w_buff1~0_In-435756992, ~z~0=~z~0_In-435756992} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 07:02:37,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In964545650 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In964545650 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out964545650|)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out964545650| ~z$w_buff0_used~0_In964545650)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In964545650, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In964545650} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In964545650, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out964545650|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In964545650} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 07:02:37,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In1909966549 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1909966549 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1909966549 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1909966549 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out1909966549| ~z$w_buff1_used~0_In1909966549)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork0_#t~ite41_Out1909966549| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1909966549, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1909966549, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1909966549, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1909966549} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1909966549, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1909966549, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1909966549, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1909966549, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1909966549|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 07:02:37,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1082373837 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1082373837 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1082373837| ~z$r_buff0_thd3~0_In-1082373837) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-1082373837|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1082373837, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1082373837} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1082373837, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1082373837, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1082373837|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 07:02:37,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd3~0_In388493556 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In388493556 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In388493556 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In388493556 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite43_Out388493556| ~z$r_buff1_thd3~0_In388493556)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork0_#t~ite43_Out388493556| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In388493556, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In388493556, ~z$w_buff1_used~0=~z$w_buff1_used~0_In388493556, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In388493556} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out388493556|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In388493556, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In388493556, ~z$w_buff1_used~0=~z$w_buff1_used~0_In388493556, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In388493556} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 07:02:37,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_44 |v_P2Thread1of1ForFork0_#t~ite43_8|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 07:02:37,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1985714758 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1985714758 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1985714758 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-1985714758 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite6_Out-1985714758| ~z$w_buff1_used~0_In-1985714758) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1985714758|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1985714758, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1985714758, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1985714758, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1985714758} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1985714758, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1985714758|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1985714758, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1985714758, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1985714758} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 07:02:37,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2057091833 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In2057091833 256)))) (or (and (= ~z$r_buff0_thd1~0_Out2057091833 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd1~0_Out2057091833 ~z$r_buff0_thd1~0_In2057091833) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2057091833, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2057091833} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2057091833, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out2057091833|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out2057091833} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 07:02:37,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd1~0_In-1954570622 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1954570622 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In-1954570622 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1954570622 256)))) (or (and (= ~z$r_buff1_thd1~0_In-1954570622 |P0Thread1of1ForFork1_#t~ite8_Out-1954570622|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-1954570622|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1954570622, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1954570622, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1954570622, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1954570622} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1954570622|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1954570622, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1954570622, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1954570622, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1954570622} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 07:02:37,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_12 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_12, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 07:02:37,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-2087209353 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-2087209353 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2087209353 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-2087209353 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In-2087209353 |P1Thread1of1ForFork2_#t~ite14_Out-2087209353|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-2087209353|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2087209353, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2087209353, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2087209353, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2087209353} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2087209353, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2087209353, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2087209353, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-2087209353|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2087209353} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 07:02:37,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L770-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_13) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 07:02:37,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 07:02:37,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In204291476 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In204291476 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out204291476| |ULTIMATE.start_main_#t~ite47_Out204291476|))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In204291476 |ULTIMATE.start_main_#t~ite47_Out204291476|)) (and (not .cse1) (= ~z$w_buff1~0_In204291476 |ULTIMATE.start_main_#t~ite47_Out204291476|) (not .cse0) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In204291476, ~z$w_buff1_used~0=~z$w_buff1_used~0_In204291476, ~z$w_buff1~0=~z$w_buff1~0_In204291476, ~z~0=~z~0_In204291476} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In204291476, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out204291476|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In204291476, ~z$w_buff1~0=~z$w_buff1~0_In204291476, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out204291476|, ~z~0=~z~0_In204291476} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 07:02:37,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-145277231 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-145277231 256) 0))) (or (and (= ~z$w_buff0_used~0_In-145277231 |ULTIMATE.start_main_#t~ite49_Out-145277231|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-145277231|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-145277231, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-145277231} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-145277231, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-145277231, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-145277231|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 07:02:37,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1963526454 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1963526454 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1963526454 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1963526454 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out1963526454| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1963526454 |ULTIMATE.start_main_#t~ite50_Out1963526454|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1963526454, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1963526454, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1963526454, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1963526454} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1963526454|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1963526454, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1963526454, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1963526454, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1963526454} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 07:02:37,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1627722419 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1627722419 256)))) (or (and (= ~z$r_buff0_thd0~0_In-1627722419 |ULTIMATE.start_main_#t~ite51_Out-1627722419|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-1627722419| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1627722419, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1627722419} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1627722419, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1627722419|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1627722419} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 07:02:37,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1605034639 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1605034639 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1605034639 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1605034639 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out1605034639| ~z$r_buff1_thd0~0_In1605034639) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite52_Out1605034639| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1605034639, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1605034639, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1605034639, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1605034639} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1605034639|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1605034639, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1605034639, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1605034639, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1605034639} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 07:02:37,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p2_EAX~0_10) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p0_EAX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite52_15| v_~z$r_buff1_thd0~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= 0 v_~__unbuffered_p1_EAX~0_8) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_10 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:02:37,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:02:37 BasicIcfg [2019-12-27 07:02:37,284 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:02:37,290 INFO L168 Benchmark]: Toolchain (without parser) took 118139.19 ms. Allocated memory was 136.8 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 99.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 07:02:37,290 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 07:02:37,291 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.11 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 99.4 MB in the beginning and 151.9 MB in the end (delta: -52.5 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-27 07:02:37,291 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.02 ms. Allocated memory is still 200.3 MB. Free memory was 151.9 MB in the beginning and 149.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:02:37,292 INFO L168 Benchmark]: Boogie Preprocessor took 43.03 ms. Allocated memory is still 200.3 MB. Free memory was 149.1 MB in the beginning and 146.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:02:37,292 INFO L168 Benchmark]: RCFGBuilder took 837.19 ms. Allocated memory is still 200.3 MB. Free memory was 146.4 MB in the beginning and 95.8 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-27 07:02:37,295 INFO L168 Benchmark]: TraceAbstraction took 116441.31 ms. Allocated memory was 200.3 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 95.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 07:02:37,303 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.18 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 747.11 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 99.4 MB in the beginning and 151.9 MB in the end (delta: -52.5 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.02 ms. Allocated memory is still 200.3 MB. Free memory was 151.9 MB in the beginning and 149.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.03 ms. Allocated memory is still 200.3 MB. Free memory was 149.1 MB in the beginning and 146.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 837.19 ms. Allocated memory is still 200.3 MB. Free memory was 146.4 MB in the beginning and 95.8 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 116441.31 ms. Allocated memory was 200.3 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 95.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 176 ProgramPointsBefore, 96 ProgramPointsAfterwards, 213 TransitionsBefore, 108 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 29 ChoiceCompositions, 6738 VarBasedMoverChecksPositive, 208 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 85326 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1570, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1571, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1572, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L835] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 116.1s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 36.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7234 SDtfs, 8774 SDslu, 27009 SDs, 0 SdLazy, 14831 SolverSat, 299 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 48 SyntacticMatches, 14 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161661occurred 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: 48.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 330466 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1624 NumberOfCodeBlocks, 1624 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1526 ConstructedInterpolants, 0 QuantifiedInterpolants, 331012 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...