/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:32:13,819 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:32:13,821 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:32:13,840 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:32:13,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:32:13,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:32:13,845 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:32:13,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:32:13,851 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:32:13,852 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:32:13,853 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:32:13,854 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:32:13,854 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:32:13,855 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:32:13,856 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:32:13,857 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:32:13,858 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:32:13,859 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:32:13,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:32:13,862 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:32:13,864 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:32:13,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:32:13,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:32:13,867 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:32:13,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:32:13,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:32:13,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:32:13,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:32:13,871 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:32:13,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:32:13,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:32:13,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:32:13,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:32:13,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:32:13,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:32:13,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:32:13,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:32:13,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:32:13,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:32:13,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:32:13,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:32:13,879 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:32:13,899 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:32:13,899 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:32:13,902 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:32:13,902 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:32:13,902 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:32:13,902 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:32:13,903 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:32:13,903 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:32:13,903 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:32:13,903 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:32:13,904 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:32:13,904 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:32:13,904 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:32:13,904 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:32:13,904 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:32:13,905 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:32:13,905 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:32:13,905 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:32:13,905 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:32:13,905 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:32:13,906 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:32:13,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:32:13,907 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:32:13,908 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:32:13,908 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:32:13,908 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:32:13,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:32:13,908 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:32:13,909 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:32:13,909 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:32:13,910 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:32:14,168 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:32:14,187 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:32:14,190 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:32:14,192 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:32:14,193 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:32:14,194 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_pso.oepc.i [2019-12-27 17:32:14,266 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/841b92b1e/81a4fb3487464afaa4b3d065f89650eb/FLAG2b918b771 [2019-12-27 17:32:14,825 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:32:14,828 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_pso.oepc.i [2019-12-27 17:32:14,852 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/841b92b1e/81a4fb3487464afaa4b3d065f89650eb/FLAG2b918b771 [2019-12-27 17:32:15,091 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/841b92b1e/81a4fb3487464afaa4b3d065f89650eb [2019-12-27 17:32:15,105 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:32:15,107 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:32:15,108 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:32:15,108 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:32:15,112 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:32:15,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:32:15" (1/1) ... [2019-12-27 17:32:15,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8a5782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:32:15, skipping insertion in model container [2019-12-27 17:32:15,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:32:15" (1/1) ... [2019-12-27 17:32:15,124 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:32:15,180 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:32:15,728 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:32:15,741 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:32:15,804 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:32:15,876 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:32:15,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:32:15 WrapperNode [2019-12-27 17:32:15,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:32:15,878 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:32:15,878 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:32:15,878 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:32:15,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:32:15" (1/1) ... [2019-12-27 17:32:15,909 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:32:15" (1/1) ... [2019-12-27 17:32:15,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:32:15,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:32:15,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:32:15,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:32:15,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:32:15" (1/1) ... [2019-12-27 17:32:15,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:32:15" (1/1) ... [2019-12-27 17:32:15,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:32:15" (1/1) ... [2019-12-27 17:32:15,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:32:15" (1/1) ... [2019-12-27 17:32:15,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:32:15" (1/1) ... [2019-12-27 17:32:15,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:32:15" (1/1) ... [2019-12-27 17:32:15,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:32:15" (1/1) ... [2019-12-27 17:32:15,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:32:15,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:32:15,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:32:15,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:32:15,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:32:15" (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 17:32:16,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:32:16,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:32:16,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:32:16,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:32:16,062 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:32:16,062 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:32:16,063 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:32:16,063 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:32:16,064 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 17:32:16,064 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 17:32:16,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:32:16,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:32:16,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:32:16,068 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 17:32:16,858 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:32:16,859 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:32:16,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:32:16 BoogieIcfgContainer [2019-12-27 17:32:16,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:32:16,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:32:16,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:32:16,865 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:32:16,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:32:15" (1/3) ... [2019-12-27 17:32:16,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb4ba87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:32:16, skipping insertion in model container [2019-12-27 17:32:16,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:32:15" (2/3) ... [2019-12-27 17:32:16,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb4ba87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:32:16, skipping insertion in model container [2019-12-27 17:32:16,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:32:16" (3/3) ... [2019-12-27 17:32:16,870 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_pso.oepc.i [2019-12-27 17:32:16,881 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:32:16,881 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:32:16,891 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:32:16,893 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:32:16,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,937 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,937 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,937 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,938 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,938 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,950 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,950 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,985 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,985 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:16,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,016 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,016 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,017 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,019 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,020 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,024 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,026 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:32:17,046 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 17:32:17,068 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:32:17,069 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:32:17,069 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:32:17,069 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:32:17,069 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:32:17,069 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:32:17,070 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:32:17,070 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:32:17,086 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 17:32:17,088 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 17:32:17,192 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 17:32:17,193 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:32:17,209 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 430 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 17:32:17,234 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 17:32:17,288 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 17:32:17,288 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:32:17,296 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 430 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 17:32:17,318 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 17:32:17,319 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:32:22,758 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 17:32:22,885 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 17:32:22,904 INFO L206 etLargeBlockEncoding]: Checked pairs total: 77200 [2019-12-27 17:32:22,904 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 17:32:22,907 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-27 17:32:35,959 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102314 states. [2019-12-27 17:32:35,961 INFO L276 IsEmpty]: Start isEmpty. Operand 102314 states. [2019-12-27 17:32:35,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 17:32:35,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:35,966 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 17:32:35,967 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 17:32:35,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:35,973 INFO L82 PathProgramCache]: Analyzing trace with hash 909908, now seen corresponding path program 1 times [2019-12-27 17:32:35,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:35,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607360222] [2019-12-27 17:32:35,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:36,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:32:36,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607360222] [2019-12-27 17:32:36,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:36,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:32:36,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [87040550] [2019-12-27 17:32:36,196 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:36,201 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:36,214 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 17:32:36,215 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:36,218 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:32:36,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:32:36,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:36,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:32:36,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:32:36,230 INFO L87 Difference]: Start difference. First operand 102314 states. Second operand 3 states. [2019-12-27 17:32:39,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:39,195 INFO L93 Difference]: Finished difference Result 101472 states and 432734 transitions. [2019-12-27 17:32:39,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:32:39,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 17:32:39,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:39,892 INFO L225 Difference]: With dead ends: 101472 [2019-12-27 17:32:39,893 INFO L226 Difference]: Without dead ends: 95232 [2019-12-27 17:32:39,894 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 17:32:45,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95232 states. [2019-12-27 17:32:47,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95232 to 95232. [2019-12-27 17:32:47,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95232 states. [2019-12-27 17:32:48,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95232 states to 95232 states and 405538 transitions. [2019-12-27 17:32:48,874 INFO L78 Accepts]: Start accepts. Automaton has 95232 states and 405538 transitions. Word has length 3 [2019-12-27 17:32:48,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:48,874 INFO L462 AbstractCegarLoop]: Abstraction has 95232 states and 405538 transitions. [2019-12-27 17:32:48,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:32:48,874 INFO L276 IsEmpty]: Start isEmpty. Operand 95232 states and 405538 transitions. [2019-12-27 17:32:48,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:32:48,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:48,880 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:32:48,880 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 17:32:48,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:48,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1729820714, now seen corresponding path program 1 times [2019-12-27 17:32:48,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:48,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519301505] [2019-12-27 17:32:48,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:49,026 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 17:32:49,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519301505] [2019-12-27 17:32:49,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:49,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:32:49,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [525586130] [2019-12-27 17:32:49,027 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:49,028 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:49,032 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:32:49,032 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:49,032 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:32:49,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:32:49,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:49,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:32:49,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:32:49,035 INFO L87 Difference]: Start difference. First operand 95232 states and 405538 transitions. Second operand 4 states. [2019-12-27 17:32:54,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:54,513 INFO L93 Difference]: Finished difference Result 151692 states and 619304 transitions. [2019-12-27 17:32:54,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:32:54,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:32:54,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:55,127 INFO L225 Difference]: With dead ends: 151692 [2019-12-27 17:32:55,127 INFO L226 Difference]: Without dead ends: 151643 [2019-12-27 17:32:55,128 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 17:32:58,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151643 states. [2019-12-27 17:33:01,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151643 to 138429. [2019-12-27 17:33:01,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138429 states. [2019-12-27 17:33:02,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138429 states to 138429 states and 572602 transitions. [2019-12-27 17:33:02,305 INFO L78 Accepts]: Start accepts. Automaton has 138429 states and 572602 transitions. Word has length 11 [2019-12-27 17:33:02,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:02,305 INFO L462 AbstractCegarLoop]: Abstraction has 138429 states and 572602 transitions. [2019-12-27 17:33:02,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:33:02,305 INFO L276 IsEmpty]: Start isEmpty. Operand 138429 states and 572602 transitions. [2019-12-27 17:33:02,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 17:33:02,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:02,311 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:33:02,311 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 17:33:02,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:02,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1791451612, now seen corresponding path program 1 times [2019-12-27 17:33:02,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:02,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060318711] [2019-12-27 17:33:02,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:02,361 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 17:33:02,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060318711] [2019-12-27 17:33:02,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:02,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:33:02,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [771504232] [2019-12-27 17:33:02,363 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:02,364 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:02,366 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 17:33:02,366 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:02,366 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:33:02,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:33:02,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:02,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:33:02,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:33:02,367 INFO L87 Difference]: Start difference. First operand 138429 states and 572602 transitions. Second operand 3 states. [2019-12-27 17:33:02,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:02,540 INFO L93 Difference]: Finished difference Result 30955 states and 100617 transitions. [2019-12-27 17:33:02,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:33:02,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 17:33:02,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:02,601 INFO L225 Difference]: With dead ends: 30955 [2019-12-27 17:33:02,601 INFO L226 Difference]: Without dead ends: 30955 [2019-12-27 17:33:02,601 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 17:33:07,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30955 states. [2019-12-27 17:33:07,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30955 to 30955. [2019-12-27 17:33:07,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30955 states. [2019-12-27 17:33:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30955 states to 30955 states and 100617 transitions. [2019-12-27 17:33:07,428 INFO L78 Accepts]: Start accepts. Automaton has 30955 states and 100617 transitions. Word has length 13 [2019-12-27 17:33:07,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:07,429 INFO L462 AbstractCegarLoop]: Abstraction has 30955 states and 100617 transitions. [2019-12-27 17:33:07,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:33:07,429 INFO L276 IsEmpty]: Start isEmpty. Operand 30955 states and 100617 transitions. [2019-12-27 17:33:07,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:33:07,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:07,431 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:33:07,431 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 17:33:07,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:07,432 INFO L82 PathProgramCache]: Analyzing trace with hash -137996123, now seen corresponding path program 1 times [2019-12-27 17:33:07,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:07,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480727778] [2019-12-27 17:33:07,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:07,492 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 17:33:07,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480727778] [2019-12-27 17:33:07,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:07,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:33:07,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [383084706] [2019-12-27 17:33:07,493 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:07,496 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:07,498 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 17:33:07,498 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:07,499 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:33:07,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:33:07,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:07,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:33:07,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:33:07,500 INFO L87 Difference]: Start difference. First operand 30955 states and 100617 transitions. Second operand 3 states. [2019-12-27 17:33:07,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:07,702 INFO L93 Difference]: Finished difference Result 47061 states and 152507 transitions. [2019-12-27 17:33:07,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:33:07,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 17:33:07,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:07,806 INFO L225 Difference]: With dead ends: 47061 [2019-12-27 17:33:07,806 INFO L226 Difference]: Without dead ends: 47061 [2019-12-27 17:33:07,807 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 17:33:08,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47061 states. [2019-12-27 17:33:08,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47061 to 33925. [2019-12-27 17:33:08,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33925 states. [2019-12-27 17:33:08,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33925 states to 33925 states and 111057 transitions. [2019-12-27 17:33:08,611 INFO L78 Accepts]: Start accepts. Automaton has 33925 states and 111057 transitions. Word has length 16 [2019-12-27 17:33:08,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:08,612 INFO L462 AbstractCegarLoop]: Abstraction has 33925 states and 111057 transitions. [2019-12-27 17:33:08,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:33:08,612 INFO L276 IsEmpty]: Start isEmpty. Operand 33925 states and 111057 transitions. [2019-12-27 17:33:08,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:33:08,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:08,615 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:33:08,616 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 17:33:08,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:08,616 INFO L82 PathProgramCache]: Analyzing trace with hash -137876649, now seen corresponding path program 1 times [2019-12-27 17:33:08,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:08,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760285745] [2019-12-27 17:33:08,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:08,690 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 17:33:08,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760285745] [2019-12-27 17:33:08,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:08,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:33:08,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1184799829] [2019-12-27 17:33:08,691 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:08,693 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:08,696 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 17:33:08,696 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:08,696 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:33:08,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:33:08,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:08,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:33:08,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:33:08,697 INFO L87 Difference]: Start difference. First operand 33925 states and 111057 transitions. Second operand 4 states. [2019-12-27 17:33:09,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:09,397 INFO L93 Difference]: Finished difference Result 41000 states and 132194 transitions. [2019-12-27 17:33:09,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:33:09,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 17:33:09,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:09,464 INFO L225 Difference]: With dead ends: 41000 [2019-12-27 17:33:09,464 INFO L226 Difference]: Without dead ends: 41000 [2019-12-27 17:33:09,465 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 17:33:09,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41000 states. [2019-12-27 17:33:10,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41000 to 37405. [2019-12-27 17:33:10,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37405 states. [2019-12-27 17:33:10,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37405 states to 37405 states and 121522 transitions. [2019-12-27 17:33:10,399 INFO L78 Accepts]: Start accepts. Automaton has 37405 states and 121522 transitions. Word has length 16 [2019-12-27 17:33:10,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:10,399 INFO L462 AbstractCegarLoop]: Abstraction has 37405 states and 121522 transitions. [2019-12-27 17:33:10,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:33:10,400 INFO L276 IsEmpty]: Start isEmpty. Operand 37405 states and 121522 transitions. [2019-12-27 17:33:10,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:33:10,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:10,402 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:33:10,402 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 17:33:10,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:10,402 INFO L82 PathProgramCache]: Analyzing trace with hash -219444717, now seen corresponding path program 1 times [2019-12-27 17:33:10,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:10,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262967585] [2019-12-27 17:33:10,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:10,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:33:10,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262967585] [2019-12-27 17:33:10,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:10,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:33:10,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [801068373] [2019-12-27 17:33:10,519 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:10,521 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:10,524 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 17:33:10,525 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:10,525 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:33:10,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:33:10,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:10,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:33:10,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:33:10,526 INFO L87 Difference]: Start difference. First operand 37405 states and 121522 transitions. Second operand 4 states. [2019-12-27 17:33:10,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:10,864 INFO L93 Difference]: Finished difference Result 45062 states and 145323 transitions. [2019-12-27 17:33:10,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:33:10,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 17:33:10,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:10,932 INFO L225 Difference]: With dead ends: 45062 [2019-12-27 17:33:10,932 INFO L226 Difference]: Without dead ends: 45062 [2019-12-27 17:33:10,933 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 17:33:11,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45062 states. [2019-12-27 17:33:11,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45062 to 38365. [2019-12-27 17:33:11,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38365 states. [2019-12-27 17:33:12,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38365 states to 38365 states and 124903 transitions. [2019-12-27 17:33:12,162 INFO L78 Accepts]: Start accepts. Automaton has 38365 states and 124903 transitions. Word has length 16 [2019-12-27 17:33:12,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:12,162 INFO L462 AbstractCegarLoop]: Abstraction has 38365 states and 124903 transitions. [2019-12-27 17:33:12,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:33:12,162 INFO L276 IsEmpty]: Start isEmpty. Operand 38365 states and 124903 transitions. [2019-12-27 17:33:12,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 17:33:12,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:12,173 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 17:33:12,174 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 17:33:12,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:12,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1066994180, now seen corresponding path program 1 times [2019-12-27 17:33:12,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:12,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456742253] [2019-12-27 17:33:12,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:12,307 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 17:33:12,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456742253] [2019-12-27 17:33:12,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:12,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:33:12,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1927877009] [2019-12-27 17:33:12,308 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:12,312 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:12,321 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 58 transitions. [2019-12-27 17:33:12,321 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:12,322 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:33:12,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:33:12,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:12,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:33:12,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:33:12,324 INFO L87 Difference]: Start difference. First operand 38365 states and 124903 transitions. Second operand 5 states. [2019-12-27 17:33:12,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:12,977 INFO L93 Difference]: Finished difference Result 53898 states and 171065 transitions. [2019-12-27 17:33:12,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 17:33:12,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 17:33:12,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:13,069 INFO L225 Difference]: With dead ends: 53898 [2019-12-27 17:33:13,069 INFO L226 Difference]: Without dead ends: 53891 [2019-12-27 17:33:13,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:33:13,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53891 states. [2019-12-27 17:33:13,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53891 to 39721. [2019-12-27 17:33:13,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39721 states. [2019-12-27 17:33:13,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39721 states to 39721 states and 129036 transitions. [2019-12-27 17:33:13,846 INFO L78 Accepts]: Start accepts. Automaton has 39721 states and 129036 transitions. Word has length 22 [2019-12-27 17:33:13,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:13,847 INFO L462 AbstractCegarLoop]: Abstraction has 39721 states and 129036 transitions. [2019-12-27 17:33:13,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:33:13,847 INFO L276 IsEmpty]: Start isEmpty. Operand 39721 states and 129036 transitions. [2019-12-27 17:33:13,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 17:33:13,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:13,855 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 17:33:13,855 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 17:33:13,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:13,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1734556852, now seen corresponding path program 1 times [2019-12-27 17:33:13,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:13,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682224849] [2019-12-27 17:33:13,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:13,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:33:13,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682224849] [2019-12-27 17:33:13,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:13,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:33:13,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1689543248] [2019-12-27 17:33:13,921 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:13,924 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:13,930 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 44 transitions. [2019-12-27 17:33:13,930 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:13,933 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:33:13,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:33:13,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:13,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:33:13,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:33:13,934 INFO L87 Difference]: Start difference. First operand 39721 states and 129036 transitions. Second operand 5 states. [2019-12-27 17:33:14,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:14,555 INFO L93 Difference]: Finished difference Result 56181 states and 177938 transitions. [2019-12-27 17:33:14,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 17:33:14,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 17:33:14,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:14,656 INFO L225 Difference]: With dead ends: 56181 [2019-12-27 17:33:14,657 INFO L226 Difference]: Without dead ends: 56174 [2019-12-27 17:33:14,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:33:14,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56174 states. [2019-12-27 17:33:15,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56174 to 38054. [2019-12-27 17:33:15,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38054 states. [2019-12-27 17:33:15,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38054 states to 38054 states and 123745 transitions. [2019-12-27 17:33:15,835 INFO L78 Accepts]: Start accepts. Automaton has 38054 states and 123745 transitions. Word has length 22 [2019-12-27 17:33:15,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:15,836 INFO L462 AbstractCegarLoop]: Abstraction has 38054 states and 123745 transitions. [2019-12-27 17:33:15,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:33:15,836 INFO L276 IsEmpty]: Start isEmpty. Operand 38054 states and 123745 transitions. [2019-12-27 17:33:15,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 17:33:15,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:15,848 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 17:33:15,848 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 17:33:15,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:15,848 INFO L82 PathProgramCache]: Analyzing trace with hash -779030427, now seen corresponding path program 1 times [2019-12-27 17:33:15,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:15,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509020138] [2019-12-27 17:33:15,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:15,894 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 17:33:15,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509020138] [2019-12-27 17:33:15,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:15,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:33:15,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1062623186] [2019-12-27 17:33:15,896 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:15,899 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:15,908 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 17:33:15,908 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:15,947 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:33:15,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:33:15,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:15,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:33:15,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:33:15,949 INFO L87 Difference]: Start difference. First operand 38054 states and 123745 transitions. Second operand 5 states. [2019-12-27 17:33:16,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:16,039 INFO L93 Difference]: Finished difference Result 15260 states and 46817 transitions. [2019-12-27 17:33:16,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:33:16,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 17:33:16,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:16,067 INFO L225 Difference]: With dead ends: 15260 [2019-12-27 17:33:16,068 INFO L226 Difference]: Without dead ends: 15260 [2019-12-27 17:33:16,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:33:16,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15260 states. [2019-12-27 17:33:16,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15260 to 14988. [2019-12-27 17:33:16,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14988 states. [2019-12-27 17:33:16,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14988 states to 14988 states and 46041 transitions. [2019-12-27 17:33:16,293 INFO L78 Accepts]: Start accepts. Automaton has 14988 states and 46041 transitions. Word has length 25 [2019-12-27 17:33:16,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:16,293 INFO L462 AbstractCegarLoop]: Abstraction has 14988 states and 46041 transitions. [2019-12-27 17:33:16,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:33:16,294 INFO L276 IsEmpty]: Start isEmpty. Operand 14988 states and 46041 transitions. [2019-12-27 17:33:16,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:33:16,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:16,305 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 17:33:16,305 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 17:33:16,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:16,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1740727520, now seen corresponding path program 1 times [2019-12-27 17:33:16,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:16,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923295585] [2019-12-27 17:33:16,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:16,362 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 17:33:16,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923295585] [2019-12-27 17:33:16,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:16,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:33:16,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [129449108] [2019-12-27 17:33:16,363 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:16,367 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:16,372 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 17:33:16,373 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:16,373 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:33:16,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:33:16,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:16,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:33:16,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:33:16,374 INFO L87 Difference]: Start difference. First operand 14988 states and 46041 transitions. Second operand 5 states. [2019-12-27 17:33:16,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:16,773 INFO L93 Difference]: Finished difference Result 19496 states and 58771 transitions. [2019-12-27 17:33:16,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:33:16,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 17:33:16,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:16,819 INFO L225 Difference]: With dead ends: 19496 [2019-12-27 17:33:16,819 INFO L226 Difference]: Without dead ends: 19496 [2019-12-27 17:33:16,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:33:16,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19496 states. [2019-12-27 17:33:17,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19496 to 18230. [2019-12-27 17:33:17,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18230 states. [2019-12-27 17:33:17,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18230 states to 18230 states and 55601 transitions. [2019-12-27 17:33:17,151 INFO L78 Accepts]: Start accepts. Automaton has 18230 states and 55601 transitions. Word has length 27 [2019-12-27 17:33:17,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:17,152 INFO L462 AbstractCegarLoop]: Abstraction has 18230 states and 55601 transitions. [2019-12-27 17:33:17,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:33:17,152 INFO L276 IsEmpty]: Start isEmpty. Operand 18230 states and 55601 transitions. [2019-12-27 17:33:17,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 17:33:17,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:17,164 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:33:17,164 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 17:33:17,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:17,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1978987791, now seen corresponding path program 1 times [2019-12-27 17:33:17,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:17,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408992564] [2019-12-27 17:33:17,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:17,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 17:33:17,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408992564] [2019-12-27 17:33:17,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:17,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:33:17,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1925509011] [2019-12-27 17:33:17,221 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:17,226 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:17,233 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 17:33:17,233 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:17,233 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:33:17,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:33:17,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:17,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:33:17,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:33:17,234 INFO L87 Difference]: Start difference. First operand 18230 states and 55601 transitions. Second operand 5 states. [2019-12-27 17:33:17,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:17,586 INFO L93 Difference]: Finished difference Result 21384 states and 64177 transitions. [2019-12-27 17:33:17,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:33:17,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 17:33:17,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:17,614 INFO L225 Difference]: With dead ends: 21384 [2019-12-27 17:33:17,614 INFO L226 Difference]: Without dead ends: 21384 [2019-12-27 17:33:17,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:33:17,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21384 states. [2019-12-27 17:33:17,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21384 to 17323. [2019-12-27 17:33:17,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17323 states. [2019-12-27 17:33:17,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17323 states to 17323 states and 52883 transitions. [2019-12-27 17:33:17,875 INFO L78 Accepts]: Start accepts. Automaton has 17323 states and 52883 transitions. Word has length 28 [2019-12-27 17:33:17,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:17,875 INFO L462 AbstractCegarLoop]: Abstraction has 17323 states and 52883 transitions. [2019-12-27 17:33:17,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:33:17,875 INFO L276 IsEmpty]: Start isEmpty. Operand 17323 states and 52883 transitions. [2019-12-27 17:33:17,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 17:33:17,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:17,893 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 17:33:17,893 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 17:33:17,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:17,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1850577991, now seen corresponding path program 1 times [2019-12-27 17:33:17,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:17,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526232699] [2019-12-27 17:33:17,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:18,039 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 17:33:18,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526232699] [2019-12-27 17:33:18,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:18,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:33:18,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1100756873] [2019-12-27 17:33:18,041 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:18,046 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:18,143 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 79 transitions. [2019-12-27 17:33:18,144 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:18,145 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:33:18,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:33:18,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:18,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:33:18,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:33:18,146 INFO L87 Difference]: Start difference. First operand 17323 states and 52883 transitions. Second operand 7 states. [2019-12-27 17:33:19,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:19,039 INFO L93 Difference]: Finished difference Result 25126 states and 74494 transitions. [2019-12-27 17:33:19,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 17:33:19,039 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 17:33:19,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:19,076 INFO L225 Difference]: With dead ends: 25126 [2019-12-27 17:33:19,076 INFO L226 Difference]: Without dead ends: 25126 [2019-12-27 17:33:19,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-12-27 17:33:19,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25126 states. [2019-12-27 17:33:19,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25126 to 18107. [2019-12-27 17:33:19,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18107 states. [2019-12-27 17:33:19,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18107 states to 18107 states and 55159 transitions. [2019-12-27 17:33:19,382 INFO L78 Accepts]: Start accepts. Automaton has 18107 states and 55159 transitions. Word has length 33 [2019-12-27 17:33:19,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:19,382 INFO L462 AbstractCegarLoop]: Abstraction has 18107 states and 55159 transitions. [2019-12-27 17:33:19,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:33:19,382 INFO L276 IsEmpty]: Start isEmpty. Operand 18107 states and 55159 transitions. [2019-12-27 17:33:19,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 17:33:19,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:19,400 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 17:33:19,400 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 17:33:19,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:19,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1137221687, now seen corresponding path program 2 times [2019-12-27 17:33:19,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:19,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809784928] [2019-12-27 17:33:19,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:19,480 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 17:33:19,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809784928] [2019-12-27 17:33:19,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:19,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:33:19,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1598801045] [2019-12-27 17:33:19,482 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:19,489 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:19,504 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 52 states and 69 transitions. [2019-12-27 17:33:19,504 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:19,507 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:33:19,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:33:19,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:19,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:33:19,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:33:19,508 INFO L87 Difference]: Start difference. First operand 18107 states and 55159 transitions. Second operand 6 states. [2019-12-27 17:33:20,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:20,174 INFO L93 Difference]: Finished difference Result 22885 states and 68158 transitions. [2019-12-27 17:33:20,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 17:33:20,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 17:33:20,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:20,218 INFO L225 Difference]: With dead ends: 22885 [2019-12-27 17:33:20,218 INFO L226 Difference]: Without dead ends: 22885 [2019-12-27 17:33:20,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:33:20,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22885 states. [2019-12-27 17:33:20,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22885 to 18692. [2019-12-27 17:33:20,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18692 states. [2019-12-27 17:33:20,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18692 states to 18692 states and 56821 transitions. [2019-12-27 17:33:20,547 INFO L78 Accepts]: Start accepts. Automaton has 18692 states and 56821 transitions. Word has length 33 [2019-12-27 17:33:20,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:20,547 INFO L462 AbstractCegarLoop]: Abstraction has 18692 states and 56821 transitions. [2019-12-27 17:33:20,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:33:20,548 INFO L276 IsEmpty]: Start isEmpty. Operand 18692 states and 56821 transitions. [2019-12-27 17:33:20,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 17:33:20,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:20,570 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:33:20,570 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 17:33:20,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:20,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1933444630, now seen corresponding path program 1 times [2019-12-27 17:33:20,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:20,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492839483] [2019-12-27 17:33:20,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:20,632 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 17:33:20,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492839483] [2019-12-27 17:33:20,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:20,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:33:20,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1992943495] [2019-12-27 17:33:20,633 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:20,640 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:20,658 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 70 transitions. [2019-12-27 17:33:20,658 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:20,659 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:33:20,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:33:20,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:20,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:33:20,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:33:20,660 INFO L87 Difference]: Start difference. First operand 18692 states and 56821 transitions. Second operand 6 states. [2019-12-27 17:33:21,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:21,303 INFO L93 Difference]: Finished difference Result 23844 states and 71231 transitions. [2019-12-27 17:33:21,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 17:33:21,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 17:33:21,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:21,340 INFO L225 Difference]: With dead ends: 23844 [2019-12-27 17:33:21,340 INFO L226 Difference]: Without dead ends: 23844 [2019-12-27 17:33:21,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:33:21,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23844 states. [2019-12-27 17:33:21,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23844 to 15691. [2019-12-27 17:33:21,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15691 states. [2019-12-27 17:33:21,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15691 states to 15691 states and 48077 transitions. [2019-12-27 17:33:21,622 INFO L78 Accepts]: Start accepts. Automaton has 15691 states and 48077 transitions. Word has length 34 [2019-12-27 17:33:21,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:21,623 INFO L462 AbstractCegarLoop]: Abstraction has 15691 states and 48077 transitions. [2019-12-27 17:33:21,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:33:21,623 INFO L276 IsEmpty]: Start isEmpty. Operand 15691 states and 48077 transitions. [2019-12-27 17:33:21,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 17:33:21,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:21,639 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 17:33:21,639 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 17:33:21,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:21,639 INFO L82 PathProgramCache]: Analyzing trace with hash -390301387, now seen corresponding path program 1 times [2019-12-27 17:33:21,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:21,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467337631] [2019-12-27 17:33:21,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:21,690 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 17:33:21,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467337631] [2019-12-27 17:33:21,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:21,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:33:21,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1162284880] [2019-12-27 17:33:21,691 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:21,698 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:21,755 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 168 states and 336 transitions. [2019-12-27 17:33:21,755 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:21,818 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 17:33:21,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:33:21,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:21,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:33:21,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:33:21,819 INFO L87 Difference]: Start difference. First operand 15691 states and 48077 transitions. Second operand 6 states. [2019-12-27 17:33:22,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:22,331 INFO L93 Difference]: Finished difference Result 37742 states and 115193 transitions. [2019-12-27 17:33:22,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:33:22,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-27 17:33:22,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:22,368 INFO L225 Difference]: With dead ends: 37742 [2019-12-27 17:33:22,368 INFO L226 Difference]: Without dead ends: 24278 [2019-12-27 17:33:22,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:33:22,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24278 states. [2019-12-27 17:33:22,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24278 to 16073. [2019-12-27 17:33:22,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16073 states. [2019-12-27 17:33:22,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16073 states to 16073 states and 48010 transitions. [2019-12-27 17:33:22,682 INFO L78 Accepts]: Start accepts. Automaton has 16073 states and 48010 transitions. Word has length 39 [2019-12-27 17:33:22,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:22,682 INFO L462 AbstractCegarLoop]: Abstraction has 16073 states and 48010 transitions. [2019-12-27 17:33:22,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:33:22,682 INFO L276 IsEmpty]: Start isEmpty. Operand 16073 states and 48010 transitions. [2019-12-27 17:33:22,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 17:33:22,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:22,699 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:33:22,700 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 17:33:22,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:22,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1543157030, now seen corresponding path program 1 times [2019-12-27 17:33:22,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:22,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154017611] [2019-12-27 17:33:22,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:22,770 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 17:33:22,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154017611] [2019-12-27 17:33:22,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:22,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:33:22,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [397959422] [2019-12-27 17:33:22,772 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:22,780 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:22,839 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 265 transitions. [2019-12-27 17:33:22,840 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:22,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:33:23,123 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 17:33:23,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 17:33:23,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:23,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 17:33:23,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:33:23,125 INFO L87 Difference]: Start difference. First operand 16073 states and 48010 transitions. Second operand 12 states. [2019-12-27 17:33:24,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:24,055 INFO L93 Difference]: Finished difference Result 23632 states and 69938 transitions. [2019-12-27 17:33:24,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:33:24,056 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2019-12-27 17:33:24,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:24,088 INFO L225 Difference]: With dead ends: 23632 [2019-12-27 17:33:24,088 INFO L226 Difference]: Without dead ends: 23632 [2019-12-27 17:33:24,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:33:24,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23632 states. [2019-12-27 17:33:24,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23632 to 21777. [2019-12-27 17:33:24,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21777 states. [2019-12-27 17:33:24,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21777 states to 21777 states and 64983 transitions. [2019-12-27 17:33:24,415 INFO L78 Accepts]: Start accepts. Automaton has 21777 states and 64983 transitions. Word has length 40 [2019-12-27 17:33:24,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:24,415 INFO L462 AbstractCegarLoop]: Abstraction has 21777 states and 64983 transitions. [2019-12-27 17:33:24,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 17:33:24,415 INFO L276 IsEmpty]: Start isEmpty. Operand 21777 states and 64983 transitions. [2019-12-27 17:33:24,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 17:33:24,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:24,445 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:33:24,445 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 17:33:24,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:24,445 INFO L82 PathProgramCache]: Analyzing trace with hash 838743556, now seen corresponding path program 2 times [2019-12-27 17:33:24,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:24,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799860554] [2019-12-27 17:33:24,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:24,502 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 17:33:24,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799860554] [2019-12-27 17:33:24,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:24,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:33:24,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1431279503] [2019-12-27 17:33:24,503 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:24,511 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:24,594 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 201 states and 393 transitions. [2019-12-27 17:33:24,595 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:24,628 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 17:33:24,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:33:24,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:24,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:33:24,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:33:24,630 INFO L87 Difference]: Start difference. First operand 21777 states and 64983 transitions. Second operand 7 states. [2019-12-27 17:33:24,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:24,751 INFO L93 Difference]: Finished difference Result 20526 states and 62067 transitions. [2019-12-27 17:33:24,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:33:24,752 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 17:33:24,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:24,790 INFO L225 Difference]: With dead ends: 20526 [2019-12-27 17:33:24,790 INFO L226 Difference]: Without dead ends: 18967 [2019-12-27 17:33:24,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:33:24,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18967 states. [2019-12-27 17:33:25,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18967 to 18092. [2019-12-27 17:33:25,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18092 states. [2019-12-27 17:33:25,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18092 states to 18092 states and 56295 transitions. [2019-12-27 17:33:25,084 INFO L78 Accepts]: Start accepts. Automaton has 18092 states and 56295 transitions. Word has length 40 [2019-12-27 17:33:25,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:25,085 INFO L462 AbstractCegarLoop]: Abstraction has 18092 states and 56295 transitions. [2019-12-27 17:33:25,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:33:25,085 INFO L276 IsEmpty]: Start isEmpty. Operand 18092 states and 56295 transitions. [2019-12-27 17:33:25,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:33:25,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:25,111 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 17:33:25,111 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 17:33:25,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:25,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1449191354, now seen corresponding path program 1 times [2019-12-27 17:33:25,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:25,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646416714] [2019-12-27 17:33:25,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:25,158 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 17:33:25,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646416714] [2019-12-27 17:33:25,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:25,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:33:25,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1061335348] [2019-12-27 17:33:25,160 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:25,180 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:25,539 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 321 transitions. [2019-12-27 17:33:25,539 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:25,547 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:33:25,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:33:25,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:25,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:33:25,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:33:25,548 INFO L87 Difference]: Start difference. First operand 18092 states and 56295 transitions. Second operand 3 states. [2019-12-27 17:33:25,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:25,718 INFO L93 Difference]: Finished difference Result 24294 states and 73055 transitions. [2019-12-27 17:33:25,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:33:25,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 17:33:25,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:25,764 INFO L225 Difference]: With dead ends: 24294 [2019-12-27 17:33:25,764 INFO L226 Difference]: Without dead ends: 24294 [2019-12-27 17:33:25,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 17:33:25,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24294 states. [2019-12-27 17:33:26,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24294 to 18274. [2019-12-27 17:33:26,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18274 states. [2019-12-27 17:33:26,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18274 states to 18274 states and 55190 transitions. [2019-12-27 17:33:26,148 INFO L78 Accepts]: Start accepts. Automaton has 18274 states and 55190 transitions. Word has length 64 [2019-12-27 17:33:26,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:26,148 INFO L462 AbstractCegarLoop]: Abstraction has 18274 states and 55190 transitions. [2019-12-27 17:33:26,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:33:26,148 INFO L276 IsEmpty]: Start isEmpty. Operand 18274 states and 55190 transitions. [2019-12-27 17:33:26,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:33:26,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:26,168 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 17:33:26,168 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 17:33:26,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:26,168 INFO L82 PathProgramCache]: Analyzing trace with hash -237391966, now seen corresponding path program 1 times [2019-12-27 17:33:26,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:26,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336714601] [2019-12-27 17:33:26,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:26,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 17:33:26,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336714601] [2019-12-27 17:33:26,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:26,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:33:26,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [540563294] [2019-12-27 17:33:26,268 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:26,288 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:26,460 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 321 transitions. [2019-12-27 17:33:26,461 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:26,527 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 17:33:26,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:33:26,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:26,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:33:26,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:33:26,528 INFO L87 Difference]: Start difference. First operand 18274 states and 55190 transitions. Second operand 10 states. [2019-12-27 17:33:27,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:27,992 INFO L93 Difference]: Finished difference Result 80145 states and 240194 transitions. [2019-12-27 17:33:27,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 17:33:27,992 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 17:33:27,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:28,076 INFO L225 Difference]: With dead ends: 80145 [2019-12-27 17:33:28,077 INFO L226 Difference]: Without dead ends: 58918 [2019-12-27 17:33:28,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2019-12-27 17:33:28,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58918 states. [2019-12-27 17:33:28,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58918 to 21155. [2019-12-27 17:33:28,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21155 states. [2019-12-27 17:33:28,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21155 states to 21155 states and 64148 transitions. [2019-12-27 17:33:28,690 INFO L78 Accepts]: Start accepts. Automaton has 21155 states and 64148 transitions. Word has length 64 [2019-12-27 17:33:28,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:28,691 INFO L462 AbstractCegarLoop]: Abstraction has 21155 states and 64148 transitions. [2019-12-27 17:33:28,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:33:28,691 INFO L276 IsEmpty]: Start isEmpty. Operand 21155 states and 64148 transitions. [2019-12-27 17:33:28,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:33:28,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:28,717 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 17:33:28,717 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 17:33:28,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:28,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1797634292, now seen corresponding path program 2 times [2019-12-27 17:33:28,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:28,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575650085] [2019-12-27 17:33:28,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:28,794 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 17:33:28,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575650085] [2019-12-27 17:33:28,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:28,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:33:28,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [676139730] [2019-12-27 17:33:28,795 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:28,815 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:29,149 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 220 states and 379 transitions. [2019-12-27 17:33:29,149 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:29,330 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 17:33:29,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 17:33:29,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:29,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 17:33:29,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:33:29,331 INFO L87 Difference]: Start difference. First operand 21155 states and 64148 transitions. Second operand 14 states. [2019-12-27 17:33:31,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:31,983 INFO L93 Difference]: Finished difference Result 70996 states and 212127 transitions. [2019-12-27 17:33:31,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 17:33:31,984 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 64 [2019-12-27 17:33:31,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:32,056 INFO L225 Difference]: With dead ends: 70996 [2019-12-27 17:33:32,056 INFO L226 Difference]: Without dead ends: 52036 [2019-12-27 17:33:32,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2019-12-27 17:33:32,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52036 states. [2019-12-27 17:33:32,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52036 to 24456. [2019-12-27 17:33:32,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24456 states. [2019-12-27 17:33:32,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24456 states to 24456 states and 73578 transitions. [2019-12-27 17:33:32,635 INFO L78 Accepts]: Start accepts. Automaton has 24456 states and 73578 transitions. Word has length 64 [2019-12-27 17:33:32,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:32,635 INFO L462 AbstractCegarLoop]: Abstraction has 24456 states and 73578 transitions. [2019-12-27 17:33:32,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 17:33:32,635 INFO L276 IsEmpty]: Start isEmpty. Operand 24456 states and 73578 transitions. [2019-12-27 17:33:32,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:33:32,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:32,661 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 17:33:32,662 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 17:33:32,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:32,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1864819808, now seen corresponding path program 3 times [2019-12-27 17:33:32,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:32,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077962440] [2019-12-27 17:33:32,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:32,772 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 17:33:32,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077962440] [2019-12-27 17:33:32,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:32,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:33:32,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1889749082] [2019-12-27 17:33:32,773 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:32,793 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:32,937 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 326 transitions. [2019-12-27 17:33:32,938 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:33,126 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 27 times. [2019-12-27 17:33:33,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 17:33:33,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:33,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 17:33:33,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:33:33,128 INFO L87 Difference]: Start difference. First operand 24456 states and 73578 transitions. Second operand 13 states. [2019-12-27 17:33:36,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:36,606 INFO L93 Difference]: Finished difference Result 111150 states and 330370 transitions. [2019-12-27 17:33:36,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 17:33:36,606 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-12-27 17:33:36,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:36,760 INFO L225 Difference]: With dead ends: 111150 [2019-12-27 17:33:36,760 INFO L226 Difference]: Without dead ends: 107413 [2019-12-27 17:33:36,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 29 SyntacticMatches, 12 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=522, Invalid=2028, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 17:33:37,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107413 states. [2019-12-27 17:33:37,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107413 to 24523. [2019-12-27 17:33:37,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24523 states. [2019-12-27 17:33:37,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24523 states to 24523 states and 73910 transitions. [2019-12-27 17:33:37,733 INFO L78 Accepts]: Start accepts. Automaton has 24523 states and 73910 transitions. Word has length 64 [2019-12-27 17:33:37,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:37,733 INFO L462 AbstractCegarLoop]: Abstraction has 24523 states and 73910 transitions. [2019-12-27 17:33:37,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 17:33:37,733 INFO L276 IsEmpty]: Start isEmpty. Operand 24523 states and 73910 transitions. [2019-12-27 17:33:37,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:33:37,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:37,759 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 17:33:37,759 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 17:33:37,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:37,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1299608434, now seen corresponding path program 4 times [2019-12-27 17:33:37,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:37,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951070144] [2019-12-27 17:33:37,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:37,845 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 17:33:37,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951070144] [2019-12-27 17:33:37,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:37,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:33:37,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1090447252] [2019-12-27 17:33:37,846 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:37,865 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:38,091 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 207 states and 365 transitions. [2019-12-27 17:33:38,092 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:38,292 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 17:33:38,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 17:33:38,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:38,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 17:33:38,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:33:38,293 INFO L87 Difference]: Start difference. First operand 24523 states and 73910 transitions. Second operand 12 states. [2019-12-27 17:33:40,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:40,496 INFO L93 Difference]: Finished difference Result 70313 states and 207667 transitions. [2019-12-27 17:33:40,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 17:33:40,497 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-12-27 17:33:40,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:40,582 INFO L225 Difference]: With dead ends: 70313 [2019-12-27 17:33:40,582 INFO L226 Difference]: Without dead ends: 61677 [2019-12-27 17:33:40,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2019-12-27 17:33:40,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61677 states. [2019-12-27 17:33:41,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61677 to 24831. [2019-12-27 17:33:41,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24831 states. [2019-12-27 17:33:41,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24831 states to 24831 states and 74861 transitions. [2019-12-27 17:33:41,228 INFO L78 Accepts]: Start accepts. Automaton has 24831 states and 74861 transitions. Word has length 64 [2019-12-27 17:33:41,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:41,228 INFO L462 AbstractCegarLoop]: Abstraction has 24831 states and 74861 transitions. [2019-12-27 17:33:41,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 17:33:41,228 INFO L276 IsEmpty]: Start isEmpty. Operand 24831 states and 74861 transitions. [2019-12-27 17:33:41,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:33:41,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:41,256 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 17:33:41,256 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 17:33:41,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:41,256 INFO L82 PathProgramCache]: Analyzing trace with hash 2138548684, now seen corresponding path program 5 times [2019-12-27 17:33:41,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:41,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469940145] [2019-12-27 17:33:41,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:41,311 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 17:33:41,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469940145] [2019-12-27 17:33:41,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:41,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:33:41,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [404926451] [2019-12-27 17:33:41,312 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:41,330 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:41,593 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 252 states and 431 transitions. [2019-12-27 17:33:41,593 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:41,597 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:33:41,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:33:41,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:41,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:33:41,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:33:41,598 INFO L87 Difference]: Start difference. First operand 24831 states and 74861 transitions. Second operand 3 states. [2019-12-27 17:33:41,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:41,772 INFO L93 Difference]: Finished difference Result 30036 states and 90273 transitions. [2019-12-27 17:33:41,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:33:41,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 17:33:41,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:41,813 INFO L225 Difference]: With dead ends: 30036 [2019-12-27 17:33:41,813 INFO L226 Difference]: Without dead ends: 30036 [2019-12-27 17:33:41,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 4 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 17:33:41,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30036 states. [2019-12-27 17:33:42,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30036 to 25720. [2019-12-27 17:33:42,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25720 states. [2019-12-27 17:33:42,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25720 states to 25720 states and 77719 transitions. [2019-12-27 17:33:42,224 INFO L78 Accepts]: Start accepts. Automaton has 25720 states and 77719 transitions. Word has length 64 [2019-12-27 17:33:42,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:42,224 INFO L462 AbstractCegarLoop]: Abstraction has 25720 states and 77719 transitions. [2019-12-27 17:33:42,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:33:42,224 INFO L276 IsEmpty]: Start isEmpty. Operand 25720 states and 77719 transitions. [2019-12-27 17:33:42,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:33:42,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:42,250 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:33:42,250 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 17:33:42,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:42,251 INFO L82 PathProgramCache]: Analyzing trace with hash 649944659, now seen corresponding path program 1 times [2019-12-27 17:33:42,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:42,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942231625] [2019-12-27 17:33:42,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:42,357 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 17:33:42,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942231625] [2019-12-27 17:33:42,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:42,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:33:42,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [897033082] [2019-12-27 17:33:42,358 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:42,378 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:42,752 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 232 states and 401 transitions. [2019-12-27 17:33:42,752 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:43,004 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 17:33:43,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 17:33:43,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:43,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 17:33:43,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:33:43,005 INFO L87 Difference]: Start difference. First operand 25720 states and 77719 transitions. Second operand 14 states. [2019-12-27 17:33:44,474 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-12-27 17:33:44,810 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-12-27 17:33:45,167 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-12-27 17:33:45,480 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-12-27 17:33:45,912 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-12-27 17:33:46,342 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-12-27 17:33:46,547 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-12-27 17:33:46,876 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-12-27 17:33:47,276 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-12-27 17:33:49,449 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-27 17:33:49,913 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-12-27 17:33:50,401 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-12-27 17:33:50,649 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-12-27 17:33:52,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:52,939 INFO L93 Difference]: Finished difference Result 144083 states and 429790 transitions. [2019-12-27 17:33:52,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-12-27 17:33:52,940 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-12-27 17:33:52,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:53,113 INFO L225 Difference]: With dead ends: 144083 [2019-12-27 17:33:53,113 INFO L226 Difference]: Without dead ends: 112901 [2019-12-27 17:33:53,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 72 SyntacticMatches, 7 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2644 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1411, Invalid=6071, Unknown=0, NotChecked=0, Total=7482 [2019-12-27 17:33:53,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112901 states. [2019-12-27 17:33:54,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112901 to 28236. [2019-12-27 17:33:54,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28236 states. [2019-12-27 17:33:54,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28236 states to 28236 states and 86280 transitions. [2019-12-27 17:33:54,096 INFO L78 Accepts]: Start accepts. Automaton has 28236 states and 86280 transitions. Word has length 65 [2019-12-27 17:33:54,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:54,097 INFO L462 AbstractCegarLoop]: Abstraction has 28236 states and 86280 transitions. [2019-12-27 17:33:54,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 17:33:54,097 INFO L276 IsEmpty]: Start isEmpty. Operand 28236 states and 86280 transitions. [2019-12-27 17:33:54,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:33:54,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:54,126 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 17:33:54,126 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 17:33:54,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:54,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1783623245, now seen corresponding path program 1 times [2019-12-27 17:33:54,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:54,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446022465] [2019-12-27 17:33:54,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:54,195 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 17:33:54,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446022465] [2019-12-27 17:33:54,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:54,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:33:54,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1697756300] [2019-12-27 17:33:54,196 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:54,218 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:54,428 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 179 states and 304 transitions. [2019-12-27 17:33:54,428 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:54,429 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:33:54,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:33:54,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:54,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:33:54,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:33:54,430 INFO L87 Difference]: Start difference. First operand 28236 states and 86280 transitions. Second operand 4 states. [2019-12-27 17:33:54,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:54,741 INFO L93 Difference]: Finished difference Result 44131 states and 134393 transitions. [2019-12-27 17:33:54,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:33:54,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 17:33:54,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:54,801 INFO L225 Difference]: With dead ends: 44131 [2019-12-27 17:33:54,802 INFO L226 Difference]: Without dead ends: 44131 [2019-12-27 17:33:54,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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 17:33:54,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44131 states. [2019-12-27 17:33:55,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44131 to 28624. [2019-12-27 17:33:55,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28624 states. [2019-12-27 17:33:55,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28624 states to 28624 states and 87613 transitions. [2019-12-27 17:33:55,655 INFO L78 Accepts]: Start accepts. Automaton has 28624 states and 87613 transitions. Word has length 65 [2019-12-27 17:33:55,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:55,655 INFO L462 AbstractCegarLoop]: Abstraction has 28624 states and 87613 transitions. [2019-12-27 17:33:55,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:33:55,655 INFO L276 IsEmpty]: Start isEmpty. Operand 28624 states and 87613 transitions. [2019-12-27 17:33:55,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:33:55,688 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:55,688 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 17:33:55,688 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 17:33:55,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:55,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1926848449, now seen corresponding path program 2 times [2019-12-27 17:33:55,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:55,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609645686] [2019-12-27 17:33:55,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:55,793 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 17:33:55,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609645686] [2019-12-27 17:33:55,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:55,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:33:55,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1735141236] [2019-12-27 17:33:55,794 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:55,814 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:56,061 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 194 states and 329 transitions. [2019-12-27 17:33:56,062 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:56,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 17:33:56,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:33:56,414 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 17:33:56,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 17:33:56,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:56,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 17:33:56,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:33:56,415 INFO L87 Difference]: Start difference. First operand 28624 states and 87613 transitions. Second operand 14 states. [2019-12-27 17:33:57,082 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-12-27 17:33:57,395 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-12-27 17:33:57,844 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-12-27 17:33:58,032 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-12-27 17:33:58,175 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-12-27 17:33:59,416 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-27 17:34:00,409 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-27 17:34:00,803 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-27 17:34:00,935 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-27 17:34:05,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:34:05,101 INFO L93 Difference]: Finished difference Result 130344 states and 387113 transitions. [2019-12-27 17:34:05,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-12-27 17:34:05,102 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-12-27 17:34:05,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:34:05,258 INFO L225 Difference]: With dead ends: 130344 [2019-12-27 17:34:05,258 INFO L226 Difference]: Without dead ends: 108508 [2019-12-27 17:34:05,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 9 SyntacticMatches, 7 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2898 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1392, Invalid=6618, Unknown=0, NotChecked=0, Total=8010 [2019-12-27 17:34:05,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108508 states. [2019-12-27 17:34:06,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108508 to 30127. [2019-12-27 17:34:06,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30127 states. [2019-12-27 17:34:06,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30127 states to 30127 states and 92338 transitions. [2019-12-27 17:34:06,271 INFO L78 Accepts]: Start accepts. Automaton has 30127 states and 92338 transitions. Word has length 65 [2019-12-27 17:34:06,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:34:06,271 INFO L462 AbstractCegarLoop]: Abstraction has 30127 states and 92338 transitions. [2019-12-27 17:34:06,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 17:34:06,271 INFO L276 IsEmpty]: Start isEmpty. Operand 30127 states and 92338 transitions. [2019-12-27 17:34:06,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:34:06,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:34:06,304 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 17:34:06,304 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 17:34:06,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:34:06,305 INFO L82 PathProgramCache]: Analyzing trace with hash -2101268803, now seen corresponding path program 3 times [2019-12-27 17:34:06,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:34:06,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330949656] [2019-12-27 17:34:06,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:34:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:34:06,421 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 17:34:06,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330949656] [2019-12-27 17:34:06,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:34:06,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:34:06,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2029791527] [2019-12-27 17:34:06,423 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:34:06,448 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:34:06,642 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 289 transitions. [2019-12-27 17:34:06,643 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:34:06,778 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 17:34:06,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 17:34:06,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:34:06,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 17:34:06,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:34:06,779 INFO L87 Difference]: Start difference. First operand 30127 states and 92338 transitions. Second operand 11 states. [2019-12-27 17:34:08,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:34:08,174 INFO L93 Difference]: Finished difference Result 97230 states and 288184 transitions. [2019-12-27 17:34:08,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 17:34:08,174 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 17:34:08,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:34:08,301 INFO L225 Difference]: With dead ends: 97230 [2019-12-27 17:34:08,301 INFO L226 Difference]: Without dead ends: 92195 [2019-12-27 17:34:08,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-27 17:34:08,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92195 states. [2019-12-27 17:34:09,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92195 to 29944. [2019-12-27 17:34:09,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29944 states. [2019-12-27 17:34:09,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29944 states to 29944 states and 91620 transitions. [2019-12-27 17:34:09,471 INFO L78 Accepts]: Start accepts. Automaton has 29944 states and 91620 transitions. Word has length 65 [2019-12-27 17:34:09,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:34:09,471 INFO L462 AbstractCegarLoop]: Abstraction has 29944 states and 91620 transitions. [2019-12-27 17:34:09,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 17:34:09,471 INFO L276 IsEmpty]: Start isEmpty. Operand 29944 states and 91620 transitions. [2019-12-27 17:34:09,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:34:09,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:34:09,504 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 17:34:09,504 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 17:34:09,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:34:09,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1093152375, now seen corresponding path program 2 times [2019-12-27 17:34:09,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:34:09,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32464342] [2019-12-27 17:34:09,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:34:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:34:09,611 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 17:34:09,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32464342] [2019-12-27 17:34:09,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:34:09,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:34:09,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [513235117] [2019-12-27 17:34:09,612 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:34:09,632 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:34:09,851 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 221 states and 372 transitions. [2019-12-27 17:34:09,852 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:34:10,023 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 17:34:10,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 17:34:10,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:34:10,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 17:34:10,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:34:10,024 INFO L87 Difference]: Start difference. First operand 29944 states and 91620 transitions. Second operand 13 states. [2019-12-27 17:34:12,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:34:12,244 INFO L93 Difference]: Finished difference Result 72393 states and 223524 transitions. [2019-12-27 17:34:12,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 17:34:12,249 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 17:34:12,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:34:12,356 INFO L225 Difference]: With dead ends: 72393 [2019-12-27 17:34:12,356 INFO L226 Difference]: Without dead ends: 72393 [2019-12-27 17:34:12,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=699, Unknown=0, NotChecked=0, Total=992 [2019-12-27 17:34:12,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72393 states. [2019-12-27 17:34:13,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72393 to 30368. [2019-12-27 17:34:13,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30368 states. [2019-12-27 17:34:13,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30368 states to 30368 states and 93095 transitions. [2019-12-27 17:34:13,133 INFO L78 Accepts]: Start accepts. Automaton has 30368 states and 93095 transitions. Word has length 65 [2019-12-27 17:34:13,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:34:13,133 INFO L462 AbstractCegarLoop]: Abstraction has 30368 states and 93095 transitions. [2019-12-27 17:34:13,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 17:34:13,133 INFO L276 IsEmpty]: Start isEmpty. Operand 30368 states and 93095 transitions. [2019-12-27 17:34:13,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:34:13,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:34:13,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:34:13,166 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 17:34:13,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:34:13,167 INFO L82 PathProgramCache]: Analyzing trace with hash -704047196, now seen corresponding path program 1 times [2019-12-27 17:34:13,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:34:13,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937718964] [2019-12-27 17:34:13,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:34:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:34:13,270 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 17:34:13,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937718964] [2019-12-27 17:34:13,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:34:13,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:34:13,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1221106261] [2019-12-27 17:34:13,271 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:34:13,288 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:34:13,786 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 248 states and 404 transitions. [2019-12-27 17:34:13,786 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:34:14,098 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 17:34:14,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 17:34:14,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:34:14,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 17:34:14,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-12-27 17:34:14,099 INFO L87 Difference]: Start difference. First operand 30368 states and 93095 transitions. Second operand 15 states. [2019-12-27 17:34:21,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:34:21,846 INFO L93 Difference]: Finished difference Result 124575 states and 370185 transitions. [2019-12-27 17:34:21,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-12-27 17:34:21,847 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2019-12-27 17:34:21,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:34:22,035 INFO L225 Difference]: With dead ends: 124575 [2019-12-27 17:34:22,035 INFO L226 Difference]: Without dead ends: 124128 [2019-12-27 17:34:22,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2537 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1382, Invalid=6100, Unknown=0, NotChecked=0, Total=7482 [2019-12-27 17:34:22,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124128 states. [2019-12-27 17:34:23,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124128 to 33626. [2019-12-27 17:34:23,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33626 states. [2019-12-27 17:34:23,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33626 states to 33626 states and 102923 transitions. [2019-12-27 17:34:23,597 INFO L78 Accepts]: Start accepts. Automaton has 33626 states and 102923 transitions. Word has length 65 [2019-12-27 17:34:23,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:34:23,597 INFO L462 AbstractCegarLoop]: Abstraction has 33626 states and 102923 transitions. [2019-12-27 17:34:23,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 17:34:23,598 INFO L276 IsEmpty]: Start isEmpty. Operand 33626 states and 102923 transitions. [2019-12-27 17:34:23,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:34:23,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:34:23,635 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 17:34:23,635 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 17:34:23,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:34:23,635 INFO L82 PathProgramCache]: Analyzing trace with hash 720231034, now seen corresponding path program 2 times [2019-12-27 17:34:23,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:34:23,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829087535] [2019-12-27 17:34:23,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:34:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:34:23,816 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 17:34:23,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829087535] [2019-12-27 17:34:23,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:34:23,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 17:34:23,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1447351001] [2019-12-27 17:34:23,817 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:34:23,836 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:34:24,086 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 267 states and 443 transitions. [2019-12-27 17:34:24,086 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:34:24,222 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 17:34:24,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 17:34:24,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:34:24,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 17:34:24,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:34:24,223 INFO L87 Difference]: Start difference. First operand 33626 states and 102923 transitions. Second operand 14 states. [2019-12-27 17:34:28,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:34:28,044 INFO L93 Difference]: Finished difference Result 85678 states and 262272 transitions. [2019-12-27 17:34:28,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 17:34:28,045 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-12-27 17:34:28,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:34:28,174 INFO L225 Difference]: With dead ends: 85678 [2019-12-27 17:34:28,175 INFO L226 Difference]: Without dead ends: 85458 [2019-12-27 17:34:28,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 12 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=253, Invalid=1007, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 17:34:28,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85458 states. [2019-12-27 17:34:29,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85458 to 39228. [2019-12-27 17:34:29,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39228 states. [2019-12-27 17:34:29,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39228 states to 39228 states and 120216 transitions. [2019-12-27 17:34:29,400 INFO L78 Accepts]: Start accepts. Automaton has 39228 states and 120216 transitions. Word has length 65 [2019-12-27 17:34:29,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:34:29,400 INFO L462 AbstractCegarLoop]: Abstraction has 39228 states and 120216 transitions. [2019-12-27 17:34:29,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 17:34:29,400 INFO L276 IsEmpty]: Start isEmpty. Operand 39228 states and 120216 transitions. [2019-12-27 17:34:29,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:34:29,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:34:29,442 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 17:34:29,442 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 17:34:29,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:34:29,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1426652930, now seen corresponding path program 3 times [2019-12-27 17:34:29,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:34:29,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284136934] [2019-12-27 17:34:29,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:34:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:34:29,502 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 17:34:29,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284136934] [2019-12-27 17:34:29,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:34:29,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:34:29,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1399695301] [2019-12-27 17:34:29,503 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:34:29,522 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:34:29,742 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 251 states and 406 transitions. [2019-12-27 17:34:29,742 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:34:29,743 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:34:29,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:34:29,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:34:29,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:34:29,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:34:29,744 INFO L87 Difference]: Start difference. First operand 39228 states and 120216 transitions. Second operand 3 states. [2019-12-27 17:34:29,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:34:29,860 INFO L93 Difference]: Finished difference Result 39228 states and 120215 transitions. [2019-12-27 17:34:29,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:34:29,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 17:34:29,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:34:29,915 INFO L225 Difference]: With dead ends: 39228 [2019-12-27 17:34:29,915 INFO L226 Difference]: Without dead ends: 39228 [2019-12-27 17:34:29,916 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 17:34:30,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39228 states. [2019-12-27 17:34:30,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39228 to 30355. [2019-12-27 17:34:30,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30355 states. [2019-12-27 17:34:30,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30355 states to 30355 states and 94815 transitions. [2019-12-27 17:34:30,455 INFO L78 Accepts]: Start accepts. Automaton has 30355 states and 94815 transitions. Word has length 65 [2019-12-27 17:34:30,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:34:30,455 INFO L462 AbstractCegarLoop]: Abstraction has 30355 states and 94815 transitions. [2019-12-27 17:34:30,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:34:30,456 INFO L276 IsEmpty]: Start isEmpty. Operand 30355 states and 94815 transitions. [2019-12-27 17:34:30,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:34:30,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:34:30,490 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 17:34:30,491 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 17:34:30,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:34:30,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1061804981, now seen corresponding path program 1 times [2019-12-27 17:34:30,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:34:30,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815786284] [2019-12-27 17:34:30,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:34:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:34:30,552 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 17:34:30,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815786284] [2019-12-27 17:34:30,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:34:30,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:34:30,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [85190638] [2019-12-27 17:34:30,553 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:34:30,569 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:34:30,885 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 238 states and 381 transitions. [2019-12-27 17:34:30,886 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:34:30,887 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:34:30,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:34:30,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:34:30,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:34:30,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:34:30,888 INFO L87 Difference]: Start difference. First operand 30355 states and 94815 transitions. Second operand 3 states. [2019-12-27 17:34:31,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:34:31,056 INFO L93 Difference]: Finished difference Result 25512 states and 77709 transitions. [2019-12-27 17:34:31,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:34:31,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 17:34:31,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:34:31,118 INFO L225 Difference]: With dead ends: 25512 [2019-12-27 17:34:31,118 INFO L226 Difference]: Without dead ends: 25512 [2019-12-27 17:34:31,119 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 17:34:31,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25512 states. [2019-12-27 17:34:31,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25512 to 24116. [2019-12-27 17:34:31,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24116 states. [2019-12-27 17:34:31,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24116 states to 24116 states and 73347 transitions. [2019-12-27 17:34:31,973 INFO L78 Accepts]: Start accepts. Automaton has 24116 states and 73347 transitions. Word has length 66 [2019-12-27 17:34:31,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:34:31,974 INFO L462 AbstractCegarLoop]: Abstraction has 24116 states and 73347 transitions. [2019-12-27 17:34:31,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:34:31,974 INFO L276 IsEmpty]: Start isEmpty. Operand 24116 states and 73347 transitions. [2019-12-27 17:34:32,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:34:32,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:34:32,008 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 17:34:32,008 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:34:32,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:34:32,008 INFO L82 PathProgramCache]: Analyzing trace with hash -956640512, now seen corresponding path program 1 times [2019-12-27 17:34:32,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:34:32,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871068100] [2019-12-27 17:34:32,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:34:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:34:32,064 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 17:34:32,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871068100] [2019-12-27 17:34:32,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:34:32,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:34:32,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [777878448] [2019-12-27 17:34:32,065 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:34:32,083 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:34:32,449 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 241 states and 434 transitions. [2019-12-27 17:34:32,449 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:34:32,464 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 17:34:32,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:34:32,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:34:32,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:34:32,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:34:32,465 INFO L87 Difference]: Start difference. First operand 24116 states and 73347 transitions. Second operand 4 states. [2019-12-27 17:34:32,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:34:32,688 INFO L93 Difference]: Finished difference Result 24116 states and 73117 transitions. [2019-12-27 17:34:32,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:34:32,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 17:34:32,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:34:32,747 INFO L225 Difference]: With dead ends: 24116 [2019-12-27 17:34:32,748 INFO L226 Difference]: Without dead ends: 24116 [2019-12-27 17:34:32,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 6 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 17:34:32,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24116 states. [2019-12-27 17:34:33,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24116 to 21744. [2019-12-27 17:34:33,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21744 states. [2019-12-27 17:34:33,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21744 states to 21744 states and 65805 transitions. [2019-12-27 17:34:33,290 INFO L78 Accepts]: Start accepts. Automaton has 21744 states and 65805 transitions. Word has length 67 [2019-12-27 17:34:33,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:34:33,291 INFO L462 AbstractCegarLoop]: Abstraction has 21744 states and 65805 transitions. [2019-12-27 17:34:33,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:34:33,291 INFO L276 IsEmpty]: Start isEmpty. Operand 21744 states and 65805 transitions. [2019-12-27 17:34:33,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:34:33,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:34:33,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:34:33,312 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:34:33,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:34:33,312 INFO L82 PathProgramCache]: Analyzing trace with hash 28997027, now seen corresponding path program 1 times [2019-12-27 17:34:33,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:34:33,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18423205] [2019-12-27 17:34:33,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:34:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:34:33,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 17:34:33,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18423205] [2019-12-27 17:34:33,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:34:33,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 17:34:33,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1136055446] [2019-12-27 17:34:33,655 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:34:33,664 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:34:33,802 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 193 states and 326 transitions. [2019-12-27 17:34:33,802 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:34:34,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:34:34,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 17:34:34,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:34:34,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:34:34,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:34:34,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:34:35,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 17:34:35,131 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 31 times. [2019-12-27 17:34:35,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 17:34:35,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:34:35,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 17:34:35,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2019-12-27 17:34:35,133 INFO L87 Difference]: Start difference. First operand 21744 states and 65805 transitions. Second operand 29 states. [2019-12-27 17:34:40,375 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2019-12-27 17:34:52,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:34:52,094 INFO L93 Difference]: Finished difference Result 52598 states and 155610 transitions. [2019-12-27 17:34:52,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-27 17:34:52,095 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 67 [2019-12-27 17:34:52,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:34:52,148 INFO L225 Difference]: With dead ends: 52598 [2019-12-27 17:34:52,148 INFO L226 Difference]: Without dead ends: 40708 [2019-12-27 17:34:52,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 12 SyntacticMatches, 12 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1510 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=904, Invalid=5416, Unknown=0, NotChecked=0, Total=6320 [2019-12-27 17:34:52,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40708 states. [2019-12-27 17:34:52,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40708 to 21960. [2019-12-27 17:34:52,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21960 states. [2019-12-27 17:34:52,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21960 states to 21960 states and 66221 transitions. [2019-12-27 17:34:52,585 INFO L78 Accepts]: Start accepts. Automaton has 21960 states and 66221 transitions. Word has length 67 [2019-12-27 17:34:52,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:34:52,585 INFO L462 AbstractCegarLoop]: Abstraction has 21960 states and 66221 transitions. [2019-12-27 17:34:52,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-27 17:34:52,585 INFO L276 IsEmpty]: Start isEmpty. Operand 21960 states and 66221 transitions. [2019-12-27 17:34:52,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:34:52,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:34:52,608 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 17:34:52,609 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:34:52,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:34:52,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1145475155, now seen corresponding path program 2 times [2019-12-27 17:34:52,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:34:52,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886784953] [2019-12-27 17:34:52,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:34:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:34:53,084 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 17:34:53,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886784953] [2019-12-27 17:34:53,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:34:53,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 17:34:53,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [578515961] [2019-12-27 17:34:53,085 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:34:53,098 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:34:53,437 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 226 states and 414 transitions. [2019-12-27 17:34:53,438 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:34:54,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:34:54,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 17:34:54,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:34:54,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:34:54,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:34:54,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:34:54,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 17:34:55,086 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 44 times. [2019-12-27 17:34:55,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-27 17:34:55,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:34:55,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-27 17:34:55,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1005, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 17:34:55,088 INFO L87 Difference]: Start difference. First operand 21960 states and 66221 transitions. Second operand 34 states. [2019-12-27 17:34:57,180 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-12-27 17:35:21,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:35:21,972 INFO L93 Difference]: Finished difference Result 66919 states and 196292 transitions. [2019-12-27 17:35:21,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-12-27 17:35:21,972 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 67 [2019-12-27 17:35:21,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:35:22,060 INFO L225 Difference]: With dead ends: 66919 [2019-12-27 17:35:22,060 INFO L226 Difference]: Without dead ends: 64142 [2019-12-27 17:35:22,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 15 SyntacticMatches, 16 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5378 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=2307, Invalid=15515, Unknown=0, NotChecked=0, Total=17822 [2019-12-27 17:35:22,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64142 states. [2019-12-27 17:35:22,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64142 to 22170. [2019-12-27 17:35:22,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22170 states. [2019-12-27 17:35:22,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22170 states to 22170 states and 66728 transitions. [2019-12-27 17:35:22,967 INFO L78 Accepts]: Start accepts. Automaton has 22170 states and 66728 transitions. Word has length 67 [2019-12-27 17:35:22,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:35:22,967 INFO L462 AbstractCegarLoop]: Abstraction has 22170 states and 66728 transitions. [2019-12-27 17:35:22,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-27 17:35:22,967 INFO L276 IsEmpty]: Start isEmpty. Operand 22170 states and 66728 transitions. [2019-12-27 17:35:22,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:35:22,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:35:22,988 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 17:35:22,988 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:35:22,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:35:22,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1411328063, now seen corresponding path program 3 times [2019-12-27 17:35:22,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:35:22,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472437329] [2019-12-27 17:35:22,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:35:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:35:23,096 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 17:35:23,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472437329] [2019-12-27 17:35:23,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:35:23,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:35:23,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [967153959] [2019-12-27 17:35:23,097 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:35:23,111 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:35:23,362 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 215 states and 382 transitions. [2019-12-27 17:35:23,363 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:35:23,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:35:23,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:35:23,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:35:23,778 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 17:35:23,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 17:35:23,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:35:23,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 17:35:23,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-27 17:35:23,780 INFO L87 Difference]: Start difference. First operand 22170 states and 66728 transitions. Second operand 16 states. [2019-12-27 17:35:26,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:35:26,499 INFO L93 Difference]: Finished difference Result 39145 states and 116347 transitions. [2019-12-27 17:35:26,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 17:35:26,499 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 17:35:26,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:35:26,544 INFO L225 Difference]: With dead ends: 39145 [2019-12-27 17:35:26,544 INFO L226 Difference]: Without dead ends: 33510 [2019-12-27 17:35:26,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 10 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2019-12-27 17:35:26,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33510 states. [2019-12-27 17:35:26,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33510 to 22010. [2019-12-27 17:35:26,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22010 states. [2019-12-27 17:35:26,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22010 states to 22010 states and 66286 transitions. [2019-12-27 17:35:26,961 INFO L78 Accepts]: Start accepts. Automaton has 22010 states and 66286 transitions. Word has length 67 [2019-12-27 17:35:26,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:35:26,961 INFO L462 AbstractCegarLoop]: Abstraction has 22010 states and 66286 transitions. [2019-12-27 17:35:26,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 17:35:26,961 INFO L276 IsEmpty]: Start isEmpty. Operand 22010 states and 66286 transitions. [2019-12-27 17:35:26,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:35:26,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:35:26,988 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 17:35:26,988 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:35:26,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:35:26,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1214430171, now seen corresponding path program 4 times [2019-12-27 17:35:26,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:35:26,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113083298] [2019-12-27 17:35:26,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:35:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:35:27,509 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 17:35:27,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113083298] [2019-12-27 17:35:27,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:35:27,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 17:35:27,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1898790672] [2019-12-27 17:35:27,511 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:35:27,523 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:35:27,643 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 169 states and 266 transitions. [2019-12-27 17:35:27,643 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:35:27,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:35:27,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:35:28,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:35:28,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 17:35:28,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:35:28,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:35:28,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:35:28,565 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 17:35:28,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 17:35:28,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:35:28,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 17:35:28,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2019-12-27 17:35:28,567 INFO L87 Difference]: Start difference. First operand 22010 states and 66286 transitions. Second operand 30 states. [2019-12-27 17:35:37,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:35:37,971 INFO L93 Difference]: Finished difference Result 30791 states and 91207 transitions. [2019-12-27 17:35:37,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 17:35:37,971 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2019-12-27 17:35:37,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:35:38,011 INFO L225 Difference]: With dead ends: 30791 [2019-12-27 17:35:38,011 INFO L226 Difference]: Without dead ends: 28798 [2019-12-27 17:35:38,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 8 SyntacticMatches, 11 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=533, Invalid=3127, Unknown=0, NotChecked=0, Total=3660 [2019-12-27 17:35:38,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28798 states. [2019-12-27 17:35:38,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28798 to 22038. [2019-12-27 17:35:38,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22038 states. [2019-12-27 17:35:38,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22038 states to 22038 states and 66305 transitions. [2019-12-27 17:35:38,370 INFO L78 Accepts]: Start accepts. Automaton has 22038 states and 66305 transitions. Word has length 67 [2019-12-27 17:35:38,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:35:38,370 INFO L462 AbstractCegarLoop]: Abstraction has 22038 states and 66305 transitions. [2019-12-27 17:35:38,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 17:35:38,371 INFO L276 IsEmpty]: Start isEmpty. Operand 22038 states and 66305 transitions. [2019-12-27 17:35:38,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:35:38,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:35:38,400 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 17:35:38,400 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:35:38,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:35:38,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1572000157, now seen corresponding path program 5 times [2019-12-27 17:35:38,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:35:38,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210905710] [2019-12-27 17:35:38,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:35:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:35:38,582 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 17:35:38,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210905710] [2019-12-27 17:35:38,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:35:38,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:35:38,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1721081356] [2019-12-27 17:35:38,583 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:35:38,597 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:35:38,789 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 201 states and 329 transitions. [2019-12-27 17:35:38,790 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:35:39,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:35:39,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:35:39,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:35:39,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:35:39,382 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 17:35:39,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 17:35:39,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:35:39,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 17:35:39,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-12-27 17:35:39,384 INFO L87 Difference]: Start difference. First operand 22038 states and 66305 transitions. Second operand 22 states. [2019-12-27 17:35:45,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:35:45,073 INFO L93 Difference]: Finished difference Result 65079 states and 193571 transitions. [2019-12-27 17:35:45,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-12-27 17:35:45,073 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2019-12-27 17:35:45,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:35:45,148 INFO L225 Difference]: With dead ends: 65079 [2019-12-27 17:35:45,148 INFO L226 Difference]: Without dead ends: 54381 [2019-12-27 17:35:45,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1648 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1066, Invalid=5096, Unknown=0, NotChecked=0, Total=6162 [2019-12-27 17:35:45,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54381 states. [2019-12-27 17:35:45,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54381 to 21770. [2019-12-27 17:35:45,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21770 states. [2019-12-27 17:35:45,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21770 states to 21770 states and 65657 transitions. [2019-12-27 17:35:45,665 INFO L78 Accepts]: Start accepts. Automaton has 21770 states and 65657 transitions. Word has length 67 [2019-12-27 17:35:45,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:35:45,665 INFO L462 AbstractCegarLoop]: Abstraction has 21770 states and 65657 transitions. [2019-12-27 17:35:45,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 17:35:45,665 INFO L276 IsEmpty]: Start isEmpty. Operand 21770 states and 65657 transitions. [2019-12-27 17:35:45,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:35:45,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:35:45,686 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 17:35:45,686 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:35:45,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:35:45,686 INFO L82 PathProgramCache]: Analyzing trace with hash -778064925, now seen corresponding path program 6 times [2019-12-27 17:35:45,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:35:45,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671653226] [2019-12-27 17:35:45,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:35:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:35:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:35:45,815 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:35:45,816 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:35:45,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_82| 0 0))) (and (= v_~z$r_buff0_thd0~0_144 0) (= v_~z$r_buff0_thd1~0_230 0) (= v_~z$w_buff0_used~0_947 0) (= v_~z$r_buff1_thd1~0_185 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1495~0.base_44|) 0) (= 0 |v_ULTIMATE.start_main_~#t1495~0.offset_28|) (= v_~z$w_buff1_used~0_563 0) (= v_~weak$$choice2~0_147 0) (= 0 v_~z$r_buff1_thd3~0_352) (= 0 v_~x~0_159) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$read_delayed~0_6 0) (= v_~z$mem_tmp~0_24 0) (= v_~z$r_buff0_thd2~0_126 0) (= 0 v_~__unbuffered_p2_EAX~0_47) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1495~0.base_44| 4)) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_cnt~0_155 0) (= v_~z$r_buff1_thd2~0_201 0) (= 0 v_~z$r_buff0_thd3~0_371) (= |v_#valid_80| (store .cse0 |v_ULTIMATE.start_main_~#t1495~0.base_44| 1)) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1495~0.base_44| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1495~0.base_44|) |v_ULTIMATE.start_main_~#t1495~0.offset_28| 0))) (= v_~main$tmp_guard1~0_38 0) (= v_~z$r_buff1_thd0~0_199 0) (= 0 |v_#NULL.base_7|) (= 0 v_~weak$$choice0~0_19) (= v_~z$w_buff1~0_328 0) (= v_~z~0_152 0) (= v_~z$w_buff0~0_540 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$flush_delayed~0_35) (= v_~y~0_49 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1495~0.base_44|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1496~0.base=|v_ULTIMATE.start_main_~#t1496~0.base_44|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_201, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_59|, ULTIMATE.start_main_~#t1497~0.offset=|v_ULTIMATE.start_main_~#t1497~0.offset_18|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_328, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_37|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_99|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_31|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_75|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_144, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_199, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ~y~0=v_~y~0_49, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_126, ULTIMATE.start_main_~#t1496~0.offset=|v_ULTIMATE.start_main_~#t1496~0.offset_28|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_947, ~z$w_buff0~0=v_~z$w_buff0~0_540, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_352, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_563, ~z$flush_delayed~0=v_~z$flush_delayed~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_~#t1497~0.base=|v_ULTIMATE.start_main_~#t1497~0.base_25|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t1495~0.offset=|v_ULTIMATE.start_main_~#t1495~0.offset_28|, ~weak$$choice0~0=v_~weak$$choice0~0_19, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, #valid=|v_#valid_80|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_185, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t1495~0.base=|v_ULTIMATE.start_main_~#t1495~0.base_44|, ~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_371, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~z~0=v_~z~0_152, ~weak$$choice2~0=v_~weak$$choice2~0_147, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_230, ~x~0=v_~x~0_159} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1496~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t1497~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1496~0.offset, ~z$mem_tmp~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_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1497~0.base, #NULL.base, ULTIMATE.start_main_~#t1495~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_~#t1495~0.base, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 17:35:45,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L818-1-->L820: Formula: (and (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1496~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1496~0.base_13|)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1496~0.base_13|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1496~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1496~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1496~0.base_13|) |v_ULTIMATE.start_main_~#t1496~0.offset_11| 1)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t1496~0.offset_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1496~0.base_13| 4) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1496~0.base=|v_ULTIMATE.start_main_~#t1496~0.base_13|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1496~0.offset=|v_ULTIMATE.start_main_~#t1496~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1496~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1496~0.offset] because there is no mapped edge [2019-12-27 17:35:45,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L820-1-->L822: Formula: (and (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1497~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1497~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1497~0.base_13|) |v_ULTIMATE.start_main_~#t1497~0.offset_11| 2)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t1497~0.base_13| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1497~0.base_13| 4)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1497~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1497~0.offset_11| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1497~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1497~0.offset=|v_ULTIMATE.start_main_~#t1497~0.offset_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1497~0.base=|v_ULTIMATE.start_main_~#t1497~0.base_13|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1497~0.offset, #length, ULTIMATE.start_main_~#t1497~0.base] because there is no mapped edge [2019-12-27 17:35:45,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_163 v_~z$w_buff1_used~0_112) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= v_~z$w_buff0~0_38 v_~z$w_buff1~0_37) (= v_P0Thread1of1ForFork0_~arg.base_14 |v_P0Thread1of1ForFork0_#in~arg.base_14|) (= v_~z$w_buff0_used~0_162 1) (= 1 v_~z$w_buff0~0_37) (= v_P0Thread1of1ForFork0_~arg.offset_14 |v_P0Thread1of1ForFork0_#in~arg.offset_14|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_16 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= (mod v_~z$w_buff1_used~0_112 256) 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_14|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_163, ~z$w_buff0~0=v_~z$w_buff0~0_38, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_14|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_14|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_162, ~z$w_buff0~0=v_~z$w_buff0~0_37, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_16, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_112, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_14|, ~z$w_buff1~0=v_~z$w_buff1~0_37, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_14, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_14} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 17:35:45,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L784-->L784-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1067530610 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1067530610 256)))) (or (and (= (mod ~z$w_buff1_used~0_In-1067530610 256) 0) .cse0) (and .cse0 (= (mod ~z$r_buff1_thd3~0_In-1067530610 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-1067530610 256)))) (= |P2Thread1of1ForFork2_#t~ite20_Out-1067530610| ~z$w_buff0~0_In-1067530610) .cse1 (= |P2Thread1of1ForFork2_#t~ite21_Out-1067530610| |P2Thread1of1ForFork2_#t~ite20_Out-1067530610|)) (and (= |P2Thread1of1ForFork2_#t~ite20_In-1067530610| |P2Thread1of1ForFork2_#t~ite20_Out-1067530610|) (= |P2Thread1of1ForFork2_#t~ite21_Out-1067530610| ~z$w_buff0~0_In-1067530610) (not .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1067530610, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1067530610, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_In-1067530610|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1067530610, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1067530610, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1067530610, ~weak$$choice2~0=~weak$$choice2~0_In-1067530610} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-1067530610, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1067530610|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1067530610, P2Thread1of1ForFork2_#t~ite21=|P2Thread1of1ForFork2_#t~ite21_Out-1067530610|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1067530610, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1067530610, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1067530610, ~weak$$choice2~0=~weak$$choice2~0_In-1067530610} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 17:35:45,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L762-2-->L762-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1003939402 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite9_Out-1003939402| |P1Thread1of1ForFork1_#t~ite10_Out-1003939402|)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-1003939402 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite9_Out-1003939402| ~z~0_In-1003939402) (or .cse1 .cse2)) (and (not .cse2) .cse0 (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-1003939402| ~z$w_buff1~0_In-1003939402)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1003939402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1003939402, ~z$w_buff1~0=~z$w_buff1~0_In-1003939402, ~z~0=~z~0_In-1003939402} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1003939402|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1003939402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1003939402, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1003939402|, ~z$w_buff1~0=~z$w_buff1~0_In-1003939402, ~z~0=~z~0_In-1003939402} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 17:35:45,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1313510262 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-1313510262 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1313510262| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1313510262| ~z$w_buff0_used~0_In-1313510262)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1313510262, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1313510262} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1313510262|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1313510262, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1313510262} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 17:35:45,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In312225141 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In312225141 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In312225141 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In312225141 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out312225141| 0)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out312225141| ~z$w_buff1_used~0_In312225141) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In312225141, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In312225141, ~z$w_buff1_used~0=~z$w_buff1_used~0_In312225141, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In312225141} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out312225141|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In312225141, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In312225141, ~z$w_buff1_used~0=~z$w_buff1_used~0_In312225141, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In312225141} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 17:35:45,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L745-->L746: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1541582316 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1541582316 256) 0))) (or (and (not .cse0) (= ~z$r_buff0_thd1~0_Out1541582316 0) (not .cse1)) (and (= ~z$r_buff0_thd1~0_Out1541582316 ~z$r_buff0_thd1~0_In1541582316) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1541582316, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1541582316} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1541582316, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1541582316|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1541582316} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 17:35:45,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L763-->L763-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-897173590 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-897173590 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-897173590| ~z$w_buff0_used~0_In-897173590)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-897173590|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-897173590, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-897173590} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-897173590, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-897173590|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-897173590} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 17:35:45,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L764-->L764-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd2~0_In-2146994316 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-2146994316 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2146994316 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-2146994316 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out-2146994316| 0)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out-2146994316| ~z$w_buff1_used~0_In-2146994316) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2146994316, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2146994316, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2146994316, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2146994316} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2146994316, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2146994316, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2146994316, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-2146994316|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2146994316} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 17:35:45,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1527721626 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1527721626 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out1527721626|) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In1527721626 |P1Thread1of1ForFork1_#t~ite13_Out1527721626|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1527721626, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1527721626} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1527721626, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1527721626|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1527721626} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 17:35:45,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L766-->L766-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-657313025 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-657313025 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-657313025 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-657313025 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-657313025|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd2~0_In-657313025 |P1Thread1of1ForFork1_#t~ite14_Out-657313025|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-657313025, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-657313025, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-657313025, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-657313025} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-657313025, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-657313025, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-657313025, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-657313025|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-657313025} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 17:35:45,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~z$r_buff1_thd2~0_92) (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_92, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 17:35:45,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L788-->L789: Formula: (and (= v_~z$r_buff0_thd3~0_137 v_~z$r_buff0_thd3~0_136) (not (= (mod v_~weak$$choice2~0_34 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_34} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_12|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_34} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 17:35:45,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L789-->L789-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In537295834 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite35_Out537295834| ~z$r_buff1_thd3~0_In537295834) (= |P2Thread1of1ForFork2_#t~ite36_Out537295834| |P2Thread1of1ForFork2_#t~ite35_Out537295834|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In537295834 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In537295834 256)) .cse0) (and (= (mod ~z$r_buff1_thd3~0_In537295834 256) 0) .cse0) (= 0 (mod ~z$w_buff0_used~0_In537295834 256)))) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite35_In537295834| |P2Thread1of1ForFork2_#t~ite35_Out537295834|) (= |P2Thread1of1ForFork2_#t~ite36_Out537295834| ~z$r_buff1_thd3~0_In537295834)))) InVars {P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_In537295834|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In537295834, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In537295834, ~z$w_buff1_used~0=~z$w_buff1_used~0_In537295834, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In537295834, ~weak$$choice2~0=~weak$$choice2~0_In537295834} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out537295834|, P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out537295834|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In537295834, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In537295834, ~z$w_buff1_used~0=~z$w_buff1_used~0_In537295834, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In537295834, ~weak$$choice2~0=~weak$$choice2~0_In537295834} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35, P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-27 17:35:45,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] L791-->L795: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_62 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_62} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 17:35:45,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-2-->L795-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1008420178 256))) (.cse2 (= |P2Thread1of1ForFork2_#t~ite38_Out1008420178| |P2Thread1of1ForFork2_#t~ite39_Out1008420178|)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In1008420178 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |P2Thread1of1ForFork2_#t~ite38_Out1008420178| ~z~0_In1008420178)) (and (not .cse1) .cse2 (not .cse0) (= |P2Thread1of1ForFork2_#t~ite38_Out1008420178| ~z$w_buff1~0_In1008420178)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1008420178, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1008420178, ~z$w_buff1~0=~z$w_buff1~0_In1008420178, ~z~0=~z~0_In1008420178} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1008420178, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1008420178, ~z$w_buff1~0=~z$w_buff1~0_In1008420178, ~z~0=~z~0_In1008420178, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out1008420178|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out1008420178|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 17:35:45,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1846103698 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1846103698 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite40_Out-1846103698|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1846103698 |P2Thread1of1ForFork2_#t~ite40_Out-1846103698|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1846103698, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1846103698} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1846103698, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1846103698, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-1846103698|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 17:35:45,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1998376846 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1998376846 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1998376846 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1998376846 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite41_Out-1998376846| ~z$w_buff1_used~0_In-1998376846) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite41_Out-1998376846|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1998376846, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1998376846, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1998376846, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1998376846} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-1998376846|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1998376846, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1998376846, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1998376846, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1998376846} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 17:35:45,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In365533621 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In365533621 256) 0))) (or (and (= ~z$r_buff0_thd3~0_In365533621 |P2Thread1of1ForFork2_#t~ite42_Out365533621|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out365533621|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In365533621, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In365533621} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out365533621|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In365533621, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In365533621} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 17:35:45,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In1000805938 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1000805938 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In1000805938 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1000805938 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite43_Out1000805938| ~z$r_buff1_thd3~0_In1000805938)) (and (= |P2Thread1of1ForFork2_#t~ite43_Out1000805938| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1000805938, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1000805938, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1000805938, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1000805938} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1000805938, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1000805938, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out1000805938|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1000805938, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1000805938} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 17:35:45,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_167 |v_P2Thread1of1ForFork2_#t~ite43_40|)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_167, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_39|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 17:35:45,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L746-->L746-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In1462840025 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1462840025 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1462840025 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In1462840025 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd1~0_In1462840025 |P0Thread1of1ForFork0_#t~ite8_Out1462840025|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1462840025|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1462840025, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1462840025, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1462840025, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1462840025} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1462840025, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1462840025|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1462840025, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1462840025, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1462840025} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 17:35:45,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L746-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_159 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_159, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 17:35:45,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L822-1-->L828: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 17:35:45,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L828-2-->L828-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-2005233971 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite48_Out-2005233971| |ULTIMATE.start_main_#t~ite47_Out-2005233971|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-2005233971 256)))) (or (and (= ~z~0_In-2005233971 |ULTIMATE.start_main_#t~ite47_Out-2005233971|) .cse0 (or .cse1 .cse2)) (and (= ~z$w_buff1~0_In-2005233971 |ULTIMATE.start_main_#t~ite47_Out-2005233971|) (not .cse1) .cse0 (not .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2005233971, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2005233971, ~z$w_buff1~0=~z$w_buff1~0_In-2005233971, ~z~0=~z~0_In-2005233971} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2005233971, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-2005233971|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2005233971, ~z$w_buff1~0=~z$w_buff1~0_In-2005233971, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-2005233971|, ~z~0=~z~0_In-2005233971} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 17:35:45,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-686834723 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-686834723 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-686834723| ~z$w_buff0_used~0_In-686834723)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-686834723| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-686834723, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-686834723} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-686834723, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-686834723, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-686834723|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 17:35:45,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L830-->L830-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-766923837 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-766923837 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-766923837 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-766923837 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-766923837|)) (and (= ~z$w_buff1_used~0_In-766923837 |ULTIMATE.start_main_#t~ite50_Out-766923837|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-766923837, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-766923837, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-766923837, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-766923837} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-766923837|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-766923837, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-766923837, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-766923837, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-766923837} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 17:35:45,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In398885132 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In398885132 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out398885132|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In398885132 |ULTIMATE.start_main_#t~ite51_Out398885132|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In398885132, ~z$w_buff0_used~0=~z$w_buff0_used~0_In398885132} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In398885132, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out398885132|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In398885132} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 17:35:45,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L832-->L832-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1397541558 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1397541558 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1397541558 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1397541558 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out1397541558|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In1397541558 |ULTIMATE.start_main_#t~ite52_Out1397541558|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1397541558, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1397541558, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1397541558, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1397541558} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1397541558|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1397541558, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1397541558, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1397541558, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1397541558} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 17:35:45,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= 2 v_~x~0_130) (= 0 v_~__unbuffered_p2_EAX~0_21) (= v_~z$r_buff1_thd0~0_167 |v_ULTIMATE.start_main_#t~ite52_35|) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~y~0_23 2)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_23, ~x~0=v_~x~0_130} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_34|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_167, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_23, ~x~0=v_~x~0_130, 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 17:35:45,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:35:45 BasicIcfg [2019-12-27 17:35:45,978 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:35:45,981 INFO L168 Benchmark]: Toolchain (without parser) took 210874.87 ms. Allocated memory was 138.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 102.2 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 17:35:45,981 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 17:35:45,982 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.13 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.7 MB in the beginning and 157.4 MB in the end (delta: -55.7 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:35:45,982 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.22 ms. Allocated memory is still 203.9 MB. Free memory was 157.4 MB in the beginning and 154.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:35:45,982 INFO L168 Benchmark]: Boogie Preprocessor took 46.32 ms. Allocated memory is still 203.9 MB. Free memory was 154.8 MB in the beginning and 152.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:35:45,982 INFO L168 Benchmark]: RCFGBuilder took 871.31 ms. Allocated memory is still 203.9 MB. Free memory was 152.1 MB in the beginning and 102.8 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2019-12-27 17:35:45,983 INFO L168 Benchmark]: TraceAbstraction took 209116.76 ms. Allocated memory was 203.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 102.1 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 17:35:45,985 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.45 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 769.13 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.7 MB in the beginning and 157.4 MB in the end (delta: -55.7 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.22 ms. Allocated memory is still 203.9 MB. Free memory was 157.4 MB in the beginning and 154.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.32 ms. Allocated memory is still 203.9 MB. Free memory was 154.8 MB in the beginning and 152.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 871.31 ms. Allocated memory is still 203.9 MB. Free memory was 152.1 MB in the beginning and 102.8 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 209116.76 ms. Allocated memory was 203.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 102.1 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 174 ProgramPointsBefore, 92 ProgramPointsAfterwards, 211 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 6843 VarBasedMoverChecksPositive, 273 VarBasedMoverChecksNegative, 91 SemBasedMoverChecksPositive, 240 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 77200 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1495, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L820] FCALL, FORK 0 pthread_create(&t1496, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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=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] [L822] FCALL, FORK 0 pthread_create(&t1497, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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=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] [L732] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L733] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L734] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L735] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=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] [L742] 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_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] [L756] 2 x = 2 [L759] 2 y = 1 VAL [__unbuffered_cnt=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 [L779] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 3 z$flush_delayed = weak$$choice2 [L782] 3 z$mem_tmp = z VAL [__unbuffered_cnt=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=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 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_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=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 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) [L784] 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)) [L785] 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_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=7, 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=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 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)) [L786] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_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=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 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)) [L762] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_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=7, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 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) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 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 [L762] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L763] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L764] 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 [L765] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L787] 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 [\result={0:0}, __unbuffered_cnt=1, __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=7, 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=2, y=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 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)) [L789] 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)) [L790] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __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=7, weak$$choice2=1, x=2, y=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 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 [\result={0:0}, __unbuffered_cnt=1, __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=7, weak$$choice2=1, x=2, y=2, 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] [L795] 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) [L796] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 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 [L798] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L828] 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_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=7, weak$$choice2=1, x=2, y=2, 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] [L828] 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) [L829] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 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 [L831] 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, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 208.7s, OverallIterations: 39, TraceHistogramMax: 1, AutomataDifference: 126.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11469 SDtfs, 22496 SDslu, 59998 SDs, 0 SdLazy, 64106 SolverSat, 1547 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 68.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1429 GetRequests, 347 SyntacticMatches, 141 SemanticMatches, 941 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19421 ImplicationChecksByTransitivity, 34.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138429occurred 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: 44.2s AutomataMinimizationTime, 38 MinimizatonAttempts, 844039 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1857 NumberOfCodeBlocks, 1857 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1752 ConstructedInterpolants, 0 QuantifiedInterpolants, 372079 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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...