/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:27:28,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:27:28,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:27:28,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:27:28,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:27:28,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:27:28,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:27:28,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:27:28,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:27:28,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:27:28,867 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:27:28,868 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:27:28,869 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:27:28,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:27:28,873 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:27:28,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:27:28,876 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:27:28,878 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:27:28,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:27:28,886 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:27:28,891 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:27:28,895 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:27:28,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:27:28,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:27:28,899 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:27:28,899 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:27:28,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:27:28,901 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:27:28,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:27:28,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:27:28,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:27:28,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:27:28,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:27:28,907 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:27:28,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:27:28,908 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:27:28,909 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:27:28,909 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:27:28,910 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:27:28,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:27:28,912 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:27:28,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-VariableLbe.epf [2019-12-27 07:27:28,945 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:27:28,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:27:28,950 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:27:28,950 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:27:28,951 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:27:28,951 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:27:28,951 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:27:28,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:27:28,951 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:27:28,952 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:27:28,954 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:27:28,954 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:27:28,954 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:27:28,954 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:27:28,955 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:27:28,955 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:27:28,955 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:27:28,955 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:27:28,955 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:27:28,956 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:27:28,956 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:27:28,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:27:28,956 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:27:28,956 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:27:28,957 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:27:28,958 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:27:28,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:27:28,959 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:27:28,959 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:27:28,959 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:27:29,267 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:27:29,287 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:27:29,291 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:27:29,293 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:27:29,293 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:27:29,294 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt.i [2019-12-27 07:27:29,366 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/083c54c8f/6e250a9a2dcc4c11a38cd8133f9e4db4/FLAGfec7e1964 [2019-12-27 07:27:29,968 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:27:29,969 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.opt.i [2019-12-27 07:27:29,984 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/083c54c8f/6e250a9a2dcc4c11a38cd8133f9e4db4/FLAGfec7e1964 [2019-12-27 07:27:30,205 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/083c54c8f/6e250a9a2dcc4c11a38cd8133f9e4db4 [2019-12-27 07:27:30,216 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:27:30,218 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:27:30,222 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:27:30,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:27:30,226 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:27:30,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:27:30" (1/1) ... [2019-12-27 07:27:30,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ede1650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:27:30, skipping insertion in model container [2019-12-27 07:27:30,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:27:30" (1/1) ... [2019-12-27 07:27:30,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:27:30,294 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:27:30,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:27:30,911 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:27:30,975 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:27:31,057 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:27:31,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:27:31 WrapperNode [2019-12-27 07:27:31,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:27:31,059 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:27:31,059 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:27:31,059 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:27:31,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:27:31" (1/1) ... [2019-12-27 07:27:31,090 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:27:31" (1/1) ... [2019-12-27 07:27:31,131 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:27:31,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:27:31,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:27:31,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:27:31,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:27:31" (1/1) ... [2019-12-27 07:27:31,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:27:31" (1/1) ... [2019-12-27 07:27:31,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:27:31" (1/1) ... [2019-12-27 07:27:31,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:27:31" (1/1) ... [2019-12-27 07:27:31,164 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:27:31" (1/1) ... [2019-12-27 07:27:31,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:27:31" (1/1) ... [2019-12-27 07:27:31,172 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:27:31" (1/1) ... [2019-12-27 07:27:31,192 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:27:31,193 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:27:31,193 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:27:31,193 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:27:31,194 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:27:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:27:31,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:27:31,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:27:31,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:27:31,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:27:31,271 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:27:31,272 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:27:31,272 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:27:31,273 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:27:31,273 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 07:27:31,274 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 07:27:31,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:27:31,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:27:31,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:27:31,277 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 07:27:32,161 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:27:32,161 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:27:32,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:27:32 BoogieIcfgContainer [2019-12-27 07:27:32,163 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:27:32,164 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:27:32,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:27:32,167 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:27:32,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:27:30" (1/3) ... [2019-12-27 07:27:32,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe8ae4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:27:32, skipping insertion in model container [2019-12-27 07:27:32,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:27:31" (2/3) ... [2019-12-27 07:27:32,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe8ae4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:27:32, skipping insertion in model container [2019-12-27 07:27:32,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:27:32" (3/3) ... [2019-12-27 07:27:32,172 INFO L109 eAbstractionObserver]: Analyzing ICFG safe004_power.opt.i [2019-12-27 07:27:32,182 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:27:32,182 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:27:32,190 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:27:32,191 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:27:32,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,247 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,249 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,257 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,257 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,257 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,258 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,258 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,266 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,267 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,277 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,277 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,280 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,281 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,281 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,285 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,286 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:27:32,301 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 07:27:32,321 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:27:32,322 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:27:32,322 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:27:32,322 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:27:32,322 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:27:32,322 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:27:32,322 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:27:32,322 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:27:32,338 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 07:27:32,340 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 07:27:32,445 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 07:27:32,445 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:27:32,462 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:27:32,488 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 07:27:32,544 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 07:27:32,544 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:27:32,552 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:27:32,572 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-27 07:27:32,573 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:27:35,931 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 07:27:36,063 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 07:27:36,091 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82010 [2019-12-27 07:27:36,091 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-27 07:27:36,095 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 109 transitions [2019-12-27 07:27:55,820 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 117808 states. [2019-12-27 07:27:55,823 INFO L276 IsEmpty]: Start isEmpty. Operand 117808 states. [2019-12-27 07:27:55,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 07:27:55,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:27:55,830 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 07:27:55,830 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:27:55,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:27:55,835 INFO L82 PathProgramCache]: Analyzing trace with hash 806008766, now seen corresponding path program 1 times [2019-12-27 07:27:55,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:27:55,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304143118] [2019-12-27 07:27:55,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:27:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:27:56,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:27:56,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304143118] [2019-12-27 07:27:56,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:27:56,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:27:56,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099149628] [2019-12-27 07:27:56,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:27:56,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:27:56,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:27:56,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:27:56,184 INFO L87 Difference]: Start difference. First operand 117808 states. Second operand 3 states. [2019-12-27 07:27:57,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:27:57,769 INFO L93 Difference]: Finished difference Result 117244 states and 506404 transitions. [2019-12-27 07:27:57,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:27:57,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 07:27:57,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:28:01,678 INFO L225 Difference]: With dead ends: 117244 [2019-12-27 07:28:01,678 INFO L226 Difference]: Without dead ends: 114878 [2019-12-27 07:28:01,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:28:05,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114878 states. [2019-12-27 07:28:08,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114878 to 114878. [2019-12-27 07:28:08,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114878 states. [2019-12-27 07:28:11,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114878 states to 114878 states and 496758 transitions. [2019-12-27 07:28:11,930 INFO L78 Accepts]: Start accepts. Automaton has 114878 states and 496758 transitions. Word has length 5 [2019-12-27 07:28:11,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:28:11,931 INFO L462 AbstractCegarLoop]: Abstraction has 114878 states and 496758 transitions. [2019-12-27 07:28:11,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:28:11,931 INFO L276 IsEmpty]: Start isEmpty. Operand 114878 states and 496758 transitions. [2019-12-27 07:28:11,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:28:11,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:28:11,934 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:28:11,934 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:28:11,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:28:11,935 INFO L82 PathProgramCache]: Analyzing trace with hash 702926397, now seen corresponding path program 1 times [2019-12-27 07:28:11,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:28:11,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700267883] [2019-12-27 07:28:11,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:28:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:28:12,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:28:12,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700267883] [2019-12-27 07:28:12,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:28:12,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:28:12,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108016293] [2019-12-27 07:28:12,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:28:12,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:28:12,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:28:12,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:28:12,038 INFO L87 Difference]: Start difference. First operand 114878 states and 496758 transitions. Second operand 4 states. [2019-12-27 07:28:17,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:28:17,345 INFO L93 Difference]: Finished difference Result 184188 states and 760222 transitions. [2019-12-27 07:28:17,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:28:17,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:28:17,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:28:18,007 INFO L225 Difference]: With dead ends: 184188 [2019-12-27 07:28:18,007 INFO L226 Difference]: Without dead ends: 184139 [2019-12-27 07:28:18,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:28:22,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184139 states. [2019-12-27 07:28:26,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184139 to 169203. [2019-12-27 07:28:26,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169203 states. [2019-12-27 07:28:34,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169203 states to 169203 states and 707190 transitions. [2019-12-27 07:28:34,590 INFO L78 Accepts]: Start accepts. Automaton has 169203 states and 707190 transitions. Word has length 11 [2019-12-27 07:28:34,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:28:34,591 INFO L462 AbstractCegarLoop]: Abstraction has 169203 states and 707190 transitions. [2019-12-27 07:28:34,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:28:34,591 INFO L276 IsEmpty]: Start isEmpty. Operand 169203 states and 707190 transitions. [2019-12-27 07:28:34,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:28:34,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:28:34,598 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:28:34,598 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:28:34,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:28:34,599 INFO L82 PathProgramCache]: Analyzing trace with hash 702866747, now seen corresponding path program 1 times [2019-12-27 07:28:34,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:28:34,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57675006] [2019-12-27 07:28:34,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:28:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:28:34,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:28:34,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57675006] [2019-12-27 07:28:34,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:28:34,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:28:34,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822753009] [2019-12-27 07:28:34,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:28:34,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:28:34,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:28:34,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:28:34,709 INFO L87 Difference]: Start difference. First operand 169203 states and 707190 transitions. Second operand 4 states. [2019-12-27 07:28:37,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:28:37,786 INFO L93 Difference]: Finished difference Result 240014 states and 977713 transitions. [2019-12-27 07:28:37,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:28:37,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 07:28:37,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:28:38,543 INFO L225 Difference]: With dead ends: 240014 [2019-12-27 07:28:38,544 INFO L226 Difference]: Without dead ends: 239951 [2019-12-27 07:28:38,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:28:51,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239951 states. [2019-12-27 07:28:54,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239951 to 203645. [2019-12-27 07:28:54,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203645 states. [2019-12-27 07:29:03,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203645 states to 203645 states and 844323 transitions. [2019-12-27 07:29:03,502 INFO L78 Accepts]: Start accepts. Automaton has 203645 states and 844323 transitions. Word has length 13 [2019-12-27 07:29:03,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:29:03,503 INFO L462 AbstractCegarLoop]: Abstraction has 203645 states and 844323 transitions. [2019-12-27 07:29:03,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:29:03,504 INFO L276 IsEmpty]: Start isEmpty. Operand 203645 states and 844323 transitions. [2019-12-27 07:29:03,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:29:03,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:29:03,507 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:29:03,508 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:29:03,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:29:03,508 INFO L82 PathProgramCache]: Analyzing trace with hash 464803757, now seen corresponding path program 1 times [2019-12-27 07:29:03,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:29:03,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628788677] [2019-12-27 07:29:03,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:29:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:29:03,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:29:03,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628788677] [2019-12-27 07:29:03,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:29:03,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:29:03,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038183698] [2019-12-27 07:29:03,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:29:03,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:29:03,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:29:03,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:29:03,576 INFO L87 Difference]: Start difference. First operand 203645 states and 844323 transitions. Second operand 3 states. [2019-12-27 07:29:03,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:29:03,752 INFO L93 Difference]: Finished difference Result 39928 states and 130360 transitions. [2019-12-27 07:29:03,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:29:03,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 07:29:03,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:29:03,845 INFO L225 Difference]: With dead ends: 39928 [2019-12-27 07:29:03,845 INFO L226 Difference]: Without dead ends: 39928 [2019-12-27 07:29:03,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:29:04,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39928 states. [2019-12-27 07:29:04,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39928 to 39928. [2019-12-27 07:29:04,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39928 states. [2019-12-27 07:29:04,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39928 states to 39928 states and 130360 transitions. [2019-12-27 07:29:04,520 INFO L78 Accepts]: Start accepts. Automaton has 39928 states and 130360 transitions. Word has length 13 [2019-12-27 07:29:04,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:29:04,520 INFO L462 AbstractCegarLoop]: Abstraction has 39928 states and 130360 transitions. [2019-12-27 07:29:04,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:29:04,521 INFO L276 IsEmpty]: Start isEmpty. Operand 39928 states and 130360 transitions. [2019-12-27 07:29:04,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 07:29:04,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:29:04,525 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:29:04,525 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:29:04,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:29:04,525 INFO L82 PathProgramCache]: Analyzing trace with hash -2009264966, now seen corresponding path program 1 times [2019-12-27 07:29:04,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:29:04,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967735829] [2019-12-27 07:29:04,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:29:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:29:04,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:29:04,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967735829] [2019-12-27 07:29:04,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:29:04,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:29:04,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174486557] [2019-12-27 07:29:04,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:29:04,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:29:04,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:29:04,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:29:04,640 INFO L87 Difference]: Start difference. First operand 39928 states and 130360 transitions. Second operand 5 states. [2019-12-27 07:29:05,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:29:05,482 INFO L93 Difference]: Finished difference Result 53752 states and 171521 transitions. [2019-12-27 07:29:05,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:29:05,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 07:29:05,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:29:06,812 INFO L225 Difference]: With dead ends: 53752 [2019-12-27 07:29:06,812 INFO L226 Difference]: Without dead ends: 53739 [2019-12-27 07:29:06,812 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 07:29:07,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53739 states. [2019-12-27 07:29:07,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53739 to 40157. [2019-12-27 07:29:07,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40157 states. [2019-12-27 07:29:07,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40157 states to 40157 states and 130977 transitions. [2019-12-27 07:29:07,532 INFO L78 Accepts]: Start accepts. Automaton has 40157 states and 130977 transitions. Word has length 19 [2019-12-27 07:29:07,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:29:07,533 INFO L462 AbstractCegarLoop]: Abstraction has 40157 states and 130977 transitions. [2019-12-27 07:29:07,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:29:07,533 INFO L276 IsEmpty]: Start isEmpty. Operand 40157 states and 130977 transitions. [2019-12-27 07:29:07,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:29:07,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:29:07,544 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:29:07,544 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:29:07,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:29:07,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1059595659, now seen corresponding path program 1 times [2019-12-27 07:29:07,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:29:07,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749635780] [2019-12-27 07:29:07,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:29:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:29:07,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:29:07,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749635780] [2019-12-27 07:29:07,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:29:07,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:29:07,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886527503] [2019-12-27 07:29:07,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:29:07,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:29:07,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:29:07,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:29:07,613 INFO L87 Difference]: Start difference. First operand 40157 states and 130977 transitions. Second operand 4 states. [2019-12-27 07:29:07,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:29:07,652 INFO L93 Difference]: Finished difference Result 7224 states and 19739 transitions. [2019-12-27 07:29:07,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:29:07,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 07:29:07,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:29:07,663 INFO L225 Difference]: With dead ends: 7224 [2019-12-27 07:29:07,663 INFO L226 Difference]: Without dead ends: 7224 [2019-12-27 07:29:07,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:29:07,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states. [2019-12-27 07:29:07,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7224 to 7112. [2019-12-27 07:29:07,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7112 states. [2019-12-27 07:29:07,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7112 states to 7112 states and 19419 transitions. [2019-12-27 07:29:07,760 INFO L78 Accepts]: Start accepts. Automaton has 7112 states and 19419 transitions. Word has length 25 [2019-12-27 07:29:07,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:29:07,761 INFO L462 AbstractCegarLoop]: Abstraction has 7112 states and 19419 transitions. [2019-12-27 07:29:07,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:29:07,761 INFO L276 IsEmpty]: Start isEmpty. Operand 7112 states and 19419 transitions. [2019-12-27 07:29:07,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 07:29:07,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:29:07,772 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] [2019-12-27 07:29:07,772 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:29:07,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:29:07,772 INFO L82 PathProgramCache]: Analyzing trace with hash -81356198, now seen corresponding path program 1 times [2019-12-27 07:29:07,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:29:07,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702589391] [2019-12-27 07:29:07,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:29:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:29:07,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:29:07,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702589391] [2019-12-27 07:29:07,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:29:07,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:29:07,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78057133] [2019-12-27 07:29:07,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:29:07,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:29:07,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:29:07,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:29:07,848 INFO L87 Difference]: Start difference. First operand 7112 states and 19419 transitions. Second operand 5 states. [2019-12-27 07:29:07,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:29:07,883 INFO L93 Difference]: Finished difference Result 5025 states and 14423 transitions. [2019-12-27 07:29:07,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:29:07,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 07:29:07,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:29:07,891 INFO L225 Difference]: With dead ends: 5025 [2019-12-27 07:29:07,891 INFO L226 Difference]: Without dead ends: 5025 [2019-12-27 07:29:07,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:29:07,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5025 states. [2019-12-27 07:29:07,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5025 to 4661. [2019-12-27 07:29:07,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4661 states. [2019-12-27 07:29:07,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4661 states to 4661 states and 13439 transitions. [2019-12-27 07:29:07,961 INFO L78 Accepts]: Start accepts. Automaton has 4661 states and 13439 transitions. Word has length 37 [2019-12-27 07:29:07,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:29:07,962 INFO L462 AbstractCegarLoop]: Abstraction has 4661 states and 13439 transitions. [2019-12-27 07:29:07,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:29:07,962 INFO L276 IsEmpty]: Start isEmpty. Operand 4661 states and 13439 transitions. [2019-12-27 07:29:07,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:29:07,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:29:07,969 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:29:07,969 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:29:07,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:29:07,970 INFO L82 PathProgramCache]: Analyzing trace with hash 2136434843, now seen corresponding path program 1 times [2019-12-27 07:29:07,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:29:07,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818663887] [2019-12-27 07:29:07,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:29:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:29:08,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:29:08,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818663887] [2019-12-27 07:29:08,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:29:08,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:29:08,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084430768] [2019-12-27 07:29:08,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:29:08,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:29:08,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:29:08,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:29:08,042 INFO L87 Difference]: Start difference. First operand 4661 states and 13439 transitions. Second operand 3 states. [2019-12-27 07:29:08,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:29:08,098 INFO L93 Difference]: Finished difference Result 4670 states and 13453 transitions. [2019-12-27 07:29:08,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:29:08,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:29:08,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:29:08,105 INFO L225 Difference]: With dead ends: 4670 [2019-12-27 07:29:08,105 INFO L226 Difference]: Without dead ends: 4670 [2019-12-27 07:29:08,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:29:08,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-27 07:29:08,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-27 07:29:08,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-27 07:29:08,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13449 transitions. [2019-12-27 07:29:08,163 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13449 transitions. Word has length 65 [2019-12-27 07:29:08,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:29:08,163 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13449 transitions. [2019-12-27 07:29:08,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:29:08,164 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13449 transitions. [2019-12-27 07:29:08,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:29:08,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:29:08,170 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:29:08,170 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:29:08,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:29:08,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1287100776, now seen corresponding path program 1 times [2019-12-27 07:29:08,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:29:08,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244826293] [2019-12-27 07:29:08,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:29:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:29:08,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:29:08,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244826293] [2019-12-27 07:29:08,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:29:08,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:29:08,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133397318] [2019-12-27 07:29:08,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:29:08,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:29:08,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:29:08,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:29:08,243 INFO L87 Difference]: Start difference. First operand 4666 states and 13449 transitions. Second operand 3 states. [2019-12-27 07:29:08,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:29:08,296 INFO L93 Difference]: Finished difference Result 4670 states and 13443 transitions. [2019-12-27 07:29:08,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:29:08,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:29:08,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:29:08,303 INFO L225 Difference]: With dead ends: 4670 [2019-12-27 07:29:08,304 INFO L226 Difference]: Without dead ends: 4670 [2019-12-27 07:29:08,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:29:08,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-27 07:29:08,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-27 07:29:08,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-27 07:29:08,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13439 transitions. [2019-12-27 07:29:08,390 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13439 transitions. Word has length 65 [2019-12-27 07:29:08,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:29:08,390 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13439 transitions. [2019-12-27 07:29:08,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:29:08,390 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13439 transitions. [2019-12-27 07:29:08,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:29:08,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:29:08,401 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:29:08,401 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:29:08,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:29:08,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1294757063, now seen corresponding path program 1 times [2019-12-27 07:29:08,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:29:08,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864654125] [2019-12-27 07:29:08,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:29:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:29:08,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:29:08,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864654125] [2019-12-27 07:29:08,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:29:08,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:29:08,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703783063] [2019-12-27 07:29:08,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:29:08,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:29:08,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:29:08,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:29:08,678 INFO L87 Difference]: Start difference. First operand 4666 states and 13439 transitions. Second operand 6 states. [2019-12-27 07:29:09,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:29:09,218 INFO L93 Difference]: Finished difference Result 8767 states and 25089 transitions. [2019-12-27 07:29:09,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:29:09,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 07:29:09,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:29:09,231 INFO L225 Difference]: With dead ends: 8767 [2019-12-27 07:29:09,231 INFO L226 Difference]: Without dead ends: 8767 [2019-12-27 07:29:09,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:29:09,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8767 states. [2019-12-27 07:29:09,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8767 to 5422. [2019-12-27 07:29:09,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5422 states. [2019-12-27 07:29:09,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5422 states to 5422 states and 15669 transitions. [2019-12-27 07:29:09,324 INFO L78 Accepts]: Start accepts. Automaton has 5422 states and 15669 transitions. Word has length 65 [2019-12-27 07:29:09,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:29:09,324 INFO L462 AbstractCegarLoop]: Abstraction has 5422 states and 15669 transitions. [2019-12-27 07:29:09,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:29:09,324 INFO L276 IsEmpty]: Start isEmpty. Operand 5422 states and 15669 transitions. [2019-12-27 07:29:09,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:29:09,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:29:09,331 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:29:09,332 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:29:09,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:29:09,332 INFO L82 PathProgramCache]: Analyzing trace with hash -2057570235, now seen corresponding path program 2 times [2019-12-27 07:29:09,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:29:09,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21608599] [2019-12-27 07:29:09,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:29:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:29:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:29:09,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21608599] [2019-12-27 07:29:09,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:29:09,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:29:09,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240093891] [2019-12-27 07:29:09,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:29:09,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:29:09,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:29:09,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:29:09,421 INFO L87 Difference]: Start difference. First operand 5422 states and 15669 transitions. Second operand 5 states. [2019-12-27 07:29:09,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:29:09,722 INFO L93 Difference]: Finished difference Result 7982 states and 22732 transitions. [2019-12-27 07:29:09,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:29:09,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 07:29:09,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:29:09,735 INFO L225 Difference]: With dead ends: 7982 [2019-12-27 07:29:09,735 INFO L226 Difference]: Without dead ends: 7982 [2019-12-27 07:29:09,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 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 07:29:09,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7982 states. [2019-12-27 07:29:09,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7982 to 5924. [2019-12-27 07:29:09,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5924 states. [2019-12-27 07:29:09,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5924 states to 5924 states and 17161 transitions. [2019-12-27 07:29:09,846 INFO L78 Accepts]: Start accepts. Automaton has 5924 states and 17161 transitions. Word has length 65 [2019-12-27 07:29:09,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:29:09,846 INFO L462 AbstractCegarLoop]: Abstraction has 5924 states and 17161 transitions. [2019-12-27 07:29:09,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:29:09,846 INFO L276 IsEmpty]: Start isEmpty. Operand 5924 states and 17161 transitions. [2019-12-27 07:29:09,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:29:09,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:29:09,855 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:29:09,855 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:29:09,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:29:09,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1243942585, now seen corresponding path program 3 times [2019-12-27 07:29:09,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:29:09,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364308414] [2019-12-27 07:29:09,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:29:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:29:09,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:29:09,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364308414] [2019-12-27 07:29:09,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:29:09,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:29:09,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59803667] [2019-12-27 07:29:09,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:29:09,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:29:09,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:29:09,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:29:09,933 INFO L87 Difference]: Start difference. First operand 5924 states and 17161 transitions. Second operand 3 states. [2019-12-27 07:29:09,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:29:09,961 INFO L93 Difference]: Finished difference Result 5090 states and 14466 transitions. [2019-12-27 07:29:09,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:29:09,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:29:09,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:29:09,969 INFO L225 Difference]: With dead ends: 5090 [2019-12-27 07:29:09,969 INFO L226 Difference]: Without dead ends: 5090 [2019-12-27 07:29:09,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:29:09,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5090 states. [2019-12-27 07:29:10,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5090 to 4950. [2019-12-27 07:29:10,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4950 states. [2019-12-27 07:29:10,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4950 states to 4950 states and 14080 transitions. [2019-12-27 07:29:10,057 INFO L78 Accepts]: Start accepts. Automaton has 4950 states and 14080 transitions. Word has length 65 [2019-12-27 07:29:10,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:29:10,057 INFO L462 AbstractCegarLoop]: Abstraction has 4950 states and 14080 transitions. [2019-12-27 07:29:10,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:29:10,058 INFO L276 IsEmpty]: Start isEmpty. Operand 4950 states and 14080 transitions. [2019-12-27 07:29:10,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:29:10,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:29:10,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:29:10,067 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:29:10,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:29:10,067 INFO L82 PathProgramCache]: Analyzing trace with hash -930835965, now seen corresponding path program 1 times [2019-12-27 07:29:10,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:29:10,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177431654] [2019-12-27 07:29:10,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:29:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:29:10,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:29:10,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177431654] [2019-12-27 07:29:10,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:29:10,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:29:10,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303123417] [2019-12-27 07:29:10,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:29:10,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:29:10,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:29:10,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:29:10,223 INFO L87 Difference]: Start difference. First operand 4950 states and 14080 transitions. Second operand 7 states. [2019-12-27 07:29:10,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:29:10,478 INFO L93 Difference]: Finished difference Result 17012 states and 48683 transitions. [2019-12-27 07:29:10,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 07:29:10,478 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 07:29:10,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:29:10,496 INFO L225 Difference]: With dead ends: 17012 [2019-12-27 07:29:10,497 INFO L226 Difference]: Without dead ends: 10215 [2019-12-27 07:29:10,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:29:10,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10215 states. [2019-12-27 07:29:10,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10215 to 4950. [2019-12-27 07:29:10,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4950 states. [2019-12-27 07:29:10,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4950 states to 4950 states and 14015 transitions. [2019-12-27 07:29:10,680 INFO L78 Accepts]: Start accepts. Automaton has 4950 states and 14015 transitions. Word has length 66 [2019-12-27 07:29:10,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:29:10,680 INFO L462 AbstractCegarLoop]: Abstraction has 4950 states and 14015 transitions. [2019-12-27 07:29:10,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:29:10,681 INFO L276 IsEmpty]: Start isEmpty. Operand 4950 states and 14015 transitions. [2019-12-27 07:29:10,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:29:10,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:29:10,691 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:29:10,692 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:29:10,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:29:10,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1676100569, now seen corresponding path program 2 times [2019-12-27 07:29:10,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:29:10,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116063410] [2019-12-27 07:29:10,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:29:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:29:10,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 07:29:10,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116063410] [2019-12-27 07:29:10,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:29:10,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:29:10,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879140829] [2019-12-27 07:29:10,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:29:10,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:29:10,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:29:10,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:29:10,800 INFO L87 Difference]: Start difference. First operand 4950 states and 14015 transitions. Second operand 5 states. [2019-12-27 07:29:10,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:29:10,869 INFO L93 Difference]: Finished difference Result 7890 states and 22331 transitions. [2019-12-27 07:29:10,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:29:10,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 07:29:10,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:29:10,875 INFO L225 Difference]: With dead ends: 7890 [2019-12-27 07:29:10,875 INFO L226 Difference]: Without dead ends: 3292 [2019-12-27 07:29:10,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:29:10,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3292 states. [2019-12-27 07:29:10,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3292 to 3292. [2019-12-27 07:29:10,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3292 states. [2019-12-27 07:29:10,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3292 states to 3292 states and 9258 transitions. [2019-12-27 07:29:10,937 INFO L78 Accepts]: Start accepts. Automaton has 3292 states and 9258 transitions. Word has length 66 [2019-12-27 07:29:10,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:29:10,938 INFO L462 AbstractCegarLoop]: Abstraction has 3292 states and 9258 transitions. [2019-12-27 07:29:10,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:29:10,938 INFO L276 IsEmpty]: Start isEmpty. Operand 3292 states and 9258 transitions. [2019-12-27 07:29:10,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:29:10,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:29:10,944 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:29:10,944 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:29:10,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:29:10,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1577722343, now seen corresponding path program 3 times [2019-12-27 07:29:10,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:29:10,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557586744] [2019-12-27 07:29:10,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:29:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:29:11,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:29:11,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557586744] [2019-12-27 07:29:11,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:29:11,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:29:11,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767814991] [2019-12-27 07:29:11,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:29:11,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:29:11,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:29:11,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:29:11,025 INFO L87 Difference]: Start difference. First operand 3292 states and 9258 transitions. Second operand 5 states. [2019-12-27 07:29:11,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:29:11,318 INFO L93 Difference]: Finished difference Result 5305 states and 14820 transitions. [2019-12-27 07:29:11,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:29:11,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 07:29:11,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:29:11,326 INFO L225 Difference]: With dead ends: 5305 [2019-12-27 07:29:11,326 INFO L226 Difference]: Without dead ends: 5305 [2019-12-27 07:29:11,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:29:11,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5305 states. [2019-12-27 07:29:11,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5305 to 4060. [2019-12-27 07:29:11,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2019-12-27 07:29:11,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 11459 transitions. [2019-12-27 07:29:11,391 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 11459 transitions. Word has length 66 [2019-12-27 07:29:11,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:29:11,392 INFO L462 AbstractCegarLoop]: Abstraction has 4060 states and 11459 transitions. [2019-12-27 07:29:11,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:29:11,392 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 11459 transitions. [2019-12-27 07:29:11,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:29:11,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:29:11,398 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:29:11,398 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:29:11,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:29:11,398 INFO L82 PathProgramCache]: Analyzing trace with hash -41780101, now seen corresponding path program 4 times [2019-12-27 07:29:11,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:29:11,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107575652] [2019-12-27 07:29:11,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:29:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:29:11,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:29:11,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107575652] [2019-12-27 07:29:11,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:29:11,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:29:11,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166692883] [2019-12-27 07:29:11,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:29:11,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:29:11,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:29:11,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:29:11,519 INFO L87 Difference]: Start difference. First operand 4060 states and 11459 transitions. Second operand 6 states. [2019-12-27 07:29:11,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:29:11,937 INFO L93 Difference]: Finished difference Result 5776 states and 16067 transitions. [2019-12-27 07:29:11,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:29:11,938 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 07:29:11,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:29:11,947 INFO L225 Difference]: With dead ends: 5776 [2019-12-27 07:29:11,947 INFO L226 Difference]: Without dead ends: 5776 [2019-12-27 07:29:11,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:29:11,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5776 states. [2019-12-27 07:29:12,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5776 to 4200. [2019-12-27 07:29:12,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4200 states. [2019-12-27 07:29:12,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4200 states to 4200 states and 11845 transitions. [2019-12-27 07:29:12,089 INFO L78 Accepts]: Start accepts. Automaton has 4200 states and 11845 transitions. Word has length 66 [2019-12-27 07:29:12,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:29:12,090 INFO L462 AbstractCegarLoop]: Abstraction has 4200 states and 11845 transitions. [2019-12-27 07:29:12,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:29:12,090 INFO L276 IsEmpty]: Start isEmpty. Operand 4200 states and 11845 transitions. [2019-12-27 07:29:12,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:29:12,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:29:12,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:29:12,096 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:29:12,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:29:12,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1318426351, now seen corresponding path program 5 times [2019-12-27 07:29:12,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:29:12,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773691200] [2019-12-27 07:29:12,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:29:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:29:12,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:29:12,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773691200] [2019-12-27 07:29:12,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:29:12,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 07:29:12,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758094107] [2019-12-27 07:29:12,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 07:29:12,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:29:12,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 07:29:12,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:29:12,276 INFO L87 Difference]: Start difference. First operand 4200 states and 11845 transitions. Second operand 10 states. [2019-12-27 07:29:13,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:29:13,145 INFO L93 Difference]: Finished difference Result 7212 states and 19632 transitions. [2019-12-27 07:29:13,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 07:29:13,146 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 07:29:13,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:29:13,156 INFO L225 Difference]: With dead ends: 7212 [2019-12-27 07:29:13,156 INFO L226 Difference]: Without dead ends: 7212 [2019-12-27 07:29:13,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-12-27 07:29:13,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7212 states. [2019-12-27 07:29:13,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7212 to 3780. [2019-12-27 07:29:13,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3780 states. [2019-12-27 07:29:13,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3780 states to 3780 states and 10432 transitions. [2019-12-27 07:29:13,229 INFO L78 Accepts]: Start accepts. Automaton has 3780 states and 10432 transitions. Word has length 66 [2019-12-27 07:29:13,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:29:13,229 INFO L462 AbstractCegarLoop]: Abstraction has 3780 states and 10432 transitions. [2019-12-27 07:29:13,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 07:29:13,229 INFO L276 IsEmpty]: Start isEmpty. Operand 3780 states and 10432 transitions. [2019-12-27 07:29:13,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:29:13,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:29:13,235 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:29:13,236 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:29:13,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:29:13,236 INFO L82 PathProgramCache]: Analyzing trace with hash -24257719, now seen corresponding path program 6 times [2019-12-27 07:29:13,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:29:13,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339056684] [2019-12-27 07:29:13,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:29:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:29:13,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:29:13,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339056684] [2019-12-27 07:29:13,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:29:13,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:29:13,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559474240] [2019-12-27 07:29:13,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:29:13,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:29:13,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:29:13,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:29:13,292 INFO L87 Difference]: Start difference. First operand 3780 states and 10432 transitions. Second operand 3 states. [2019-12-27 07:29:13,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:29:13,355 INFO L93 Difference]: Finished difference Result 3780 states and 10431 transitions. [2019-12-27 07:29:13,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:29:13,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 07:29:13,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:29:13,361 INFO L225 Difference]: With dead ends: 3780 [2019-12-27 07:29:13,361 INFO L226 Difference]: Without dead ends: 3780 [2019-12-27 07:29:13,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:29:13,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3780 states. [2019-12-27 07:29:13,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3780 to 2234. [2019-12-27 07:29:13,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2234 states. [2019-12-27 07:29:13,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 6198 transitions. [2019-12-27 07:29:13,420 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 6198 transitions. Word has length 66 [2019-12-27 07:29:13,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:29:13,420 INFO L462 AbstractCegarLoop]: Abstraction has 2234 states and 6198 transitions. [2019-12-27 07:29:13,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:29:13,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 6198 transitions. [2019-12-27 07:29:13,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:29:13,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:29:13,426 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:29:13,426 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:29:13,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:29:13,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1407890134, now seen corresponding path program 1 times [2019-12-27 07:29:13,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:29:13,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136295234] [2019-12-27 07:29:13,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:29:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:29:13,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:29:13,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136295234] [2019-12-27 07:29:13,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:29:13,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:29:13,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009696557] [2019-12-27 07:29:13,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:29:13,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:29:13,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:29:13,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:29:13,527 INFO L87 Difference]: Start difference. First operand 2234 states and 6198 transitions. Second operand 6 states. [2019-12-27 07:29:13,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:29:13,918 INFO L93 Difference]: Finished difference Result 3660 states and 10061 transitions. [2019-12-27 07:29:13,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:29:13,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-27 07:29:13,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:29:13,925 INFO L225 Difference]: With dead ends: 3660 [2019-12-27 07:29:13,925 INFO L226 Difference]: Without dead ends: 3660 [2019-12-27 07:29:13,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:29:13,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2019-12-27 07:29:13,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 2179. [2019-12-27 07:29:13,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2179 states. [2019-12-27 07:29:13,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 6048 transitions. [2019-12-27 07:29:13,964 INFO L78 Accepts]: Start accepts. Automaton has 2179 states and 6048 transitions. Word has length 67 [2019-12-27 07:29:13,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:29:13,965 INFO L462 AbstractCegarLoop]: Abstraction has 2179 states and 6048 transitions. [2019-12-27 07:29:13,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:29:13,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 6048 transitions. [2019-12-27 07:29:13,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:29:13,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:29:13,967 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:29:13,967 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:29:13,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:29:13,968 INFO L82 PathProgramCache]: Analyzing trace with hash 246556970, now seen corresponding path program 2 times [2019-12-27 07:29:13,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:29:13,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740549993] [2019-12-27 07:29:13,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:29:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:29:14,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:29:14,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740549993] [2019-12-27 07:29:14,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:29:14,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:29:14,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834635132] [2019-12-27 07:29:14,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:29:14,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:29:14,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:29:14,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:29:14,024 INFO L87 Difference]: Start difference. First operand 2179 states and 6048 transitions. Second operand 3 states. [2019-12-27 07:29:14,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:29:14,040 INFO L93 Difference]: Finished difference Result 2027 states and 5524 transitions. [2019-12-27 07:29:14,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:29:14,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 07:29:14,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:29:14,044 INFO L225 Difference]: With dead ends: 2027 [2019-12-27 07:29:14,044 INFO L226 Difference]: Without dead ends: 2027 [2019-12-27 07:29:14,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:29:14,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2019-12-27 07:29:14,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1985. [2019-12-27 07:29:14,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1985 states. [2019-12-27 07:29:14,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 5411 transitions. [2019-12-27 07:29:14,088 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 5411 transitions. Word has length 67 [2019-12-27 07:29:14,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:29:14,088 INFO L462 AbstractCegarLoop]: Abstraction has 1985 states and 5411 transitions. [2019-12-27 07:29:14,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:29:14,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 5411 transitions. [2019-12-27 07:29:14,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 07:29:14,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:29:14,092 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:29:14,092 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:29:14,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:29:14,092 INFO L82 PathProgramCache]: Analyzing trace with hash 979744922, now seen corresponding path program 1 times [2019-12-27 07:29:14,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:29:14,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970815764] [2019-12-27 07:29:14,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:29:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:29:14,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:29:14,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970815764] [2019-12-27 07:29:14,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:29:14,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:29:14,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326813127] [2019-12-27 07:29:14,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:29:14,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:29:14,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:29:14,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:29:14,196 INFO L87 Difference]: Start difference. First operand 1985 states and 5411 transitions. Second operand 6 states. [2019-12-27 07:29:14,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:29:14,256 INFO L93 Difference]: Finished difference Result 3737 states and 10243 transitions. [2019-12-27 07:29:14,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:29:14,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 07:29:14,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:29:14,260 INFO L225 Difference]: With dead ends: 3737 [2019-12-27 07:29:14,260 INFO L226 Difference]: Without dead ends: 1793 [2019-12-27 07:29:14,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:29:14,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2019-12-27 07:29:14,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1793. [2019-12-27 07:29:14,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1793 states. [2019-12-27 07:29:14,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 4904 transitions. [2019-12-27 07:29:14,287 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 4904 transitions. Word has length 68 [2019-12-27 07:29:14,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:29:14,288 INFO L462 AbstractCegarLoop]: Abstraction has 1793 states and 4904 transitions. [2019-12-27 07:29:14,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:29:14,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 4904 transitions. [2019-12-27 07:29:14,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 07:29:14,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:29:14,289 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:29:14,290 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:29:14,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:29:14,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1952420056, now seen corresponding path program 2 times [2019-12-27 07:29:14,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:29:14,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046377050] [2019-12-27 07:29:14,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:29:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:29:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:29:14,399 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:29:14,399 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:29:14,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= v_~x$r_buff1_thd1~0_19 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~x$w_buff0_used~0_117) (= v_~x$w_buff1_used~0_74 0) (= 0 v_~x$r_buff0_thd2~0_26) (= v_~x~0_30 0) (= 0 v_~x$r_buff0_thd1~0_20) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1876~0.base_20|)) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1876~0.base_20| 4) |v_#length_25|) (= |v_ULTIMATE.start_main_~#t1876~0.offset_17| 0) (= v_~x$flush_delayed~0_16 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~__unbuffered_p2_EAX~0_8 0) (= 0 v_~x$read_delayed_var~0.base_7) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1876~0.base_20|) (= v_~x$r_buff1_thd0~0_47 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~x$r_buff0_thd0~0_79) (= 0 |v_#NULL.base_4|) (= 0 v_~x$w_buff1~0_29) (= 0 v_~__unbuffered_cnt~0_19) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1876~0.base_20| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1876~0.base_20|) |v_ULTIMATE.start_main_~#t1876~0.offset_17| 0)) |v_#memory_int_21|) (= v_~y~0_13 0) (= v_~x$r_buff1_thd2~0_19 0) (= v_~__unbuffered_p2_EBX~0_8 0) (= |v_#NULL.offset_4| 0) (= v_~x$mem_tmp~0_11 0) (= v_~x$r_buff1_thd3~0_17 0) (= 0 v_~x$r_buff0_thd3~0_19) (= 0 v_~x$read_delayed_var~0.offset_7) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t1876~0.base_20| 1)) (= 0 v_~x$w_buff0~0_30) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~weak$$choice2~0_31))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_9|, ~x$w_buff0~0=v_~x$w_buff0~0_30, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_11|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_13|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_14|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_16|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ULTIMATE.start_main_~#t1878~0.offset=|v_ULTIMATE.start_main_~#t1878~0.offset_16|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_79, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ~x$w_buff1~0=v_~x$w_buff1~0_29, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_74, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t1876~0.offset=|v_ULTIMATE.start_main_~#t1876~0.offset_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x~0=v_~x~0_30, ULTIMATE.start_main_~#t1877~0.offset=|v_ULTIMATE.start_main_~#t1877~0.offset_17|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_9|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_13|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_13|, ~y~0=v_~y~0_13, ULTIMATE.start_main_~#t1876~0.base=|v_ULTIMATE.start_main_~#t1876~0.base_20|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_47, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, ULTIMATE.start_main_~#t1878~0.base=|v_ULTIMATE.start_main_~#t1878~0.base_20|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ULTIMATE.start_main_~#t1877~0.base=|v_ULTIMATE.start_main_~#t1877~0.base_21|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_31, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t1878~0.offset, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t1876~0.offset, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1877~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_~#t1876~0.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t1878~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t1877~0.base, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 07:29:14,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L805-1-->L807: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1877~0.base_11|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1877~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1877~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t1877~0.offset_10| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1877~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1877~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1877~0.base_11|) |v_ULTIMATE.start_main_~#t1877~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1877~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1877~0.base=|v_ULTIMATE.start_main_~#t1877~0.base_11|, ULTIMATE.start_main_~#t1877~0.offset=|v_ULTIMATE.start_main_~#t1877~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1877~0.base, ULTIMATE.start_main_~#t1877~0.offset, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 07:29:14,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1878~0.base_9|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1878~0.base_9| 1)) (= 0 |v_ULTIMATE.start_main_~#t1878~0.offset_8|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1878~0.base_9|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1878~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1878~0.base_9|) |v_ULTIMATE.start_main_~#t1878~0.offset_8| 2))) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1878~0.base_9| 4) |v_#length_13|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1878~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1878~0.offset=|v_ULTIMATE.start_main_~#t1878~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1878~0.base=|v_ULTIMATE.start_main_~#t1878~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1878~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1878~0.base] because there is no mapped edge [2019-12-27 07:29:14,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= 2 v_~x$w_buff0~0_17) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= 1 v_~x$w_buff0_used~0_80) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= v_~x$w_buff0~0_18 v_~x$w_buff1~0_15) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= v_~x$w_buff1_used~0_49 v_~x$w_buff0_used~0_81) (= (mod v_~x$w_buff1_used~0_49 256) 0)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_18, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_17, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_80} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 07:29:14,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-1341348116 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1341348116 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out-1341348116| ~x$w_buff1~0_In-1341348116) (not .cse1)) (and (= ~x~0_In-1341348116 |P2Thread1of1ForFork2_#t~ite15_Out-1341348116|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1341348116, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1341348116, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1341348116, ~x~0=~x~0_In-1341348116} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-1341348116|, ~x$w_buff1~0=~x$w_buff1~0_In-1341348116, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1341348116, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1341348116, ~x~0=~x~0_In-1341348116} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 07:29:14,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L782-4-->L783: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~x~0_17) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-27 07:29:14,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-389721731 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-389721731 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-389721731|)) (and (= ~x$w_buff0_used~0_In-389721731 |P2Thread1of1ForFork2_#t~ite17_Out-389721731|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-389721731, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-389721731} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-389721731, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-389721731|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-389721731} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 07:29:14,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In413168223 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In413168223 256))) (.cse3 (= (mod ~x$r_buff0_thd3~0_In413168223 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In413168223 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In413168223 |P2Thread1of1ForFork2_#t~ite18_Out413168223|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork2_#t~ite18_Out413168223|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In413168223, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In413168223, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In413168223, ~x$w_buff0_used~0=~x$w_buff0_used~0_In413168223} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In413168223, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In413168223, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In413168223, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out413168223|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In413168223} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 07:29:14,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L733-2-->L733-5: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd1~0_In-939720480 256) 0)) (.cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out-939720480| |P0Thread1of1ForFork0_#t~ite4_Out-939720480|)) (.cse1 (= (mod ~x$w_buff1_used~0_In-939720480 256) 0))) (or (and (= ~x~0_In-939720480 |P0Thread1of1ForFork0_#t~ite3_Out-939720480|) .cse0 (or .cse1 .cse2)) (and (not .cse2) (= |P0Thread1of1ForFork0_#t~ite3_Out-939720480| ~x$w_buff1~0_In-939720480) .cse0 (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-939720480, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-939720480, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-939720480, ~x~0=~x~0_In-939720480} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-939720480|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-939720480|, ~x$w_buff1~0=~x$w_buff1~0_In-939720480, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-939720480, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-939720480, ~x~0=~x~0_In-939720480} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 07:29:14,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L734-->L734-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In1932160472 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1932160472 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1932160472 |P0Thread1of1ForFork0_#t~ite5_Out1932160472|)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1932160472| 0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1932160472, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1932160472} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1932160472|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1932160472, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1932160472} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 07:29:14,412 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L735-->L735-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In461095112 256))) (.cse1 (= (mod ~x$r_buff1_thd1~0_In461095112 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In461095112 256))) (.cse3 (= (mod ~x$r_buff0_thd1~0_In461095112 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out461095112|)) (and (= ~x$w_buff1_used~0_In461095112 |P0Thread1of1ForFork0_#t~ite6_Out461095112|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In461095112, ~x$w_buff1_used~0=~x$w_buff1_used~0_In461095112, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In461095112, ~x$w_buff0_used~0=~x$w_buff0_used~0_In461095112} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out461095112|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In461095112, ~x$w_buff1_used~0=~x$w_buff1_used~0_In461095112, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In461095112, ~x$w_buff0_used~0=~x$w_buff0_used~0_In461095112} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 07:29:14,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-515618081 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-515618081 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out-515618081| ~x$r_buff0_thd3~0_In-515618081) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out-515618081| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-515618081, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-515618081} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-515618081, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-515618081|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-515618081} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 07:29:14,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L786-->L786-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In90571559 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In90571559 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In90571559 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In90571559 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite20_Out90571559| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~x$r_buff1_thd3~0_In90571559 |P2Thread1of1ForFork2_#t~ite20_Out90571559|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In90571559, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In90571559, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In90571559, ~x$w_buff0_used~0=~x$w_buff0_used~0_In90571559} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out90571559|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In90571559, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In90571559, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In90571559, ~x$w_buff0_used~0=~x$w_buff0_used~0_In90571559} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 07:29:14,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~x$r_buff1_thd3~0_13)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_13, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 07:29:14,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L736-->L736-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In2043702187 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In2043702187 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out2043702187| 0)) (and (= ~x$r_buff0_thd1~0_In2043702187 |P0Thread1of1ForFork0_#t~ite7_Out2043702187|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2043702187, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2043702187} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2043702187, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out2043702187|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2043702187} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 07:29:14,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L737-->L737-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-2146721894 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-2146721894 256))) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-2146721894 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-2146721894 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-2146721894| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out-2146721894| ~x$r_buff1_thd1~0_In-2146721894)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2146721894, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2146721894, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2146721894, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2146721894} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2146721894, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-2146721894|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2146721894, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2146721894, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2146721894} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 07:29:14,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L737-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 07:29:14,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1096979231 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1096979231 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-1096979231|) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1096979231| ~x$w_buff0_used~0_In-1096979231) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1096979231, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1096979231} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1096979231|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1096979231, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1096979231} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 07:29:14,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L764-->L764-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-97023333 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-97023333 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-97023333 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-97023333 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-97023333 |P1Thread1of1ForFork1_#t~ite12_Out-97023333|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-97023333|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-97023333, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-97023333, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-97023333, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-97023333} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-97023333, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-97023333, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-97023333|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-97023333, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-97023333} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 07:29:14,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L766: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-358172245 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-358172245 256) 0))) (or (and (= ~x$r_buff0_thd2~0_In-358172245 ~x$r_buff0_thd2~0_Out-358172245) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-358172245) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-358172245, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-358172245} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-358172245|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-358172245, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-358172245} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 07:29:14,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L766-->L766-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2024022592 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-2024022592 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-2024022592 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-2024022592 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-2024022592| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-2024022592 |P1Thread1of1ForFork1_#t~ite14_Out-2024022592|) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2024022592, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2024022592, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2024022592, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2024022592} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2024022592, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2024022592, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2024022592, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-2024022592|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2024022592} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 07:29:14,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~x$r_buff1_thd2~0_15 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 07:29:14,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 07:29:14,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L815-2-->L815-5: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-1389360976 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1389360976 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite24_Out-1389360976| |ULTIMATE.start_main_#t~ite25_Out-1389360976|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite24_Out-1389360976| ~x$w_buff1~0_In-1389360976) (not .cse1) .cse2) (and (= |ULTIMATE.start_main_#t~ite24_Out-1389360976| ~x~0_In-1389360976) (or .cse1 .cse0) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1389360976, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1389360976, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1389360976, ~x~0=~x~0_In-1389360976} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1389360976, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1389360976|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1389360976|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1389360976, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1389360976, ~x~0=~x~0_In-1389360976} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 07:29:14,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1717603120 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1717603120 256)))) (or (and (= ~x$w_buff0_used~0_In1717603120 |ULTIMATE.start_main_#t~ite26_Out1717603120|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite26_Out1717603120| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1717603120, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1717603120} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1717603120, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1717603120|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1717603120} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 07:29:14,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L817-->L817-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In924268300 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In924268300 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In924268300 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In924268300 256)))) (or (and (= ~x$w_buff1_used~0_In924268300 |ULTIMATE.start_main_#t~ite27_Out924268300|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite27_Out924268300|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In924268300, ~x$w_buff1_used~0=~x$w_buff1_used~0_In924268300, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In924268300, ~x$w_buff0_used~0=~x$w_buff0_used~0_In924268300} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In924268300, ~x$w_buff1_used~0=~x$w_buff1_used~0_In924268300, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out924268300|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In924268300, ~x$w_buff0_used~0=~x$w_buff0_used~0_In924268300} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 07:29:14,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1438656958 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1438656958 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-1438656958 |ULTIMATE.start_main_#t~ite28_Out-1438656958|)) (and (= 0 |ULTIMATE.start_main_#t~ite28_Out-1438656958|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1438656958, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1438656958} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1438656958, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1438656958|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1438656958} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 07:29:14,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-1331747365 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1331747365 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1331747365 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1331747365 256)))) (or (and (= ~x$r_buff1_thd0~0_In-1331747365 |ULTIMATE.start_main_#t~ite29_Out-1331747365|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite29_Out-1331747365|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1331747365, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1331747365, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1331747365, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1331747365} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1331747365, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1331747365|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1331747365, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1331747365, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1331747365} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 07:29:14,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L831-->L832: Formula: (and (= v_~x$r_buff0_thd0~0_57 v_~x$r_buff0_thd0~0_56) (not (= (mod v_~weak$$choice2~0_21 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 07:29:14,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L834-->L837-1: Formula: (and (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_~x$flush_delayed~0_10 0) (= v_~x$mem_tmp~0_7 v_~x~0_25)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_7} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_7, ~x~0=v_~x~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:29:14,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 07:29:14,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:29:14 BasicIcfg [2019-12-27 07:29:14,551 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:29:14,553 INFO L168 Benchmark]: Toolchain (without parser) took 104335.25 ms. Allocated memory was 147.3 MB in the beginning and 4.6 GB in the end (delta: 4.5 GB). Free memory was 103.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2019-12-27 07:29:14,553 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 147.3 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 07:29:14,554 INFO L168 Benchmark]: CACSL2BoogieTranslator took 835.78 ms. Allocated memory was 147.3 MB in the beginning and 205.0 MB in the end (delta: 57.7 MB). Free memory was 103.0 MB in the beginning and 156.9 MB in the end (delta: -53.9 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:29:14,555 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.51 ms. Allocated memory is still 205.0 MB. Free memory was 156.3 MB in the beginning and 153.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 07:29:14,555 INFO L168 Benchmark]: Boogie Preprocessor took 61.32 ms. Allocated memory is still 205.0 MB. Free memory was 153.8 MB in the beginning and 151.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 07:29:14,556 INFO L168 Benchmark]: RCFGBuilder took 969.88 ms. Allocated memory is still 205.0 MB. Free memory was 151.2 MB in the beginning and 101.1 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-27 07:29:14,557 INFO L168 Benchmark]: TraceAbstraction took 102386.96 ms. Allocated memory was 205.0 MB in the beginning and 4.6 GB in the end (delta: 4.4 GB). Free memory was 101.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2019-12-27 07:29:14,561 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.53 ms. Allocated memory is still 147.3 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 835.78 ms. Allocated memory was 147.3 MB in the beginning and 205.0 MB in the end (delta: 57.7 MB). Free memory was 103.0 MB in the beginning and 156.9 MB in the end (delta: -53.9 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.51 ms. Allocated memory is still 205.0 MB. Free memory was 156.3 MB in the beginning and 153.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.32 ms. Allocated memory is still 205.0 MB. Free memory was 153.8 MB in the beginning and 151.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 969.88 ms. Allocated memory is still 205.0 MB. Free memory was 151.2 MB in the beginning and 101.1 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 102386.96 ms. Allocated memory was 205.0 MB in the beginning and 4.6 GB in the end (delta: 4.4 GB). Free memory was 101.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 174 ProgramPointsBefore, 96 ProgramPointsAfterwards, 211 TransitionsBefore, 109 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 28 ChoiceCompositions, 5983 VarBasedMoverChecksPositive, 190 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 82010 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t1876, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L807] FCALL, FORK 0 pthread_create(&t1877, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L809] FCALL, FORK 0 pthread_create(&t1878, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 2 x$r_buff0_thd2 = (_Bool)1 [L759] 2 y = 1 VAL [__unbuffered_cnt=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L727] 1 y = 2 [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L733] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L784] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L785] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L762] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L763] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L764] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L815] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L816] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L817] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L818] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L819] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 x$flush_delayed = weak$$choice2 [L825] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L827] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L828] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L828] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L829] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L830] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L832] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 102.0s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 21.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3195 SDtfs, 2337 SDslu, 6052 SDs, 0 SdLazy, 3476 SolverSat, 146 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 37 SyntacticMatches, 17 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203645occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 54.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 85438 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1114 NumberOfCodeBlocks, 1114 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1025 ConstructedInterpolants, 0 QuantifiedInterpolants, 160632 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...