/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix019_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:43:30,826 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:43:30,829 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:43:30,847 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:43:30,847 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:43:30,849 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:43:30,851 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:43:30,860 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:43:30,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:43:30,866 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:43:30,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:43:30,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:43:30,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:43:30,872 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:43:30,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:43:30,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:43:30,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:43:30,878 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:43:30,880 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:43:30,885 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:43:30,889 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:43:30,894 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:43:30,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:43:30,896 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:43:30,898 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:43:30,899 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:43:30,899 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:43:30,901 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:43:30,902 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:43:30,903 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:43:30,903 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:43:30,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:43:30,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:43:30,907 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:43:30,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:43:30,908 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:43:30,909 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:43:30,909 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:43:30,909 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:43:30,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:43:30,911 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:43:30,912 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.epf [2019-12-27 01:43:30,932 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:43:30,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:43:30,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:43:30,937 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:43:30,938 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:43:30,938 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:43:30,938 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:43:30,938 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:43:30,938 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:43:30,939 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:43:30,939 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:43:30,939 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:43:30,939 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:43:30,939 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:43:30,940 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:43:30,940 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:43:30,940 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:43:30,940 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:43:30,940 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:43:30,941 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:43:30,941 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:43:30,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:43:30,941 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:43:30,941 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:43:30,942 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:43:30,942 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:43:30,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:43:30,942 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:43:30,942 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:43:31,208 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:43:31,221 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:43:31,225 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:43:31,227 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:43:31,227 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:43:31,228 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_rmo.oepc.i [2019-12-27 01:43:31,289 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b46b59faa/8c2db516e40648c7b564c0d636afdfb5/FLAG58ab90919 [2019-12-27 01:43:31,821 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:43:31,823 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_rmo.oepc.i [2019-12-27 01:43:31,838 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b46b59faa/8c2db516e40648c7b564c0d636afdfb5/FLAG58ab90919 [2019-12-27 01:43:32,133 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b46b59faa/8c2db516e40648c7b564c0d636afdfb5 [2019-12-27 01:43:32,142 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:43:32,144 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:43:32,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:43:32,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:43:32,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:43:32,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:43:32" (1/1) ... [2019-12-27 01:43:32,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdaac8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:43:32, skipping insertion in model container [2019-12-27 01:43:32,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:43:32" (1/1) ... [2019-12-27 01:43:32,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:43:32,230 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:43:32,765 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:43:32,786 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:43:32,860 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:43:32,943 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:43:32,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:43:32 WrapperNode [2019-12-27 01:43:32,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:43:32,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:43:32,945 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:43:32,945 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:43:32,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:43:32" (1/1) ... [2019-12-27 01:43:32,984 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:43:32" (1/1) ... [2019-12-27 01:43:33,023 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:43:33,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:43:33,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:43:33,024 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:43:33,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:43:32" (1/1) ... [2019-12-27 01:43:33,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:43:32" (1/1) ... [2019-12-27 01:43:33,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:43:32" (1/1) ... [2019-12-27 01:43:33,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:43:32" (1/1) ... [2019-12-27 01:43:33,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:43:32" (1/1) ... [2019-12-27 01:43:33,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:43:32" (1/1) ... [2019-12-27 01:43:33,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:43:32" (1/1) ... [2019-12-27 01:43:33,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:43:33,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:43:33,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:43:33,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:43:33,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:43:32" (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 01:43:33,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:43:33,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:43:33,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:43:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:43:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:43:33,154 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:43:33,154 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:43:33,154 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:43:33,155 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 01:43:33,155 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 01:43:33,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:43:33,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:43:33,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:43:33,157 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 01:43:33,932 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:43:33,932 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:43:33,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:43:33 BoogieIcfgContainer [2019-12-27 01:43:33,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:43:33,935 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:43:33,935 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:43:33,939 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:43:33,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:43:32" (1/3) ... [2019-12-27 01:43:33,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f8220d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:43:33, skipping insertion in model container [2019-12-27 01:43:33,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:43:32" (2/3) ... [2019-12-27 01:43:33,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f8220d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:43:33, skipping insertion in model container [2019-12-27 01:43:33,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:43:33" (3/3) ... [2019-12-27 01:43:33,944 INFO L109 eAbstractionObserver]: Analyzing ICFG mix019_rmo.oepc.i [2019-12-27 01:43:33,955 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:43:33,956 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:43:33,967 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:43:33,968 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:43:34,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,014 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,014 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,014 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,015 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,015 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,023 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,024 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,032 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,033 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,080 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,082 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,089 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,090 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,090 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,096 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,096 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:43:34,116 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 01:43:34,137 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:43:34,138 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:43:34,138 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:43:34,138 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:43:34,138 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:43:34,138 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:43:34,138 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:43:34,139 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:43:34,156 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 01:43:34,158 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 01:43:34,263 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 01:43:34,263 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:43:34,276 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:43:34,299 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 01:43:34,355 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 01:43:34,355 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:43:34,363 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:43:34,384 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 01:43:34,386 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:43:38,963 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-12-27 01:43:39,583 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 01:43:39,715 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 01:43:39,967 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130103 [2019-12-27 01:43:39,967 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-27 01:43:39,971 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 105 transitions [2019-12-27 01:44:01,579 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122102 states. [2019-12-27 01:44:01,582 INFO L276 IsEmpty]: Start isEmpty. Operand 122102 states. [2019-12-27 01:44:01,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 01:44:01,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:01,589 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 01:44:01,589 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 01:44:01,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:01,596 INFO L82 PathProgramCache]: Analyzing trace with hash 913940, now seen corresponding path program 1 times [2019-12-27 01:44:01,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:01,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914910092] [2019-12-27 01:44:01,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:01,797 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 01:44:01,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914910092] [2019-12-27 01:44:01,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:01,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:44:01,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953318414] [2019-12-27 01:44:01,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:44:01,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:01,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:44:01,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:44:01,822 INFO L87 Difference]: Start difference. First operand 122102 states. Second operand 3 states. [2019-12-27 01:44:05,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:05,589 INFO L93 Difference]: Finished difference Result 121140 states and 517588 transitions. [2019-12-27 01:44:05,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:44:05,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 01:44:05,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:06,392 INFO L225 Difference]: With dead ends: 121140 [2019-12-27 01:44:06,393 INFO L226 Difference]: Without dead ends: 107958 [2019-12-27 01:44:06,394 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 01:44:12,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107958 states. [2019-12-27 01:44:14,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107958 to 107958. [2019-12-27 01:44:14,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107958 states. [2019-12-27 01:44:19,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107958 states to 107958 states and 460128 transitions. [2019-12-27 01:44:19,613 INFO L78 Accepts]: Start accepts. Automaton has 107958 states and 460128 transitions. Word has length 3 [2019-12-27 01:44:19,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:19,614 INFO L462 AbstractCegarLoop]: Abstraction has 107958 states and 460128 transitions. [2019-12-27 01:44:19,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:44:19,614 INFO L276 IsEmpty]: Start isEmpty. Operand 107958 states and 460128 transitions. [2019-12-27 01:44:19,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 01:44:19,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:19,619 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:44:19,619 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 01:44:19,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:19,620 INFO L82 PathProgramCache]: Analyzing trace with hash 2082409598, now seen corresponding path program 1 times [2019-12-27 01:44:19,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:19,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722851609] [2019-12-27 01:44:19,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:19,741 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 01:44:19,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722851609] [2019-12-27 01:44:19,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:19,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:44:19,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927479960] [2019-12-27 01:44:19,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:44:19,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:19,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:44:19,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:44:19,744 INFO L87 Difference]: Start difference. First operand 107958 states and 460128 transitions. Second operand 4 states. [2019-12-27 01:44:21,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:21,082 INFO L93 Difference]: Finished difference Result 172022 states and 703369 transitions. [2019-12-27 01:44:21,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:44:21,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 01:44:21,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:26,499 INFO L225 Difference]: With dead ends: 172022 [2019-12-27 01:44:26,499 INFO L226 Difference]: Without dead ends: 171924 [2019-12-27 01:44:26,500 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 01:44:31,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171924 states. [2019-12-27 01:44:34,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171924 to 156115. [2019-12-27 01:44:34,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156115 states. [2019-12-27 01:44:35,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156115 states to 156115 states and 647087 transitions. [2019-12-27 01:44:35,545 INFO L78 Accepts]: Start accepts. Automaton has 156115 states and 647087 transitions. Word has length 11 [2019-12-27 01:44:35,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:35,545 INFO L462 AbstractCegarLoop]: Abstraction has 156115 states and 647087 transitions. [2019-12-27 01:44:35,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:44:35,546 INFO L276 IsEmpty]: Start isEmpty. Operand 156115 states and 647087 transitions. [2019-12-27 01:44:35,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 01:44:35,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:35,564 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:44:35,564 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 01:44:35,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:35,564 INFO L82 PathProgramCache]: Analyzing trace with hash 594088235, now seen corresponding path program 1 times [2019-12-27 01:44:35,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:35,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878704381] [2019-12-27 01:44:35,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:35,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:44:35,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878704381] [2019-12-27 01:44:35,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:35,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:44:35,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540575548] [2019-12-27 01:44:35,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:44:35,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:35,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:44:35,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:44:35,636 INFO L87 Difference]: Start difference. First operand 156115 states and 647087 transitions. Second operand 3 states. [2019-12-27 01:44:35,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:35,780 INFO L93 Difference]: Finished difference Result 33388 states and 108650 transitions. [2019-12-27 01:44:35,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:44:35,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 01:44:35,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:35,843 INFO L225 Difference]: With dead ends: 33388 [2019-12-27 01:44:35,844 INFO L226 Difference]: Without dead ends: 33388 [2019-12-27 01:44:35,844 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 01:44:36,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33388 states. [2019-12-27 01:44:36,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33388 to 33388. [2019-12-27 01:44:36,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33388 states. [2019-12-27 01:44:36,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33388 states to 33388 states and 108650 transitions. [2019-12-27 01:44:36,536 INFO L78 Accepts]: Start accepts. Automaton has 33388 states and 108650 transitions. Word has length 13 [2019-12-27 01:44:36,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:36,537 INFO L462 AbstractCegarLoop]: Abstraction has 33388 states and 108650 transitions. [2019-12-27 01:44:36,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:44:36,537 INFO L276 IsEmpty]: Start isEmpty. Operand 33388 states and 108650 transitions. [2019-12-27 01:44:36,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:44:36,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:36,540 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:44:36,541 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 01:44:36,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:36,541 INFO L82 PathProgramCache]: Analyzing trace with hash -805978823, now seen corresponding path program 1 times [2019-12-27 01:44:36,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:36,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328189055] [2019-12-27 01:44:36,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:36,616 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 01:44:36,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328189055] [2019-12-27 01:44:36,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:36,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:44:36,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813266601] [2019-12-27 01:44:36,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:44:36,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:36,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:44:36,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:44:36,619 INFO L87 Difference]: Start difference. First operand 33388 states and 108650 transitions. Second operand 3 states. [2019-12-27 01:44:37,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:37,317 INFO L93 Difference]: Finished difference Result 52822 states and 170897 transitions. [2019-12-27 01:44:37,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:44:37,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 01:44:37,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:37,407 INFO L225 Difference]: With dead ends: 52822 [2019-12-27 01:44:37,408 INFO L226 Difference]: Without dead ends: 52822 [2019-12-27 01:44:37,408 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 01:44:37,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52822 states. [2019-12-27 01:44:38,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52822 to 39094. [2019-12-27 01:44:38,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39094 states. [2019-12-27 01:44:38,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39094 states to 39094 states and 127496 transitions. [2019-12-27 01:44:38,105 INFO L78 Accepts]: Start accepts. Automaton has 39094 states and 127496 transitions. Word has length 16 [2019-12-27 01:44:38,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:38,107 INFO L462 AbstractCegarLoop]: Abstraction has 39094 states and 127496 transitions. [2019-12-27 01:44:38,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:44:38,107 INFO L276 IsEmpty]: Start isEmpty. Operand 39094 states and 127496 transitions. [2019-12-27 01:44:38,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:44:38,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:38,111 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:44:38,111 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 01:44:38,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:38,111 INFO L82 PathProgramCache]: Analyzing trace with hash -805853304, now seen corresponding path program 1 times [2019-12-27 01:44:38,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:38,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263716668] [2019-12-27 01:44:38,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:38,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 01:44:38,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263716668] [2019-12-27 01:44:38,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:38,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:44:38,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616201195] [2019-12-27 01:44:38,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:44:38,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:38,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:44:38,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:44:38,193 INFO L87 Difference]: Start difference. First operand 39094 states and 127496 transitions. Second operand 4 states. [2019-12-27 01:44:38,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:38,556 INFO L93 Difference]: Finished difference Result 46903 states and 150848 transitions. [2019-12-27 01:44:38,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:44:38,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 01:44:38,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:38,635 INFO L225 Difference]: With dead ends: 46903 [2019-12-27 01:44:38,635 INFO L226 Difference]: Without dead ends: 46903 [2019-12-27 01:44:38,636 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 01:44:38,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46903 states. [2019-12-27 01:44:39,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46903 to 42953. [2019-12-27 01:44:39,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-27 01:44:39,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 139113 transitions. [2019-12-27 01:44:39,782 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 139113 transitions. Word has length 16 [2019-12-27 01:44:39,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:39,782 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 139113 transitions. [2019-12-27 01:44:39,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:44:39,782 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 139113 transitions. [2019-12-27 01:44:39,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:44:39,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:39,786 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:44:39,786 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 01:44:39,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:39,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1222928522, now seen corresponding path program 1 times [2019-12-27 01:44:39,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:39,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655022761] [2019-12-27 01:44:39,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:39,856 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 01:44:39,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655022761] [2019-12-27 01:44:39,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:39,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:44:39,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727618344] [2019-12-27 01:44:39,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:44:39,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:39,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:44:39,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:44:39,859 INFO L87 Difference]: Start difference. First operand 42953 states and 139113 transitions. Second operand 4 states. [2019-12-27 01:44:40,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:40,185 INFO L93 Difference]: Finished difference Result 51478 states and 165621 transitions. [2019-12-27 01:44:40,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:44:40,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 01:44:40,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:40,268 INFO L225 Difference]: With dead ends: 51478 [2019-12-27 01:44:40,268 INFO L226 Difference]: Without dead ends: 51478 [2019-12-27 01:44:40,268 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 01:44:40,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51478 states. [2019-12-27 01:44:40,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51478 to 44383. [2019-12-27 01:44:40,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44383 states. [2019-12-27 01:44:41,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44383 states to 44383 states and 143934 transitions. [2019-12-27 01:44:41,033 INFO L78 Accepts]: Start accepts. Automaton has 44383 states and 143934 transitions. Word has length 16 [2019-12-27 01:44:41,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:41,033 INFO L462 AbstractCegarLoop]: Abstraction has 44383 states and 143934 transitions. [2019-12-27 01:44:41,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:44:41,033 INFO L276 IsEmpty]: Start isEmpty. Operand 44383 states and 143934 transitions. [2019-12-27 01:44:41,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:44:41,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:41,042 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 01:44:41,043 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 01:44:41,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:41,043 INFO L82 PathProgramCache]: Analyzing trace with hash -655013944, now seen corresponding path program 1 times [2019-12-27 01:44:41,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:41,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045426856] [2019-12-27 01:44:41,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:41,120 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 01:44:41,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045426856] [2019-12-27 01:44:41,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:41,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:44:41,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367243835] [2019-12-27 01:44:41,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:44:41,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:41,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:44:41,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:44:41,122 INFO L87 Difference]: Start difference. First operand 44383 states and 143934 transitions. Second operand 5 states. [2019-12-27 01:44:42,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:42,160 INFO L93 Difference]: Finished difference Result 61264 states and 194140 transitions. [2019-12-27 01:44:42,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:44:42,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 01:44:42,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:42,272 INFO L225 Difference]: With dead ends: 61264 [2019-12-27 01:44:42,272 INFO L226 Difference]: Without dead ends: 61250 [2019-12-27 01:44:42,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 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 01:44:42,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61250 states. [2019-12-27 01:44:43,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61250 to 45686. [2019-12-27 01:44:43,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45686 states. [2019-12-27 01:44:43,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45686 states to 45686 states and 147920 transitions. [2019-12-27 01:44:43,118 INFO L78 Accepts]: Start accepts. Automaton has 45686 states and 147920 transitions. Word has length 22 [2019-12-27 01:44:43,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:43,119 INFO L462 AbstractCegarLoop]: Abstraction has 45686 states and 147920 transitions. [2019-12-27 01:44:43,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:44:43,119 INFO L276 IsEmpty]: Start isEmpty. Operand 45686 states and 147920 transitions. [2019-12-27 01:44:43,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:44:43,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:43,129 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:44:43,129 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 01:44:43,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:43,129 INFO L82 PathProgramCache]: Analyzing trace with hash -2032339914, now seen corresponding path program 1 times [2019-12-27 01:44:43,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:43,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78605091] [2019-12-27 01:44:43,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:43,201 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 01:44:43,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78605091] [2019-12-27 01:44:43,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:43,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:44:43,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742368491] [2019-12-27 01:44:43,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:44:43,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:43,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:44:43,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:44:43,204 INFO L87 Difference]: Start difference. First operand 45686 states and 147920 transitions. Second operand 5 states. [2019-12-27 01:44:43,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:43,829 INFO L93 Difference]: Finished difference Result 63752 states and 201665 transitions. [2019-12-27 01:44:43,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:44:43,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 01:44:43,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:43,941 INFO L225 Difference]: With dead ends: 63752 [2019-12-27 01:44:43,941 INFO L226 Difference]: Without dead ends: 63738 [2019-12-27 01:44:43,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 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 01:44:44,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63738 states. [2019-12-27 01:44:45,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63738 to 44032. [2019-12-27 01:44:45,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44032 states. [2019-12-27 01:44:45,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44032 states to 44032 states and 142639 transitions. [2019-12-27 01:44:45,217 INFO L78 Accepts]: Start accepts. Automaton has 44032 states and 142639 transitions. Word has length 22 [2019-12-27 01:44:45,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:45,218 INFO L462 AbstractCegarLoop]: Abstraction has 44032 states and 142639 transitions. [2019-12-27 01:44:45,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:44:45,218 INFO L276 IsEmpty]: Start isEmpty. Operand 44032 states and 142639 transitions. [2019-12-27 01:44:45,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 01:44:45,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:45,230 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 01:44:45,230 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 01:44:45,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:45,230 INFO L82 PathProgramCache]: Analyzing trace with hash -701847110, now seen corresponding path program 1 times [2019-12-27 01:44:45,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:45,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221048512] [2019-12-27 01:44:45,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:45,296 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 01:44:45,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221048512] [2019-12-27 01:44:45,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:45,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:44:45,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907981735] [2019-12-27 01:44:45,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:44:45,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:45,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:44:45,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:44:45,298 INFO L87 Difference]: Start difference. First operand 44032 states and 142639 transitions. Second operand 4 states. [2019-12-27 01:44:45,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:45,372 INFO L93 Difference]: Finished difference Result 17193 states and 52641 transitions. [2019-12-27 01:44:45,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:44:45,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 01:44:45,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:45,405 INFO L225 Difference]: With dead ends: 17193 [2019-12-27 01:44:45,405 INFO L226 Difference]: Without dead ends: 17193 [2019-12-27 01:44:45,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:44:45,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2019-12-27 01:44:45,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16865. [2019-12-27 01:44:45,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16865 states. [2019-12-27 01:44:45,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16865 states to 16865 states and 51705 transitions. [2019-12-27 01:44:45,650 INFO L78 Accepts]: Start accepts. Automaton has 16865 states and 51705 transitions. Word has length 25 [2019-12-27 01:44:45,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:45,650 INFO L462 AbstractCegarLoop]: Abstraction has 16865 states and 51705 transitions. [2019-12-27 01:44:45,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:44:45,650 INFO L276 IsEmpty]: Start isEmpty. Operand 16865 states and 51705 transitions. [2019-12-27 01:44:45,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 01:44:45,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:45,663 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] [2019-12-27 01:44:45,663 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 01:44:45,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:45,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1083173402, now seen corresponding path program 1 times [2019-12-27 01:44:45,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:45,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262738693] [2019-12-27 01:44:45,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:45,725 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 01:44:45,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262738693] [2019-12-27 01:44:45,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:45,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:44:45,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344857492] [2019-12-27 01:44:45,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:44:45,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:45,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:44:45,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:44:45,727 INFO L87 Difference]: Start difference. First operand 16865 states and 51705 transitions. Second operand 5 states. [2019-12-27 01:44:46,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:46,039 INFO L93 Difference]: Finished difference Result 21613 states and 65127 transitions. [2019-12-27 01:44:46,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:44:46,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 01:44:46,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:46,071 INFO L225 Difference]: With dead ends: 21613 [2019-12-27 01:44:46,071 INFO L226 Difference]: Without dead ends: 21613 [2019-12-27 01:44:46,071 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 01:44:46,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21613 states. [2019-12-27 01:44:46,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21613 to 20225. [2019-12-27 01:44:46,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2019-12-27 01:44:46,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 61637 transitions. [2019-12-27 01:44:46,368 INFO L78 Accepts]: Start accepts. Automaton has 20225 states and 61637 transitions. Word has length 26 [2019-12-27 01:44:46,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:46,368 INFO L462 AbstractCegarLoop]: Abstraction has 20225 states and 61637 transitions. [2019-12-27 01:44:46,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:44:46,368 INFO L276 IsEmpty]: Start isEmpty. Operand 20225 states and 61637 transitions. [2019-12-27 01:44:46,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 01:44:46,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:46,384 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 01:44:46,384 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 01:44:46,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:46,384 INFO L82 PathProgramCache]: Analyzing trace with hash -799804073, now seen corresponding path program 1 times [2019-12-27 01:44:46,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:46,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853792791] [2019-12-27 01:44:46,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:46,450 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 01:44:46,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853792791] [2019-12-27 01:44:46,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:46,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:44:46,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776759424] [2019-12-27 01:44:46,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:44:46,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:46,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:44:46,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:44:46,453 INFO L87 Difference]: Start difference. First operand 20225 states and 61637 transitions. Second operand 5 states. [2019-12-27 01:44:46,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:46,882 INFO L93 Difference]: Finished difference Result 23624 states and 70894 transitions. [2019-12-27 01:44:46,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:44:46,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 01:44:46,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:46,931 INFO L225 Difference]: With dead ends: 23624 [2019-12-27 01:44:46,931 INFO L226 Difference]: Without dead ends: 23624 [2019-12-27 01:44:46,932 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 01:44:47,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2019-12-27 01:44:47,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 19452. [2019-12-27 01:44:47,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19452 states. [2019-12-27 01:44:47,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19452 states to 19452 states and 59284 transitions. [2019-12-27 01:44:47,502 INFO L78 Accepts]: Start accepts. Automaton has 19452 states and 59284 transitions. Word has length 28 [2019-12-27 01:44:47,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:47,502 INFO L462 AbstractCegarLoop]: Abstraction has 19452 states and 59284 transitions. [2019-12-27 01:44:47,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:44:47,502 INFO L276 IsEmpty]: Start isEmpty. Operand 19452 states and 59284 transitions. [2019-12-27 01:44:47,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 01:44:47,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:47,521 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] [2019-12-27 01:44:47,521 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 01:44:47,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:47,521 INFO L82 PathProgramCache]: Analyzing trace with hash -145847770, now seen corresponding path program 1 times [2019-12-27 01:44:47,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:47,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108663267] [2019-12-27 01:44:47,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:47,630 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 01:44:47,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108663267] [2019-12-27 01:44:47,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:47,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:44:47,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165209978] [2019-12-27 01:44:47,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:44:47,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:47,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:44:47,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:44:47,633 INFO L87 Difference]: Start difference. First operand 19452 states and 59284 transitions. Second operand 6 states. [2019-12-27 01:44:48,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:48,298 INFO L93 Difference]: Finished difference Result 27031 states and 80502 transitions. [2019-12-27 01:44:48,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:44:48,298 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-27 01:44:48,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:48,350 INFO L225 Difference]: With dead ends: 27031 [2019-12-27 01:44:48,350 INFO L226 Difference]: Without dead ends: 27031 [2019-12-27 01:44:48,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 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 01:44:48,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27031 states. [2019-12-27 01:44:48,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27031 to 20764. [2019-12-27 01:44:48,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20764 states. [2019-12-27 01:44:48,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20764 states to 20764 states and 63071 transitions. [2019-12-27 01:44:48,688 INFO L78 Accepts]: Start accepts. Automaton has 20764 states and 63071 transitions. Word has length 32 [2019-12-27 01:44:48,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:48,688 INFO L462 AbstractCegarLoop]: Abstraction has 20764 states and 63071 transitions. [2019-12-27 01:44:48,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:44:48,688 INFO L276 IsEmpty]: Start isEmpty. Operand 20764 states and 63071 transitions. [2019-12-27 01:44:48,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 01:44:48,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:48,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] [2019-12-27 01:44:48,717 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 01:44:48,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:48,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1380765993, now seen corresponding path program 1 times [2019-12-27 01:44:48,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:48,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061893359] [2019-12-27 01:44:48,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:48,803 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 01:44:48,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061893359] [2019-12-27 01:44:48,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:48,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:44:48,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178664126] [2019-12-27 01:44:48,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:44:48,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:48,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:44:48,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:44:48,806 INFO L87 Difference]: Start difference. First operand 20764 states and 63071 transitions. Second operand 6 states. [2019-12-27 01:44:49,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:49,532 INFO L93 Difference]: Finished difference Result 26334 states and 78684 transitions. [2019-12-27 01:44:49,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:44:49,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 01:44:49,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:49,584 INFO L225 Difference]: With dead ends: 26334 [2019-12-27 01:44:49,584 INFO L226 Difference]: Without dead ends: 26334 [2019-12-27 01:44:49,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 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 01:44:49,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26334 states. [2019-12-27 01:44:49,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26334 to 17642. [2019-12-27 01:44:49,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17642 states. [2019-12-27 01:44:49,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17642 states to 17642 states and 53957 transitions. [2019-12-27 01:44:49,924 INFO L78 Accepts]: Start accepts. Automaton has 17642 states and 53957 transitions. Word has length 34 [2019-12-27 01:44:49,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:49,925 INFO L462 AbstractCegarLoop]: Abstraction has 17642 states and 53957 transitions. [2019-12-27 01:44:49,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:44:49,925 INFO L276 IsEmpty]: Start isEmpty. Operand 17642 states and 53957 transitions. [2019-12-27 01:44:49,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:44:49,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:49,941 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 01:44:49,941 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 01:44:49,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:49,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1372962452, now seen corresponding path program 1 times [2019-12-27 01:44:49,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:49,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938482551] [2019-12-27 01:44:49,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:50,006 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 01:44:50,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938482551] [2019-12-27 01:44:50,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:50,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:44:50,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778069584] [2019-12-27 01:44:50,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:44:50,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:50,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:44:50,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:44:50,008 INFO L87 Difference]: Start difference. First operand 17642 states and 53957 transitions. Second operand 3 states. [2019-12-27 01:44:50,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:50,073 INFO L93 Difference]: Finished difference Result 17641 states and 53955 transitions. [2019-12-27 01:44:50,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:44:50,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 01:44:50,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:50,108 INFO L225 Difference]: With dead ends: 17641 [2019-12-27 01:44:50,109 INFO L226 Difference]: Without dead ends: 17641 [2019-12-27 01:44:50,110 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 01:44:50,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17641 states. [2019-12-27 01:44:50,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17641 to 17641. [2019-12-27 01:44:50,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17641 states. [2019-12-27 01:44:50,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17641 states to 17641 states and 53955 transitions. [2019-12-27 01:44:50,386 INFO L78 Accepts]: Start accepts. Automaton has 17641 states and 53955 transitions. Word has length 39 [2019-12-27 01:44:50,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:50,387 INFO L462 AbstractCegarLoop]: Abstraction has 17641 states and 53955 transitions. [2019-12-27 01:44:50,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:44:50,387 INFO L276 IsEmpty]: Start isEmpty. Operand 17641 states and 53955 transitions. [2019-12-27 01:44:50,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:44:50,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:50,406 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 01:44:50,406 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 01:44:50,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:50,406 INFO L82 PathProgramCache]: Analyzing trace with hash -2062304393, now seen corresponding path program 1 times [2019-12-27 01:44:50,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:50,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733835124] [2019-12-27 01:44:50,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:50,494 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 01:44:50,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733835124] [2019-12-27 01:44:50,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:50,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:44:50,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226518197] [2019-12-27 01:44:50,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:44:50,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:50,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:44:50,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:44:50,496 INFO L87 Difference]: Start difference. First operand 17641 states and 53955 transitions. Second operand 5 states. [2019-12-27 01:44:51,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:51,449 INFO L93 Difference]: Finished difference Result 25346 states and 76639 transitions. [2019-12-27 01:44:51,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 01:44:51,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 01:44:51,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:51,492 INFO L225 Difference]: With dead ends: 25346 [2019-12-27 01:44:51,493 INFO L226 Difference]: Without dead ends: 25346 [2019-12-27 01:44:51,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:44:51,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25346 states. [2019-12-27 01:44:51,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25346 to 23560. [2019-12-27 01:44:51,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23560 states. [2019-12-27 01:44:51,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23560 states to 23560 states and 71751 transitions. [2019-12-27 01:44:51,836 INFO L78 Accepts]: Start accepts. Automaton has 23560 states and 71751 transitions. Word has length 40 [2019-12-27 01:44:51,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:51,837 INFO L462 AbstractCegarLoop]: Abstraction has 23560 states and 71751 transitions. [2019-12-27 01:44:51,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:44:51,837 INFO L276 IsEmpty]: Start isEmpty. Operand 23560 states and 71751 transitions. [2019-12-27 01:44:51,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:44:51,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:51,867 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 01:44:51,867 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 01:44:51,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:51,868 INFO L82 PathProgramCache]: Analyzing trace with hash -950700709, now seen corresponding path program 2 times [2019-12-27 01:44:51,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:51,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719067378] [2019-12-27 01:44:51,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:51,923 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 01:44:51,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719067378] [2019-12-27 01:44:51,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:51,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:44:51,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388750602] [2019-12-27 01:44:51,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:44:51,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:51,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:44:51,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:44:51,925 INFO L87 Difference]: Start difference. First operand 23560 states and 71751 transitions. Second operand 5 states. [2019-12-27 01:44:52,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:52,043 INFO L93 Difference]: Finished difference Result 22175 states and 68518 transitions. [2019-12-27 01:44:52,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:44:52,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 01:44:52,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:52,077 INFO L225 Difference]: With dead ends: 22175 [2019-12-27 01:44:52,077 INFO L226 Difference]: Without dead ends: 22175 [2019-12-27 01:44:52,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:44:52,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22175 states. [2019-12-27 01:44:52,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22175 to 21251. [2019-12-27 01:44:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21251 states. [2019-12-27 01:44:52,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21251 states to 21251 states and 66025 transitions. [2019-12-27 01:44:52,408 INFO L78 Accepts]: Start accepts. Automaton has 21251 states and 66025 transitions. Word has length 40 [2019-12-27 01:44:52,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:52,408 INFO L462 AbstractCegarLoop]: Abstraction has 21251 states and 66025 transitions. [2019-12-27 01:44:52,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:44:52,408 INFO L276 IsEmpty]: Start isEmpty. Operand 21251 states and 66025 transitions. [2019-12-27 01:44:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:44:52,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:52,438 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:44:52,439 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 01:44:52,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:52,439 INFO L82 PathProgramCache]: Analyzing trace with hash 20161267, now seen corresponding path program 1 times [2019-12-27 01:44:52,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:52,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42484204] [2019-12-27 01:44:52,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:52,534 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 01:44:52,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42484204] [2019-12-27 01:44:52,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:52,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:44:52,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665678217] [2019-12-27 01:44:52,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:44:52,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:52,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:44:52,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:44:52,537 INFO L87 Difference]: Start difference. First operand 21251 states and 66025 transitions. Second operand 7 states. [2019-12-27 01:44:53,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:53,163 INFO L93 Difference]: Finished difference Result 62478 states and 192933 transitions. [2019-12-27 01:44:53,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 01:44:53,164 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:44:53,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:53,269 INFO L225 Difference]: With dead ends: 62478 [2019-12-27 01:44:53,269 INFO L226 Difference]: Without dead ends: 47634 [2019-12-27 01:44:53,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 01:44:53,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47634 states. [2019-12-27 01:44:53,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47634 to 25007. [2019-12-27 01:44:53,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25007 states. [2019-12-27 01:44:54,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25007 states to 25007 states and 78146 transitions. [2019-12-27 01:44:54,308 INFO L78 Accepts]: Start accepts. Automaton has 25007 states and 78146 transitions. Word has length 63 [2019-12-27 01:44:54,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:54,308 INFO L462 AbstractCegarLoop]: Abstraction has 25007 states and 78146 transitions. [2019-12-27 01:44:54,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:44:54,308 INFO L276 IsEmpty]: Start isEmpty. Operand 25007 states and 78146 transitions. [2019-12-27 01:44:54,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:44:54,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:54,337 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] [2019-12-27 01:44:54,337 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 01:44:54,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:54,337 INFO L82 PathProgramCache]: Analyzing trace with hash 618170621, now seen corresponding path program 2 times [2019-12-27 01:44:54,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:54,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039681568] [2019-12-27 01:44:54,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:54,426 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 01:44:54,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039681568] [2019-12-27 01:44:54,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:54,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:44:54,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5160567] [2019-12-27 01:44:54,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:44:54,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:54,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:44:54,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:44:54,431 INFO L87 Difference]: Start difference. First operand 25007 states and 78146 transitions. Second operand 7 states. [2019-12-27 01:44:54,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:54,965 INFO L93 Difference]: Finished difference Result 68433 states and 210070 transitions. [2019-12-27 01:44:54,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:44:54,966 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:44:54,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:55,034 INFO L225 Difference]: With dead ends: 68433 [2019-12-27 01:44:55,034 INFO L226 Difference]: Without dead ends: 48478 [2019-12-27 01:44:55,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:44:55,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48478 states. [2019-12-27 01:44:55,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48478 to 28798. [2019-12-27 01:44:55,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28798 states. [2019-12-27 01:44:55,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28798 states to 28798 states and 89643 transitions. [2019-12-27 01:44:55,596 INFO L78 Accepts]: Start accepts. Automaton has 28798 states and 89643 transitions. Word has length 63 [2019-12-27 01:44:55,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:55,596 INFO L462 AbstractCegarLoop]: Abstraction has 28798 states and 89643 transitions. [2019-12-27 01:44:55,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:44:55,597 INFO L276 IsEmpty]: Start isEmpty. Operand 28798 states and 89643 transitions. [2019-12-27 01:44:55,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:44:55,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:55,628 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] [2019-12-27 01:44:55,628 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 01:44:55,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:55,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1826673419, now seen corresponding path program 3 times [2019-12-27 01:44:55,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:55,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644047428] [2019-12-27 01:44:55,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:55,719 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 01:44:55,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644047428] [2019-12-27 01:44:55,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:55,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:44:55,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035358110] [2019-12-27 01:44:55,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:44:55,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:55,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:44:55,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:44:55,721 INFO L87 Difference]: Start difference. First operand 28798 states and 89643 transitions. Second operand 7 states. [2019-12-27 01:44:56,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:56,249 INFO L93 Difference]: Finished difference Result 59843 states and 183697 transitions. [2019-12-27 01:44:56,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:44:56,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:44:56,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:56,325 INFO L225 Difference]: With dead ends: 59843 [2019-12-27 01:44:56,326 INFO L226 Difference]: Without dead ends: 52762 [2019-12-27 01:44:56,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:44:56,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52762 states. [2019-12-27 01:44:56,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52762 to 29106. [2019-12-27 01:44:56,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29106 states. [2019-12-27 01:44:56,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29106 states to 29106 states and 90594 transitions. [2019-12-27 01:44:56,922 INFO L78 Accepts]: Start accepts. Automaton has 29106 states and 90594 transitions. Word has length 63 [2019-12-27 01:44:56,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:56,922 INFO L462 AbstractCegarLoop]: Abstraction has 29106 states and 90594 transitions. [2019-12-27 01:44:56,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:44:56,922 INFO L276 IsEmpty]: Start isEmpty. Operand 29106 states and 90594 transitions. [2019-12-27 01:44:56,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:44:56,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:56,953 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] [2019-12-27 01:44:56,953 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 01:44:56,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:56,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1896779851, now seen corresponding path program 4 times [2019-12-27 01:44:56,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:56,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692141448] [2019-12-27 01:44:56,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:57,422 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 01:44:57,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692141448] [2019-12-27 01:44:57,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:57,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:44:57,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245417706] [2019-12-27 01:44:57,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:44:57,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:57,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:44:57,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:44:57,425 INFO L87 Difference]: Start difference. First operand 29106 states and 90594 transitions. Second operand 3 states. [2019-12-27 01:44:57,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:57,585 INFO L93 Difference]: Finished difference Result 35624 states and 109784 transitions. [2019-12-27 01:44:57,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:44:57,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-27 01:44:57,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:57,635 INFO L225 Difference]: With dead ends: 35624 [2019-12-27 01:44:57,635 INFO L226 Difference]: Without dead ends: 35624 [2019-12-27 01:44:57,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:44:57,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35624 states. [2019-12-27 01:44:58,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35624 to 31022. [2019-12-27 01:44:58,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31022 states. [2019-12-27 01:44:58,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31022 states to 31022 states and 96384 transitions. [2019-12-27 01:44:58,115 INFO L78 Accepts]: Start accepts. Automaton has 31022 states and 96384 transitions. Word has length 63 [2019-12-27 01:44:58,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:58,116 INFO L462 AbstractCegarLoop]: Abstraction has 31022 states and 96384 transitions. [2019-12-27 01:44:58,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:44:58,116 INFO L276 IsEmpty]: Start isEmpty. Operand 31022 states and 96384 transitions. [2019-12-27 01:44:58,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:44:58,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:58,150 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 01:44:58,150 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 01:44:58,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:58,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1820548391, now seen corresponding path program 1 times [2019-12-27 01:44:58,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:58,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632775047] [2019-12-27 01:44:58,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:58,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 01:44:58,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632775047] [2019-12-27 01:44:58,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:58,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:44:58,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435069898] [2019-12-27 01:44:58,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:44:58,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:58,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:44:58,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:44:58,221 INFO L87 Difference]: Start difference. First operand 31022 states and 96384 transitions. Second operand 3 states. [2019-12-27 01:44:58,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:58,384 INFO L93 Difference]: Finished difference Result 31021 states and 96382 transitions. [2019-12-27 01:44:58,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:44:58,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:44:58,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:58,458 INFO L225 Difference]: With dead ends: 31021 [2019-12-27 01:44:58,458 INFO L226 Difference]: Without dead ends: 31021 [2019-12-27 01:44:58,458 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 01:44:58,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31021 states. [2019-12-27 01:44:58,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31021 to 27348. [2019-12-27 01:44:58,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27348 states. [2019-12-27 01:44:58,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27348 states to 27348 states and 86085 transitions. [2019-12-27 01:44:58,956 INFO L78 Accepts]: Start accepts. Automaton has 27348 states and 86085 transitions. Word has length 64 [2019-12-27 01:44:58,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:58,957 INFO L462 AbstractCegarLoop]: Abstraction has 27348 states and 86085 transitions. [2019-12-27 01:44:58,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:44:58,957 INFO L276 IsEmpty]: Start isEmpty. Operand 27348 states and 86085 transitions. [2019-12-27 01:44:58,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:44:58,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:58,993 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 01:44:58,994 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 01:44:58,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:58,994 INFO L82 PathProgramCache]: Analyzing trace with hash 78921339, now seen corresponding path program 1 times [2019-12-27 01:44:58,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:58,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552419467] [2019-12-27 01:44:58,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:44:59,066 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 01:44:59,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552419467] [2019-12-27 01:44:59,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:44:59,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:44:59,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573466097] [2019-12-27 01:44:59,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:44:59,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:44:59,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:44:59,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:44:59,069 INFO L87 Difference]: Start difference. First operand 27348 states and 86085 transitions. Second operand 3 states. [2019-12-27 01:44:59,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:44:59,166 INFO L93 Difference]: Finished difference Result 23805 states and 73809 transitions. [2019-12-27 01:44:59,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:44:59,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 01:44:59,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:44:59,211 INFO L225 Difference]: With dead ends: 23805 [2019-12-27 01:44:59,211 INFO L226 Difference]: Without dead ends: 23805 [2019-12-27 01:44:59,212 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 01:44:59,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23805 states. [2019-12-27 01:44:59,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23805 to 21779. [2019-12-27 01:44:59,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21779 states. [2019-12-27 01:44:59,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21779 states to 21779 states and 67477 transitions. [2019-12-27 01:44:59,790 INFO L78 Accepts]: Start accepts. Automaton has 21779 states and 67477 transitions. Word has length 65 [2019-12-27 01:44:59,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:44:59,790 INFO L462 AbstractCegarLoop]: Abstraction has 21779 states and 67477 transitions. [2019-12-27 01:44:59,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:44:59,791 INFO L276 IsEmpty]: Start isEmpty. Operand 21779 states and 67477 transitions. [2019-12-27 01:44:59,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:44:59,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:44:59,833 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 01:44:59,834 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 01:44:59,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:44:59,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1524862519, now seen corresponding path program 1 times [2019-12-27 01:44:59,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:44:59,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690015526] [2019-12-27 01:44:59,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:44:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:45:00,916 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 01:45:00,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690015526] [2019-12-27 01:45:00,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:45:00,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 01:45:00,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669716348] [2019-12-27 01:45:00,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 01:45:00,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:45:00,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 01:45:00,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-12-27 01:45:00,923 INFO L87 Difference]: Start difference. First operand 21779 states and 67477 transitions. Second operand 17 states. [2019-12-27 01:45:05,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:45:05,236 INFO L93 Difference]: Finished difference Result 35969 states and 109927 transitions. [2019-12-27 01:45:05,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 01:45:05,237 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-27 01:45:05,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:45:05,280 INFO L225 Difference]: With dead ends: 35969 [2019-12-27 01:45:05,280 INFO L226 Difference]: Without dead ends: 31160 [2019-12-27 01:45:05,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=428, Invalid=1734, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 01:45:05,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31160 states. [2019-12-27 01:45:05,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31160 to 22698. [2019-12-27 01:45:05,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22698 states. [2019-12-27 01:45:05,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22698 states to 22698 states and 70034 transitions. [2019-12-27 01:45:05,666 INFO L78 Accepts]: Start accepts. Automaton has 22698 states and 70034 transitions. Word has length 66 [2019-12-27 01:45:05,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:45:05,666 INFO L462 AbstractCegarLoop]: Abstraction has 22698 states and 70034 transitions. [2019-12-27 01:45:05,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 01:45:05,666 INFO L276 IsEmpty]: Start isEmpty. Operand 22698 states and 70034 transitions. [2019-12-27 01:45:05,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:45:05,695 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:45:05,695 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 01:45:05,695 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 01:45:05,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:45:05,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1620692773, now seen corresponding path program 2 times [2019-12-27 01:45:05,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:45:05,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865318327] [2019-12-27 01:45:05,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:45:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:45:05,882 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 01:45:05,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865318327] [2019-12-27 01:45:05,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:45:05,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:45:05,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867100273] [2019-12-27 01:45:05,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:45:05,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:45:05,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:45:05,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:45:05,887 INFO L87 Difference]: Start difference. First operand 22698 states and 70034 transitions. Second operand 11 states. [2019-12-27 01:45:07,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:45:07,179 INFO L93 Difference]: Finished difference Result 48427 states and 149728 transitions. [2019-12-27 01:45:07,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 01:45:07,179 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 01:45:07,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:45:07,242 INFO L225 Difference]: With dead ends: 48427 [2019-12-27 01:45:07,242 INFO L226 Difference]: Without dead ends: 45891 [2019-12-27 01:45:07,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-27 01:45:07,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45891 states. [2019-12-27 01:45:08,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45891 to 27407. [2019-12-27 01:45:08,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27407 states. [2019-12-27 01:45:08,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27407 states to 27407 states and 84533 transitions. [2019-12-27 01:45:08,110 INFO L78 Accepts]: Start accepts. Automaton has 27407 states and 84533 transitions. Word has length 66 [2019-12-27 01:45:08,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:45:08,111 INFO L462 AbstractCegarLoop]: Abstraction has 27407 states and 84533 transitions. [2019-12-27 01:45:08,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:45:08,111 INFO L276 IsEmpty]: Start isEmpty. Operand 27407 states and 84533 transitions. [2019-12-27 01:45:08,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:45:08,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:45:08,151 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 01:45:08,151 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 01:45:08,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:45:08,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1334990131, now seen corresponding path program 3 times [2019-12-27 01:45:08,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:45:08,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962496167] [2019-12-27 01:45:08,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:45:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:45:08,680 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 01:45:08,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962496167] [2019-12-27 01:45:08,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:45:08,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 01:45:08,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933679873] [2019-12-27 01:45:08,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 01:45:08,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:45:08,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 01:45:08,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-12-27 01:45:08,683 INFO L87 Difference]: Start difference. First operand 27407 states and 84533 transitions. Second operand 18 states. [2019-12-27 01:45:11,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:45:11,050 INFO L93 Difference]: Finished difference Result 33023 states and 100578 transitions. [2019-12-27 01:45:11,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 01:45:11,051 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2019-12-27 01:45:11,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:45:11,098 INFO L225 Difference]: With dead ends: 33023 [2019-12-27 01:45:11,098 INFO L226 Difference]: Without dead ends: 32791 [2019-12-27 01:45:11,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=202, Invalid=1130, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 01:45:11,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32791 states. [2019-12-27 01:45:11,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32791 to 28193. [2019-12-27 01:45:11,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28193 states. [2019-12-27 01:45:11,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28193 states to 28193 states and 86682 transitions. [2019-12-27 01:45:11,528 INFO L78 Accepts]: Start accepts. Automaton has 28193 states and 86682 transitions. Word has length 66 [2019-12-27 01:45:11,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:45:11,529 INFO L462 AbstractCegarLoop]: Abstraction has 28193 states and 86682 transitions. [2019-12-27 01:45:11,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 01:45:11,529 INFO L276 IsEmpty]: Start isEmpty. Operand 28193 states and 86682 transitions. [2019-12-27 01:45:11,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:45:11,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:45:11,557 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 01:45:11,557 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 01:45:11,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:45:11,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1758572796, now seen corresponding path program 1 times [2019-12-27 01:45:11,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:45:11,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910481598] [2019-12-27 01:45:11,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:45:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:45:11,600 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 01:45:11,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910481598] [2019-12-27 01:45:11,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:45:11,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:45:11,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89181766] [2019-12-27 01:45:11,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:45:11,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:45:11,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:45:11,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:45:11,602 INFO L87 Difference]: Start difference. First operand 28193 states and 86682 transitions. Second operand 3 states. [2019-12-27 01:45:11,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:45:11,720 INFO L93 Difference]: Finished difference Result 31231 states and 91634 transitions. [2019-12-27 01:45:11,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:45:11,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 01:45:11,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:45:11,758 INFO L225 Difference]: With dead ends: 31231 [2019-12-27 01:45:11,759 INFO L226 Difference]: Without dead ends: 30384 [2019-12-27 01:45:11,759 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 01:45:11,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30384 states. [2019-12-27 01:45:12,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30384 to 24683. [2019-12-27 01:45:12,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24683 states. [2019-12-27 01:45:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24683 states to 24683 states and 72960 transitions. [2019-12-27 01:45:12,175 INFO L78 Accepts]: Start accepts. Automaton has 24683 states and 72960 transitions. Word has length 66 [2019-12-27 01:45:12,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:45:12,175 INFO L462 AbstractCegarLoop]: Abstraction has 24683 states and 72960 transitions. [2019-12-27 01:45:12,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:45:12,176 INFO L276 IsEmpty]: Start isEmpty. Operand 24683 states and 72960 transitions. [2019-12-27 01:45:12,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:45:12,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:45:12,206 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 01:45:12,206 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 01:45:12,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:45:12,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1530177947, now seen corresponding path program 4 times [2019-12-27 01:45:12,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:45:12,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861512160] [2019-12-27 01:45:12,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:45:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:45:13,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:45:13,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861512160] [2019-12-27 01:45:13,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:45:13,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 01:45:13,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612151569] [2019-12-27 01:45:13,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 01:45:13,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:45:13,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 01:45:13,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-27 01:45:13,013 INFO L87 Difference]: Start difference. First operand 24683 states and 72960 transitions. Second operand 16 states. [2019-12-27 01:45:17,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:45:17,750 INFO L93 Difference]: Finished difference Result 53740 states and 156384 transitions. [2019-12-27 01:45:17,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-27 01:45:17,751 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 01:45:17,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:45:17,804 INFO L225 Difference]: With dead ends: 53740 [2019-12-27 01:45:17,804 INFO L226 Difference]: Without dead ends: 42491 [2019-12-27 01:45:17,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=607, Invalid=2933, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 01:45:17,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42491 states. [2019-12-27 01:45:18,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42491 to 23068. [2019-12-27 01:45:18,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23068 states. [2019-12-27 01:45:18,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23068 states to 23068 states and 68173 transitions. [2019-12-27 01:45:18,250 INFO L78 Accepts]: Start accepts. Automaton has 23068 states and 68173 transitions. Word has length 66 [2019-12-27 01:45:18,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:45:18,250 INFO L462 AbstractCegarLoop]: Abstraction has 23068 states and 68173 transitions. [2019-12-27 01:45:18,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 01:45:18,250 INFO L276 IsEmpty]: Start isEmpty. Operand 23068 states and 68173 transitions. [2019-12-27 01:45:18,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:45:18,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:45:18,272 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 01:45:18,272 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 01:45:18,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:45:18,272 INFO L82 PathProgramCache]: Analyzing trace with hash 38318619, now seen corresponding path program 5 times [2019-12-27 01:45:18,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:45:18,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448929667] [2019-12-27 01:45:18,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:45:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:45:19,072 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 01:45:19,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448929667] [2019-12-27 01:45:19,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:45:19,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-27 01:45:19,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246438002] [2019-12-27 01:45:19,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 01:45:19,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:45:19,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 01:45:19,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2019-12-27 01:45:19,074 INFO L87 Difference]: Start difference. First operand 23068 states and 68173 transitions. Second operand 23 states. [2019-12-27 01:45:28,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:45:28,192 INFO L93 Difference]: Finished difference Result 26823 states and 78304 transitions. [2019-12-27 01:45:28,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-12-27 01:45:28,192 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2019-12-27 01:45:28,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:45:28,224 INFO L225 Difference]: With dead ends: 26823 [2019-12-27 01:45:28,225 INFO L226 Difference]: Without dead ends: 24644 [2019-12-27 01:45:28,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2088 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=790, Invalid=6866, Unknown=0, NotChecked=0, Total=7656 [2019-12-27 01:45:28,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24644 states. [2019-12-27 01:45:28,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24644 to 22584. [2019-12-27 01:45:28,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22584 states. [2019-12-27 01:45:28,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22584 states to 22584 states and 66631 transitions. [2019-12-27 01:45:28,564 INFO L78 Accepts]: Start accepts. Automaton has 22584 states and 66631 transitions. Word has length 66 [2019-12-27 01:45:28,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:45:28,564 INFO L462 AbstractCegarLoop]: Abstraction has 22584 states and 66631 transitions. [2019-12-27 01:45:28,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 01:45:28,564 INFO L276 IsEmpty]: Start isEmpty. Operand 22584 states and 66631 transitions. [2019-12-27 01:45:28,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:45:28,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:45:28,585 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 01:45:28,585 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 01:45:28,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:45:28,585 INFO L82 PathProgramCache]: Analyzing trace with hash -2130252501, now seen corresponding path program 6 times [2019-12-27 01:45:28,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:45:28,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972305718] [2019-12-27 01:45:28,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:45:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:45:28,771 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 01:45:28,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972305718] [2019-12-27 01:45:28,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:45:28,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:45:28,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591624333] [2019-12-27 01:45:28,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:45:28,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:45:28,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:45:28,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:45:28,773 INFO L87 Difference]: Start difference. First operand 22584 states and 66631 transitions. Second operand 11 states. [2019-12-27 01:45:29,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:45:29,844 INFO L93 Difference]: Finished difference Result 38177 states and 112732 transitions. [2019-12-27 01:45:29,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 01:45:29,844 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 01:45:29,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:45:29,885 INFO L225 Difference]: With dead ends: 38177 [2019-12-27 01:45:29,886 INFO L226 Difference]: Without dead ends: 31749 [2019-12-27 01:45:29,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-27 01:45:29,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31749 states. [2019-12-27 01:45:30,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31749 to 18022. [2019-12-27 01:45:30,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18022 states. [2019-12-27 01:45:30,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18022 states to 18022 states and 53455 transitions. [2019-12-27 01:45:30,499 INFO L78 Accepts]: Start accepts. Automaton has 18022 states and 53455 transitions. Word has length 66 [2019-12-27 01:45:30,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:45:30,499 INFO L462 AbstractCegarLoop]: Abstraction has 18022 states and 53455 transitions. [2019-12-27 01:45:30,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:45:30,499 INFO L276 IsEmpty]: Start isEmpty. Operand 18022 states and 53455 transitions. [2019-12-27 01:45:30,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:45:30,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:45:30,518 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 01:45:30,518 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 01:45:30,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:45:30,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1173514763, now seen corresponding path program 7 times [2019-12-27 01:45:30,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:45:30,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168544746] [2019-12-27 01:45:30,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:45:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:45:31,028 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 01:45:31,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168544746] [2019-12-27 01:45:31,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:45:31,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 01:45:31,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326677633] [2019-12-27 01:45:31,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 01:45:31,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:45:31,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 01:45:31,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-27 01:45:31,030 INFO L87 Difference]: Start difference. First operand 18022 states and 53455 transitions. Second operand 17 states. [2019-12-27 01:45:33,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:45:33,800 INFO L93 Difference]: Finished difference Result 23982 states and 69974 transitions. [2019-12-27 01:45:33,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 01:45:33,800 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-27 01:45:33,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:45:33,830 INFO L225 Difference]: With dead ends: 23982 [2019-12-27 01:45:33,831 INFO L226 Difference]: Without dead ends: 23631 [2019-12-27 01:45:33,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=331, Invalid=1475, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 01:45:33,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23631 states. [2019-12-27 01:45:34,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23631 to 18016. [2019-12-27 01:45:34,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18016 states. [2019-12-27 01:45:34,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18016 states to 18016 states and 53461 transitions. [2019-12-27 01:45:34,110 INFO L78 Accepts]: Start accepts. Automaton has 18016 states and 53461 transitions. Word has length 66 [2019-12-27 01:45:34,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:45:34,110 INFO L462 AbstractCegarLoop]: Abstraction has 18016 states and 53461 transitions. [2019-12-27 01:45:34,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 01:45:34,111 INFO L276 IsEmpty]: Start isEmpty. Operand 18016 states and 53461 transitions. [2019-12-27 01:45:34,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:45:34,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:45:34,128 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 01:45:34,128 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 01:45:34,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:45:34,129 INFO L82 PathProgramCache]: Analyzing trace with hash 478387931, now seen corresponding path program 8 times [2019-12-27 01:45:34,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:45:34,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599516784] [2019-12-27 01:45:34,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:45:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:45:34,302 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 01:45:34,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599516784] [2019-12-27 01:45:34,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:45:34,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:45:34,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883767082] [2019-12-27 01:45:34,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:45:34,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:45:34,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:45:34,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:45:34,303 INFO L87 Difference]: Start difference. First operand 18016 states and 53461 transitions. Second operand 11 states. [2019-12-27 01:45:35,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:45:35,337 INFO L93 Difference]: Finished difference Result 20989 states and 61540 transitions. [2019-12-27 01:45:35,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 01:45:35,337 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 01:45:35,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:45:35,378 INFO L225 Difference]: With dead ends: 20989 [2019-12-27 01:45:35,378 INFO L226 Difference]: Without dead ends: 20220 [2019-12-27 01:45:35,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-12-27 01:45:35,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20220 states. [2019-12-27 01:45:35,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20220 to 17646. [2019-12-27 01:45:35,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17646 states. [2019-12-27 01:45:35,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17646 states to 17646 states and 52445 transitions. [2019-12-27 01:45:35,705 INFO L78 Accepts]: Start accepts. Automaton has 17646 states and 52445 transitions. Word has length 66 [2019-12-27 01:45:35,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:45:35,706 INFO L462 AbstractCegarLoop]: Abstraction has 17646 states and 52445 transitions. [2019-12-27 01:45:35,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:45:35,706 INFO L276 IsEmpty]: Start isEmpty. Operand 17646 states and 52445 transitions. [2019-12-27 01:45:35,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:45:35,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:45:35,722 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 01:45:35,722 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 01:45:35,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:45:35,723 INFO L82 PathProgramCache]: Analyzing trace with hash -2033523235, now seen corresponding path program 9 times [2019-12-27 01:45:35,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:45:35,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859047454] [2019-12-27 01:45:35,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:45:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:45:35,884 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 01:45:35,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859047454] [2019-12-27 01:45:35,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:45:35,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:45:35,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071035351] [2019-12-27 01:45:35,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:45:35,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:45:35,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:45:35,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:45:35,887 INFO L87 Difference]: Start difference. First operand 17646 states and 52445 transitions. Second operand 11 states. [2019-12-27 01:45:37,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:45:37,103 INFO L93 Difference]: Finished difference Result 21670 states and 63822 transitions. [2019-12-27 01:45:37,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 01:45:37,104 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 01:45:37,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:45:37,132 INFO L225 Difference]: With dead ends: 21670 [2019-12-27 01:45:37,133 INFO L226 Difference]: Without dead ends: 21447 [2019-12-27 01:45:37,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-12-27 01:45:37,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21447 states. [2019-12-27 01:45:37,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21447 to 17462. [2019-12-27 01:45:37,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17462 states. [2019-12-27 01:45:37,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17462 states to 17462 states and 51967 transitions. [2019-12-27 01:45:37,650 INFO L78 Accepts]: Start accepts. Automaton has 17462 states and 51967 transitions. Word has length 66 [2019-12-27 01:45:37,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:45:37,650 INFO L462 AbstractCegarLoop]: Abstraction has 17462 states and 51967 transitions. [2019-12-27 01:45:37,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:45:37,650 INFO L276 IsEmpty]: Start isEmpty. Operand 17462 states and 51967 transitions. [2019-12-27 01:45:37,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:45:37,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:45:37,667 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 01:45:37,667 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 01:45:37,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:45:37,667 INFO L82 PathProgramCache]: Analyzing trace with hash 620198601, now seen corresponding path program 10 times [2019-12-27 01:45:37,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:45:37,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474626402] [2019-12-27 01:45:37,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:45:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:45:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:45:37,792 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:45:37,792 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:45:37,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t509~0.base_22|) 0) (= v_~z$w_buff0_used~0_749 0) (= v_~weak$$choice2~0_132 0) (= 0 v_~weak$$choice0~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_ULTIMATE.start_main_~#t509~0.offset_16| 0) (= |v_#NULL.offset_6| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t509~0.base_22| 1) |v_#valid_69|) (= 0 v_~z$r_buff0_thd3~0_377) (= v_~__unbuffered_cnt~0_128 0) (= v_~z$r_buff0_thd1~0_378 0) (= v_~z$mem_tmp~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff0_thd0~0_195 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t509~0.base_22| 4)) (= v_~y~0_28 0) (= v_~z$w_buff1_used~0_500 0) (= 0 |v_#NULL.base_6|) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~z$flush_delayed~0_43) (= v_~z$read_delayed~0_7 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t509~0.base_22|) (= v_~z$r_buff0_thd2~0_182 0) (= 0 v_~z$r_buff1_thd3~0_396) (= 0 v_~x~0_245) (= v_~z$r_buff1_thd1~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_35) (= v_~z$r_buff1_thd0~0_294 0) (= v_~z$w_buff0~0_256 0) (= v_~main$tmp_guard0~0_22 0) (= v_~__unbuffered_p2_EBX~0_48 0) (= 0 v_~__unbuffered_p1_EAX~0_41) (= v_~z$r_buff1_thd2~0_280 0) (= v_~z$w_buff1~0_199 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t509~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t509~0.base_22|) |v_ULTIMATE.start_main_~#t509~0.offset_16| 0)) |v_#memory_int_19|) (= v_~z~0_182 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_280, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_63|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_113|, ULTIMATE.start_main_~#t509~0.base=|v_ULTIMATE.start_main_~#t509~0.base_22|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_223|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_72|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_195, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, ULTIMATE.start_main_~#t511~0.offset=|v_ULTIMATE.start_main_~#t511~0.offset_14|, ULTIMATE.start_main_~#t509~0.offset=|v_ULTIMATE.start_main_~#t509~0.offset_16|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_48, ULTIMATE.start_main_~#t510~0.offset=|v_ULTIMATE.start_main_~#t510~0.offset_14|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ULTIMATE.start_main_~#t510~0.base=|v_ULTIMATE.start_main_~#t510~0.base_19|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_500, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t511~0.base=|v_ULTIMATE.start_main_~#t511~0.base_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_267, ~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_377, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, ~x~0=v_~x~0_245, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_45|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_294, ~y~0=v_~y~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_182, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_749, ~z$w_buff0~0=v_~z$w_buff0~0_256, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_396, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_182, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_378} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t509~0.base, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t511~0.offset, ULTIMATE.start_main_~#t509~0.offset, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t510~0.offset, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t510~0.base, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t511~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:45:37,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_29 v_~z$r_buff1_thd1~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~z$r_buff0_thd2~0_25 v_~z$r_buff1_thd2~0_17) (= v_~x~0_11 1) (= v_~z$r_buff0_thd3~0_70 v_~z$r_buff1_thd3~0_54) (= v_~z$r_buff0_thd1~0_28 1) (= v_~z$r_buff0_thd0~0_26 v_~z$r_buff1_thd0~0_23)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28, ~x~0=v_~x~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 01:45:37,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L825-1-->L827: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t510~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t510~0.base_11|)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t510~0.base_11| 1) |v_#valid_31|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t510~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t510~0.base_11|) |v_ULTIMATE.start_main_~#t510~0.offset_10| 1)) |v_#memory_int_13|) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t510~0.base_11|) 0) (= 0 |v_ULTIMATE.start_main_~#t510~0.offset_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t510~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t510~0.offset=|v_ULTIMATE.start_main_~#t510~0.offset_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t510~0.base=|v_ULTIMATE.start_main_~#t510~0.base_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t510~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t510~0.base, #length] because there is no mapped edge [2019-12-27 01:45:37,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L827-1-->L829: Formula: (and (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t511~0.base_12| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t511~0.base_12| 4)) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t511~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t511~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t511~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t511~0.base_12|) |v_ULTIMATE.start_main_~#t511~0.offset_10| 2)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t511~0.offset_10| 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t511~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t511~0.base=|v_ULTIMATE.start_main_~#t511~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t511~0.offset=|v_ULTIMATE.start_main_~#t511~0.offset_10|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t511~0.base, ULTIMATE.start_main_~#t511~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 01:45:37,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1283311362 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-1283311362 256) 0)) (.cse1 (= |P1Thread1of1ForFork2_#t~ite10_Out-1283311362| |P1Thread1of1ForFork2_#t~ite9_Out-1283311362|))) (or (and (= ~z$w_buff1~0_In-1283311362 |P1Thread1of1ForFork2_#t~ite9_Out-1283311362|) (not .cse0) .cse1 (not .cse2)) (and (or .cse2 .cse0) (= ~z~0_In-1283311362 |P1Thread1of1ForFork2_#t~ite9_Out-1283311362|) .cse1))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1283311362, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1283311362, ~z$w_buff1~0=~z$w_buff1~0_In-1283311362, ~z~0=~z~0_In-1283311362} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1283311362|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1283311362, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-1283311362|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1283311362, ~z$w_buff1~0=~z$w_buff1~0_In-1283311362, ~z~0=~z~0_In-1283311362} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 01:45:37,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L792-->L792-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-997232709 256)))) (or (and .cse0 (= ~z$w_buff1~0_In-997232709 |P2Thread1of1ForFork0_#t~ite23_Out-997232709|) (= |P2Thread1of1ForFork0_#t~ite24_Out-997232709| |P2Thread1of1ForFork0_#t~ite23_Out-997232709|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-997232709 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-997232709 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In-997232709 256)) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In-997232709 256)) .cse1)))) (and (= |P2Thread1of1ForFork0_#t~ite24_Out-997232709| ~z$w_buff1~0_In-997232709) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite23_In-997232709| |P2Thread1of1ForFork0_#t~ite23_Out-997232709|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-997232709, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-997232709, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-997232709|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-997232709, ~z$w_buff1~0=~z$w_buff1~0_In-997232709, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-997232709, ~weak$$choice2~0=~weak$$choice2~0_In-997232709} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-997232709, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-997232709|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-997232709, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-997232709|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-997232709, ~z$w_buff1~0=~z$w_buff1~0_In-997232709, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-997232709, ~weak$$choice2~0=~weak$$choice2~0_In-997232709} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 01:45:37,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L794-->L794-8: Formula: (let ((.cse5 (= |P2Thread1of1ForFork0_#t~ite30_Out1214501689| |P2Thread1of1ForFork0_#t~ite29_Out1214501689|)) (.cse4 (= (mod ~weak$$choice2~0_In1214501689 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd3~0_In1214501689 256) 0)) (.cse6 (= 0 (mod ~z$r_buff0_thd3~0_In1214501689 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1214501689 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1214501689 256) 0))) (or (let ((.cse1 (not .cse6))) (and (or (not .cse0) .cse1) (not .cse2) (or .cse1 (not .cse3)) .cse4 .cse5 (= |P2Thread1of1ForFork0_#t~ite28_Out1214501689| |P2Thread1of1ForFork0_#t~ite29_Out1214501689|) (= |P2Thread1of1ForFork0_#t~ite28_Out1214501689| 0))) (and (or (and (= ~z$w_buff1_used~0_In1214501689 |P2Thread1of1ForFork0_#t~ite30_Out1214501689|) (not .cse4) (= |P2Thread1of1ForFork0_#t~ite29_In1214501689| |P2Thread1of1ForFork0_#t~ite29_Out1214501689|)) (and (= ~z$w_buff1_used~0_In1214501689 |P2Thread1of1ForFork0_#t~ite29_Out1214501689|) .cse5 .cse4 (or (and .cse6 .cse3) (and .cse6 .cse0) .cse2))) (= |P2Thread1of1ForFork0_#t~ite28_In1214501689| |P2Thread1of1ForFork0_#t~ite28_Out1214501689|)))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In1214501689|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1214501689, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1214501689, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1214501689, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1214501689, ~weak$$choice2~0=~weak$$choice2~0_In1214501689, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In1214501689|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1214501689|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1214501689, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1214501689, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1214501689, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1214501689, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1214501689|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out1214501689|, ~weak$$choice2~0=~weak$$choice2~0_In1214501689} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 01:45:37,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L794-8-->L796: Formula: (and (= v_~z$r_buff0_thd3~0_371 v_~z$r_buff0_thd3~0_370) (= v_~z$w_buff1_used~0_493 |v_P2Thread1of1ForFork0_#t~ite30_38|) (not (= (mod v_~weak$$choice2~0_130 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_371, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_38|, ~weak$$choice2~0=v_~weak$$choice2~0_130} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_39|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_15|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_31|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_493, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_370, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_23|, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_37|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_49|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 01:45:37,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_46 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{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_46} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 01:45:37,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite39_Out880472357| |P2Thread1of1ForFork0_#t~ite38_Out880472357|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In880472357 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In880472357 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out880472357| ~z~0_In880472357) .cse0 (or .cse1 .cse2)) (and .cse0 (not .cse1) (not .cse2) (= ~z$w_buff1~0_In880472357 |P2Thread1of1ForFork0_#t~ite38_Out880472357|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In880472357, ~z$w_buff1_used~0=~z$w_buff1_used~0_In880472357, ~z$w_buff1~0=~z$w_buff1~0_In880472357, ~z~0=~z~0_In880472357} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out880472357|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out880472357|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In880472357, ~z$w_buff1_used~0=~z$w_buff1_used~0_In880472357, ~z$w_buff1~0=~z$w_buff1~0_In880472357, ~z~0=~z~0_In880472357} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 01:45:37,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1993327075 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1993327075 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1993327075 |P2Thread1of1ForFork0_#t~ite40_Out-1993327075|)) (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-1993327075|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1993327075, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1993327075} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1993327075, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1993327075|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1993327075} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 01:45:37,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In2082691407 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In2082691407 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In2082691407 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2082691407 256)))) (or (and (= ~z$w_buff1_used~0_In2082691407 |P2Thread1of1ForFork0_#t~ite41_Out2082691407|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out2082691407|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2082691407, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2082691407, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2082691407, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2082691407} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2082691407, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2082691407, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2082691407, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2082691407, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out2082691407|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 01:45:37,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1119153796 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1119153796 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-1119153796|)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_In-1119153796 |P2Thread1of1ForFork0_#t~ite42_Out-1119153796|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1119153796, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1119153796} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1119153796, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1119153796, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1119153796|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 01:45:37,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1097233911 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1097233911 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1097233911 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-1097233911 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out-1097233911| 0)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out-1097233911| ~z$r_buff1_thd3~0_In-1097233911) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1097233911, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1097233911, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1097233911, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1097233911} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1097233911|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1097233911, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1097233911, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1097233911, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1097233911} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 01:45:37,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_100 1) v_~__unbuffered_cnt~0_99) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_308 |v_P2Thread1of1ForFork0_#t~ite43_56|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_55|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_308, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 01:45:37,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-330615087 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-330615087 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-330615087|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-330615087 |P0Thread1of1ForFork1_#t~ite5_Out-330615087|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-330615087, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-330615087} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-330615087|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-330615087, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-330615087} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 01:45:37,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-1240031380 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1240031380 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1240031380 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In-1240031380 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1240031380|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-1240031380 |P0Thread1of1ForFork1_#t~ite6_Out-1240031380|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1240031380, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1240031380, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1240031380, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1240031380} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1240031380, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1240031380|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1240031380, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1240031380, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1240031380} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 01:45:37,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1229943956 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1229943956 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In-1229943956 ~z$r_buff0_thd1~0_Out-1229943956)) (and (not .cse1) (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out-1229943956)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1229943956, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1229943956} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1229943956, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1229943956|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1229943956} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:45:37,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-847626672 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-847626672 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-847626672 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-847626672 256)))) (or (and (= ~z$r_buff1_thd1~0_In-847626672 |P0Thread1of1ForFork1_#t~ite8_Out-847626672|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-847626672|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-847626672, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-847626672, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-847626672, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-847626672} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-847626672|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-847626672, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-847626672, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-847626672, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-847626672} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 01:45:37,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L750-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_83 |v_P0Thread1of1ForFork1_#t~ite8_40|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_39|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 01:45:37,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-1966157654 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1966157654 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out-1966157654| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out-1966157654| ~z$w_buff0_used~0_In-1966157654)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1966157654, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1966157654} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1966157654, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1966157654|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1966157654} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 01:45:37,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In2033260349 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In2033260349 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In2033260349 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In2033260349 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out2033260349|)) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In2033260349 |P1Thread1of1ForFork2_#t~ite12_Out2033260349|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2033260349, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2033260349, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2033260349, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2033260349} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2033260349, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2033260349, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2033260349, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out2033260349|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2033260349} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 01:45:37,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1820522768 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1820522768 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In-1820522768 |P1Thread1of1ForFork2_#t~ite13_Out-1820522768|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-1820522768|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1820522768, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1820522768} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1820522768, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1820522768|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1820522768} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 01:45:37,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In640571764 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In640571764 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In640571764 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In640571764 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out640571764|)) (and (= ~z$r_buff1_thd2~0_In640571764 |P1Thread1of1ForFork2_#t~ite14_Out640571764|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In640571764, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In640571764, ~z$w_buff1_used~0=~z$w_buff1_used~0_In640571764, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In640571764} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In640571764, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In640571764, ~z$w_buff1_used~0=~z$w_buff1_used~0_In640571764, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out640571764|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In640571764} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 01:45:37,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= v_~z$r_buff1_thd2~0_188 |v_P1Thread1of1ForFork2_#t~ite14_50|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_188, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 01:45:37,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: 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 01:45:37,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1982782394 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1982782394 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In1982782394 |ULTIMATE.start_main_#t~ite47_Out1982782394|)) (and (not .cse1) (= ~z$w_buff1~0_In1982782394 |ULTIMATE.start_main_#t~ite47_Out1982782394|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1982782394, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1982782394, ~z$w_buff1~0=~z$w_buff1~0_In1982782394, ~z~0=~z~0_In1982782394} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1982782394, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1982782394|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1982782394, ~z$w_buff1~0=~z$w_buff1~0_In1982782394, ~z~0=~z~0_In1982782394} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 01:45:37,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_40 |v_ULTIMATE.start_main_#t~ite47_9|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-27 01:45:37,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-441248079 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-441248079 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out-441248079|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-441248079 |ULTIMATE.start_main_#t~ite49_Out-441248079|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-441248079, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-441248079} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-441248079, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-441248079, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-441248079|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 01:45:37,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In-759429261 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-759429261 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-759429261 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-759429261 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-759429261| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite50_Out-759429261| ~z$w_buff1_used~0_In-759429261) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-759429261, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-759429261, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-759429261, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-759429261} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-759429261|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-759429261, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-759429261, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-759429261, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-759429261} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 01:45:37,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In664974127 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In664974127 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In664974127 |ULTIMATE.start_main_#t~ite51_Out664974127|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out664974127|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In664974127, ~z$w_buff0_used~0=~z$w_buff0_used~0_In664974127} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In664974127, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out664974127|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In664974127} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 01:45:37,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In966315907 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In966315907 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In966315907 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In966315907 256) 0))) (or (and (= ~z$r_buff1_thd0~0_In966315907 |ULTIMATE.start_main_#t~ite52_Out966315907|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite52_Out966315907|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In966315907, ~z$w_buff0_used~0=~z$w_buff0_used~0_In966315907, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In966315907, ~z$w_buff1_used~0=~z$w_buff1_used~0_In966315907} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out966315907|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In966315907, ~z$w_buff0_used~0=~z$w_buff0_used~0_In966315907, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In966315907, ~z$w_buff1_used~0=~z$w_buff1_used~0_In966315907} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 01:45:37,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z$r_buff1_thd0~0_221 |v_ULTIMATE.start_main_#t~ite52_38|) (= 0 v_~__unbuffered_p1_EAX~0_22) (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~__unbuffered_p2_EBX~0_34 0) (= 2 v_~x~0_186)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_186} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_186, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} 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 01:45:37,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:45:37 BasicIcfg [2019-12-27 01:45:37,934 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:45:37,939 INFO L168 Benchmark]: Toolchain (without parser) took 125795.98 ms. Allocated memory was 137.4 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.4 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 01:45:37,940 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 01:45:37,940 INFO L168 Benchmark]: CACSL2BoogieTranslator took 799.29 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 100.2 MB in the beginning and 155.6 MB in the end (delta: -55.3 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-12-27 01:45:37,941 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.83 ms. Allocated memory is still 202.4 MB. Free memory was 155.6 MB in the beginning and 152.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 01:45:37,941 INFO L168 Benchmark]: Boogie Preprocessor took 39.40 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.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 01:45:37,941 INFO L168 Benchmark]: RCFGBuilder took 870.80 ms. Allocated memory is still 202.4 MB. Free memory was 150.8 MB in the beginning and 100.0 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. [2019-12-27 01:45:37,947 INFO L168 Benchmark]: TraceAbstraction took 123998.98 ms. Allocated memory was 202.4 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.0 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 01:45:37,949 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.23 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 799.29 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 100.2 MB in the beginning and 155.6 MB in the end (delta: -55.3 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.83 ms. Allocated memory is still 202.4 MB. Free memory was 155.6 MB in the beginning and 152.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.40 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 870.80 ms. Allocated memory is still 202.4 MB. Free memory was 150.8 MB in the beginning and 100.0 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 123998.98 ms. Allocated memory was 202.4 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.0 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7044 VarBasedMoverChecksPositive, 336 VarBasedMoverChecksNegative, 168 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 130103 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t509, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L827] FCALL, FORK 0 pthread_create(&t510, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L760] 2 x = 2 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, 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] [L829] FCALL, FORK 0 pthread_create(&t511, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, 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] [L780] 3 y = 1 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=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] [L790] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=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] [L790] 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) [L766] 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) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 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)) [L792] 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)) [L793] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 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)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 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)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=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] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=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] [L802] 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) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 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 [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, 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] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 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 [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 123.6s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 49.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7817 SDtfs, 9839 SDslu, 31896 SDs, 0 SdLazy, 27045 SolverSat, 485 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 524 GetRequests, 41 SyntacticMatches, 25 SemanticMatches, 458 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4722 ImplicationChecksByTransitivity, 10.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156115occurred 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: 38.7s AutomataMinimizationTime, 32 MinimizatonAttempts, 260302 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 1490 NumberOfCodeBlocks, 1490 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1392 ConstructedInterpolants, 0 QuantifiedInterpolants, 374907 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...