/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe033_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 00:15:20,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 00:15:20,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 00:15:20,786 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 00:15:20,787 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 00:15:20,789 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 00:15:20,790 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 00:15:20,793 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 00:15:20,796 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 00:15:20,797 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 00:15:20,800 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 00:15:20,802 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 00:15:20,803 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 00:15:20,804 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 00:15:20,805 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 00:15:20,808 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 00:15:20,808 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 00:15:20,809 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 00:15:20,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 00:15:20,817 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 00:15:20,820 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 00:15:20,823 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 00:15:20,824 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 00:15:20,824 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 00:15:20,826 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 00:15:20,827 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 00:15:20,827 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 00:15:20,828 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 00:15:20,828 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 00:15:20,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 00:15:20,831 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 00:15:20,833 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 00:15:20,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 00:15:20,834 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 00:15:20,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 00:15:20,836 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 00:15:20,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 00:15:20,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 00:15:20,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 00:15:20,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 00:15:20,839 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 00:15:20,841 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-27 00:15:20,873 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 00:15:20,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 00:15:20,879 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 00:15:20,879 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 00:15:20,880 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 00:15:20,880 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 00:15:20,880 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 00:15:20,880 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 00:15:20,880 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 00:15:20,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 00:15:20,881 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 00:15:20,881 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 00:15:20,881 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 00:15:20,881 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 00:15:20,881 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 00:15:20,882 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 00:15:20,882 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 00:15:20,882 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 00:15:20,883 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 00:15:20,883 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 00:15:20,883 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 00:15:20,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:15:20,883 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 00:15:20,884 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 00:15:20,884 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 00:15:20,884 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 00:15:20,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 00:15:20,884 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 00:15:20,886 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-27 00:15:20,887 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 00:15:21,158 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 00:15:21,173 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 00:15:21,178 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 00:15:21,179 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 00:15:21,180 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 00:15:21,181 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_pso.opt.i [2019-12-27 00:15:21,254 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62b4586b8/15a4c3e175b042aca1dfa56a17c470a6/FLAG0b44d53b9 [2019-12-27 00:15:21,803 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 00:15:21,804 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_pso.opt.i [2019-12-27 00:15:21,833 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62b4586b8/15a4c3e175b042aca1dfa56a17c470a6/FLAG0b44d53b9 [2019-12-27 00:15:22,101 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62b4586b8/15a4c3e175b042aca1dfa56a17c470a6 [2019-12-27 00:15:22,112 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 00:15:22,114 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 00:15:22,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 00:15:22,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 00:15:22,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 00:15:22,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:15:22" (1/1) ... [2019-12-27 00:15:22,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e400b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:15:22, skipping insertion in model container [2019-12-27 00:15:22,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:15:22" (1/1) ... [2019-12-27 00:15:22,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 00:15:22,193 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 00:15:22,774 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:15:22,796 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 00:15:22,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:15:22,943 INFO L208 MainTranslator]: Completed translation [2019-12-27 00:15:22,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:15:22 WrapperNode [2019-12-27 00:15:22,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 00:15:22,945 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 00:15:22,945 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 00:15:22,945 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 00:15:22,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:15:22" (1/1) ... [2019-12-27 00:15:22,979 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:15:22" (1/1) ... [2019-12-27 00:15:23,010 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 00:15:23,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 00:15:23,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 00:15:23,011 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 00:15:23,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:15:22" (1/1) ... [2019-12-27 00:15:23,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:15:22" (1/1) ... [2019-12-27 00:15:23,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:15:22" (1/1) ... [2019-12-27 00:15:23,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:15:22" (1/1) ... [2019-12-27 00:15:23,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:15:22" (1/1) ... [2019-12-27 00:15:23,039 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:15:22" (1/1) ... [2019-12-27 00:15:23,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:15:22" (1/1) ... [2019-12-27 00:15:23,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 00:15:23,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 00:15:23,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 00:15:23,048 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 00:15:23,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:15:22" (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 00:15:23,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 00:15:23,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 00:15:23,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 00:15:23,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 00:15:23,129 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 00:15:23,129 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 00:15:23,129 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 00:15:23,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 00:15:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 00:15:23,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 00:15:23,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 00:15:23,132 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 00:15:23,754 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 00:15:23,754 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 00:15:23,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:15:23 BoogieIcfgContainer [2019-12-27 00:15:23,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 00:15:23,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 00:15:23,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 00:15:23,760 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 00:15:23,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:15:22" (1/3) ... [2019-12-27 00:15:23,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3cd8d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:15:23, skipping insertion in model container [2019-12-27 00:15:23,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:15:22" (2/3) ... [2019-12-27 00:15:23,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3cd8d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:15:23, skipping insertion in model container [2019-12-27 00:15:23,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:15:23" (3/3) ... [2019-12-27 00:15:23,764 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_pso.opt.i [2019-12-27 00:15:23,775 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 00:15:23,776 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 00:15:23,784 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 00:15:23,785 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 00:15:23,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,824 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,825 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,849 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,849 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,850 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,850 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,850 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,861 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,861 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,861 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,868 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,869 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:15:23,913 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 00:15:23,936 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:15:23,937 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:15:23,937 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:15:23,937 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:15:23,938 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:15:23,938 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:15:23,939 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:15:23,939 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:15:23,962 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 162 transitions [2019-12-27 00:15:23,964 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-27 00:15:24,095 INFO L132 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-27 00:15:24,095 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:15:24,116 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 343 event pairs. 0/123 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 00:15:24,134 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-27 00:15:24,210 INFO L132 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-27 00:15:24,210 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:15:24,217 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 343 event pairs. 0/123 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 00:15:24,233 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-27 00:15:24,234 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:15:28,719 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 00:15:28,833 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 00:15:28,953 INFO L206 etLargeBlockEncoding]: Checked pairs total: 40283 [2019-12-27 00:15:28,953 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-27 00:15:28,957 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 78 transitions [2019-12-27 00:15:29,296 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6362 states. [2019-12-27 00:15:29,299 INFO L276 IsEmpty]: Start isEmpty. Operand 6362 states. [2019-12-27 00:15:29,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 00:15:29,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:15:29,306 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 00:15:29,307 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:15:29,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:15:29,313 INFO L82 PathProgramCache]: Analyzing trace with hash 673057218, now seen corresponding path program 1 times [2019-12-27 00:15:29,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:15:29,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470322047] [2019-12-27 00:15:29,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:15:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:15:29,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 00:15:29,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470322047] [2019-12-27 00:15:29,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:15:29,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:15:29,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355327306] [2019-12-27 00:15:29,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:15:29,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:15:29,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:15:29,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:15:29,598 INFO L87 Difference]: Start difference. First operand 6362 states. Second operand 3 states. [2019-12-27 00:15:29,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:15:29,835 INFO L93 Difference]: Finished difference Result 6240 states and 21110 transitions. [2019-12-27 00:15:29,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:15:29,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 00:15:29,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:15:29,905 INFO L225 Difference]: With dead ends: 6240 [2019-12-27 00:15:29,906 INFO L226 Difference]: Without dead ends: 5850 [2019-12-27 00:15:29,907 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 00:15:30,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5850 states. [2019-12-27 00:15:30,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5850 to 5850. [2019-12-27 00:15:30,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5850 states. [2019-12-27 00:15:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 19754 transitions. [2019-12-27 00:15:30,428 INFO L78 Accepts]: Start accepts. Automaton has 5850 states and 19754 transitions. Word has length 5 [2019-12-27 00:15:30,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:15:30,429 INFO L462 AbstractCegarLoop]: Abstraction has 5850 states and 19754 transitions. [2019-12-27 00:15:30,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:15:30,429 INFO L276 IsEmpty]: Start isEmpty. Operand 5850 states and 19754 transitions. [2019-12-27 00:15:30,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 00:15:30,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:15:30,438 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:15:30,439 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:15:30,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:15:30,446 INFO L82 PathProgramCache]: Analyzing trace with hash 93905246, now seen corresponding path program 1 times [2019-12-27 00:15:30,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:15:30,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672594594] [2019-12-27 00:15:30,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:15:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:15:30,522 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 00:15:30,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672594594] [2019-12-27 00:15:30,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:15:30,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:15:30,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137589282] [2019-12-27 00:15:30,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:15:30,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:15:30,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:15:30,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:15:30,526 INFO L87 Difference]: Start difference. First operand 5850 states and 19754 transitions. Second operand 3 states. [2019-12-27 00:15:30,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:15:30,563 INFO L93 Difference]: Finished difference Result 1185 states and 2948 transitions. [2019-12-27 00:15:30,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:15:30,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 00:15:30,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:15:30,571 INFO L225 Difference]: With dead ends: 1185 [2019-12-27 00:15:30,571 INFO L226 Difference]: Without dead ends: 1185 [2019-12-27 00:15:30,572 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 00:15:30,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-12-27 00:15:30,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1185. [2019-12-27 00:15:30,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-12-27 00:15:30,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 2948 transitions. [2019-12-27 00:15:30,605 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 2948 transitions. Word has length 11 [2019-12-27 00:15:30,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:15:30,605 INFO L462 AbstractCegarLoop]: Abstraction has 1185 states and 2948 transitions. [2019-12-27 00:15:30,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:15:30,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 2948 transitions. [2019-12-27 00:15:30,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 00:15:30,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:15:30,611 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:15:30,611 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:15:30,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:15:30,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1893769716, now seen corresponding path program 1 times [2019-12-27 00:15:30,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:15:30,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851402456] [2019-12-27 00:15:30,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:15:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:15:30,691 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 00:15:30,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851402456] [2019-12-27 00:15:30,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:15:30,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:15:30,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852331865] [2019-12-27 00:15:30,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:15:30,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:15:30,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:15:30,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:15:30,693 INFO L87 Difference]: Start difference. First operand 1185 states and 2948 transitions. Second operand 3 states. [2019-12-27 00:15:30,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:15:30,759 INFO L93 Difference]: Finished difference Result 1756 states and 4318 transitions. [2019-12-27 00:15:30,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:15:30,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 00:15:30,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:15:30,770 INFO L225 Difference]: With dead ends: 1756 [2019-12-27 00:15:30,770 INFO L226 Difference]: Without dead ends: 1756 [2019-12-27 00:15:30,771 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 00:15:30,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2019-12-27 00:15:30,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1300. [2019-12-27 00:15:30,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2019-12-27 00:15:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 3182 transitions. [2019-12-27 00:15:30,813 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 3182 transitions. Word has length 14 [2019-12-27 00:15:30,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:15:30,813 INFO L462 AbstractCegarLoop]: Abstraction has 1300 states and 3182 transitions. [2019-12-27 00:15:30,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:15:30,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 3182 transitions. [2019-12-27 00:15:30,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 00:15:30,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:15:30,815 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:15:30,815 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:15:30,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:15:30,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1890038153, now seen corresponding path program 1 times [2019-12-27 00:15:30,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:15:30,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512185286] [2019-12-27 00:15:30,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:15:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:15:30,895 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 00:15:30,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512185286] [2019-12-27 00:15:30,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:15:30,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:15:30,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865374468] [2019-12-27 00:15:30,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:15:30,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:15:30,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:15:30,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:15:30,898 INFO L87 Difference]: Start difference. First operand 1300 states and 3182 transitions. Second operand 4 states. [2019-12-27 00:15:31,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:15:31,107 INFO L93 Difference]: Finished difference Result 1703 states and 4071 transitions. [2019-12-27 00:15:31,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:15:31,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 00:15:31,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:15:31,118 INFO L225 Difference]: With dead ends: 1703 [2019-12-27 00:15:31,119 INFO L226 Difference]: Without dead ends: 1703 [2019-12-27 00:15:31,119 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 00:15:31,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-12-27 00:15:31,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1513. [2019-12-27 00:15:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2019-12-27 00:15:31,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 3661 transitions. [2019-12-27 00:15:31,169 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 3661 transitions. Word has length 14 [2019-12-27 00:15:31,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:15:31,170 INFO L462 AbstractCegarLoop]: Abstraction has 1513 states and 3661 transitions. [2019-12-27 00:15:31,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:15:31,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 3661 transitions. [2019-12-27 00:15:31,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 00:15:31,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:15:31,171 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:15:31,172 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:15:31,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:15:31,172 INFO L82 PathProgramCache]: Analyzing trace with hash 422006117, now seen corresponding path program 1 times [2019-12-27 00:15:31,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:15:31,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219924117] [2019-12-27 00:15:31,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:15:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:15:31,255 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 00:15:31,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219924117] [2019-12-27 00:15:31,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:15:31,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:15:31,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334231503] [2019-12-27 00:15:31,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:15:31,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:15:31,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:15:31,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:15:31,258 INFO L87 Difference]: Start difference. First operand 1513 states and 3661 transitions. Second operand 4 states. [2019-12-27 00:15:31,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:15:31,576 INFO L93 Difference]: Finished difference Result 1972 states and 4699 transitions. [2019-12-27 00:15:31,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:15:31,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 00:15:31,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:15:31,594 INFO L225 Difference]: With dead ends: 1972 [2019-12-27 00:15:31,594 INFO L226 Difference]: Without dead ends: 1972 [2019-12-27 00:15:31,595 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 00:15:31,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2019-12-27 00:15:31,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1607. [2019-12-27 00:15:31,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2019-12-27 00:15:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 3887 transitions. [2019-12-27 00:15:31,662 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 3887 transitions. Word has length 14 [2019-12-27 00:15:31,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:15:31,663 INFO L462 AbstractCegarLoop]: Abstraction has 1607 states and 3887 transitions. [2019-12-27 00:15:31,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:15:31,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 3887 transitions. [2019-12-27 00:15:31,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 00:15:31,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:15:31,667 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:15:31,667 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:15:31,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:15:31,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1141853416, now seen corresponding path program 1 times [2019-12-27 00:15:31,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:15:31,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004271166] [2019-12-27 00:15:31,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:15:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:15:31,769 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 00:15:31,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004271166] [2019-12-27 00:15:31,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:15:31,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:15:31,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689488614] [2019-12-27 00:15:31,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:15:31,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:15:31,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:15:31,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:15:31,773 INFO L87 Difference]: Start difference. First operand 1607 states and 3887 transitions. Second operand 4 states. [2019-12-27 00:15:31,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:15:31,797 INFO L93 Difference]: Finished difference Result 772 states and 1728 transitions. [2019-12-27 00:15:31,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:15:31,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-27 00:15:31,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:15:31,802 INFO L225 Difference]: With dead ends: 772 [2019-12-27 00:15:31,802 INFO L226 Difference]: Without dead ends: 772 [2019-12-27 00:15:31,803 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 00:15:31,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-12-27 00:15:31,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 722. [2019-12-27 00:15:31,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-12-27 00:15:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1628 transitions. [2019-12-27 00:15:31,822 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1628 transitions. Word has length 26 [2019-12-27 00:15:31,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:15:31,823 INFO L462 AbstractCegarLoop]: Abstraction has 722 states and 1628 transitions. [2019-12-27 00:15:31,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:15:31,823 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1628 transitions. [2019-12-27 00:15:31,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 00:15:31,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:15:31,826 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] [2019-12-27 00:15:31,826 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:15:31,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:15:31,826 INFO L82 PathProgramCache]: Analyzing trace with hash -635782706, now seen corresponding path program 1 times [2019-12-27 00:15:31,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:15:31,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639273481] [2019-12-27 00:15:31,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:15:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:15:31,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:15:31,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639273481] [2019-12-27 00:15:31,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:15:31,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:15:31,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234207582] [2019-12-27 00:15:31,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:15:31,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:15:31,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:15:31,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:15:31,963 INFO L87 Difference]: Start difference. First operand 722 states and 1628 transitions. Second operand 3 states. [2019-12-27 00:15:31,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:15:31,976 INFO L93 Difference]: Finished difference Result 1140 states and 2599 transitions. [2019-12-27 00:15:31,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:15:31,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 00:15:31,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:15:31,980 INFO L225 Difference]: With dead ends: 1140 [2019-12-27 00:15:31,980 INFO L226 Difference]: Without dead ends: 438 [2019-12-27 00:15:31,980 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 00:15:31,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-12-27 00:15:31,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2019-12-27 00:15:31,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-12-27 00:15:31,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1004 transitions. [2019-12-27 00:15:31,992 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1004 transitions. Word has length 41 [2019-12-27 00:15:31,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:15:31,992 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 1004 transitions. [2019-12-27 00:15:31,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:15:31,993 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1004 transitions. [2019-12-27 00:15:31,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 00:15:31,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:15:31,995 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] [2019-12-27 00:15:31,995 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:15:31,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:15:31,995 INFO L82 PathProgramCache]: Analyzing trace with hash 822694706, now seen corresponding path program 2 times [2019-12-27 00:15:31,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:15:31,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091555282] [2019-12-27 00:15:31,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:15:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:15:32,069 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 00:15:32,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091555282] [2019-12-27 00:15:32,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:15:32,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:15:32,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673932875] [2019-12-27 00:15:32,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:15:32,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:15:32,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:15:32,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:15:32,071 INFO L87 Difference]: Start difference. First operand 438 states and 1004 transitions. Second operand 6 states. [2019-12-27 00:15:32,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:15:32,223 INFO L93 Difference]: Finished difference Result 797 states and 1782 transitions. [2019-12-27 00:15:32,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 00:15:32,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 00:15:32,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:15:32,229 INFO L225 Difference]: With dead ends: 797 [2019-12-27 00:15:32,229 INFO L226 Difference]: Without dead ends: 535 [2019-12-27 00:15:32,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 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 00:15:32,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-12-27 00:15:32,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 461. [2019-12-27 00:15:32,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-12-27 00:15:32,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1034 transitions. [2019-12-27 00:15:32,244 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 1034 transitions. Word has length 41 [2019-12-27 00:15:32,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:15:32,247 INFO L462 AbstractCegarLoop]: Abstraction has 461 states and 1034 transitions. [2019-12-27 00:15:32,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:15:32,247 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 1034 transitions. [2019-12-27 00:15:32,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 00:15:32,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:15:32,249 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] [2019-12-27 00:15:32,249 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:15:32,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:15:32,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1004168232, now seen corresponding path program 3 times [2019-12-27 00:15:32,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:15:32,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814601227] [2019-12-27 00:15:32,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:15:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:15:32,441 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 00:15:32,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814601227] [2019-12-27 00:15:32,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:15:32,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 00:15:32,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704055128] [2019-12-27 00:15:32,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 00:15:32,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:15:32,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 00:15:32,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 00:15:32,444 INFO L87 Difference]: Start difference. First operand 461 states and 1034 transitions. Second operand 8 states. [2019-12-27 00:15:32,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:15:32,912 INFO L93 Difference]: Finished difference Result 705 states and 1447 transitions. [2019-12-27 00:15:32,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 00:15:32,913 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-12-27 00:15:32,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:15:32,920 INFO L225 Difference]: With dead ends: 705 [2019-12-27 00:15:32,920 INFO L226 Difference]: Without dead ends: 705 [2019-12-27 00:15:32,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:15:32,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-12-27 00:15:32,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 582. [2019-12-27 00:15:32,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-12-27 00:15:32,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 1226 transitions. [2019-12-27 00:15:32,950 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 1226 transitions. Word has length 41 [2019-12-27 00:15:32,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:15:32,951 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 1226 transitions. [2019-12-27 00:15:32,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 00:15:32,951 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 1226 transitions. [2019-12-27 00:15:32,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 00:15:32,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:15:32,953 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:15:32,954 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:15:32,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:15:32,954 INFO L82 PathProgramCache]: Analyzing trace with hash 2141087868, now seen corresponding path program 1 times [2019-12-27 00:15:32,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:15:32,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641618654] [2019-12-27 00:15:32,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:15:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:15:33,008 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 00:15:33,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641618654] [2019-12-27 00:15:33,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:15:33,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:15:33,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721720613] [2019-12-27 00:15:33,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:15:33,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:15:33,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:15:33,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:15:33,011 INFO L87 Difference]: Start difference. First operand 582 states and 1226 transitions. Second operand 3 states. [2019-12-27 00:15:33,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:15:33,049 INFO L93 Difference]: Finished difference Result 653 states and 1281 transitions. [2019-12-27 00:15:33,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:15:33,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 00:15:33,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:15:33,053 INFO L225 Difference]: With dead ends: 653 [2019-12-27 00:15:33,053 INFO L226 Difference]: Without dead ends: 653 [2019-12-27 00:15:33,054 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 00:15:33,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-12-27 00:15:33,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 575. [2019-12-27 00:15:33,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-12-27 00:15:33,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1142 transitions. [2019-12-27 00:15:33,070 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1142 transitions. Word has length 41 [2019-12-27 00:15:33,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:15:33,070 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1142 transitions. [2019-12-27 00:15:33,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:15:33,071 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1142 transitions. [2019-12-27 00:15:33,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 00:15:33,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:15:33,074 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] [2019-12-27 00:15:33,074 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:15:33,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:15:33,074 INFO L82 PathProgramCache]: Analyzing trace with hash 910051156, now seen corresponding path program 4 times [2019-12-27 00:15:33,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:15:33,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366863487] [2019-12-27 00:15:33,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:15:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:15:33,278 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 00:15:33,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366863487] [2019-12-27 00:15:33,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:15:33,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 00:15:33,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147464550] [2019-12-27 00:15:33,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:15:33,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:15:33,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:15:33,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:15:33,280 INFO L87 Difference]: Start difference. First operand 575 states and 1142 transitions. Second operand 9 states. [2019-12-27 00:15:33,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:15:33,975 INFO L93 Difference]: Finished difference Result 1278 states and 2500 transitions. [2019-12-27 00:15:33,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 00:15:33,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-12-27 00:15:33,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:15:33,981 INFO L225 Difference]: With dead ends: 1278 [2019-12-27 00:15:33,982 INFO L226 Difference]: Without dead ends: 1042 [2019-12-27 00:15:33,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-27 00:15:33,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2019-12-27 00:15:33,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 575. [2019-12-27 00:15:33,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-12-27 00:15:33,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1135 transitions. [2019-12-27 00:15:33,999 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1135 transitions. Word has length 41 [2019-12-27 00:15:33,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:15:33,999 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1135 transitions. [2019-12-27 00:15:33,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:15:33,999 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1135 transitions. [2019-12-27 00:15:34,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 00:15:34,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:15:34,001 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] [2019-12-27 00:15:34,001 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:15:34,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:15:34,002 INFO L82 PathProgramCache]: Analyzing trace with hash -20717114, now seen corresponding path program 5 times [2019-12-27 00:15:34,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:15:34,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771522857] [2019-12-27 00:15:34,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:15:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:15:34,082 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 00:15:34,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771522857] [2019-12-27 00:15:34,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:15:34,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 00:15:34,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67064881] [2019-12-27 00:15:34,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:15:34,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:15:34,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:15:34,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:15:34,085 INFO L87 Difference]: Start difference. First operand 575 states and 1135 transitions. Second operand 6 states. [2019-12-27 00:15:34,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:15:34,459 INFO L93 Difference]: Finished difference Result 822 states and 1604 transitions. [2019-12-27 00:15:34,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 00:15:34,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 00:15:34,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:15:34,464 INFO L225 Difference]: With dead ends: 822 [2019-12-27 00:15:34,464 INFO L226 Difference]: Without dead ends: 822 [2019-12-27 00:15:34,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 00:15:34,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2019-12-27 00:15:34,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 599. [2019-12-27 00:15:34,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-12-27 00:15:34,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1188 transitions. [2019-12-27 00:15:34,478 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1188 transitions. Word has length 41 [2019-12-27 00:15:34,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:15:34,479 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 1188 transitions. [2019-12-27 00:15:34,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:15:34,479 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1188 transitions. [2019-12-27 00:15:34,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 00:15:34,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:15:34,481 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] [2019-12-27 00:15:34,481 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:15:34,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:15:34,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1415185578, now seen corresponding path program 6 times [2019-12-27 00:15:34,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:15:34,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484921039] [2019-12-27 00:15:34,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:15:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:15:34,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:15:34,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484921039] [2019-12-27 00:15:34,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:15:34,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:15:34,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219300747] [2019-12-27 00:15:34,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:15:34,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:15:34,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:15:34,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:15:34,554 INFO L87 Difference]: Start difference. First operand 599 states and 1188 transitions. Second operand 3 states. [2019-12-27 00:15:34,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:15:34,565 INFO L93 Difference]: Finished difference Result 599 states and 1186 transitions. [2019-12-27 00:15:34,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:15:34,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 00:15:34,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:15:34,567 INFO L225 Difference]: With dead ends: 599 [2019-12-27 00:15:34,568 INFO L226 Difference]: Without dead ends: 599 [2019-12-27 00:15:34,568 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 00:15:34,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-12-27 00:15:34,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 507. [2019-12-27 00:15:34,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-12-27 00:15:34,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 1013 transitions. [2019-12-27 00:15:34,579 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 1013 transitions. Word has length 41 [2019-12-27 00:15:34,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:15:34,580 INFO L462 AbstractCegarLoop]: Abstraction has 507 states and 1013 transitions. [2019-12-27 00:15:34,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:15:34,580 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 1013 transitions. [2019-12-27 00:15:34,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 00:15:34,581 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:15:34,582 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] [2019-12-27 00:15:34,582 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:15:34,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:15:34,582 INFO L82 PathProgramCache]: Analyzing trace with hash -296631181, now seen corresponding path program 1 times [2019-12-27 00:15:34,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:15:34,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807189107] [2019-12-27 00:15:34,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:15:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:15:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:15:34,705 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:15:34,705 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:15:34,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] ULTIMATE.startENTRY-->L790: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= v_~x$mem_tmp~0_13 0) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~x$w_buff1~0_407) (= v_~x$r_buff1_thd1~0_273 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2567~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2567~0.base_24|) |v_ULTIMATE.start_main_~#t2567~0.offset_18| 0)) |v_#memory_int_11|) (= 0 v_~x$r_buff0_thd2~0_163) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2567~0.base_24| 4)) (= v_~x$r_buff0_thd0~0_130 0) (= v_~y~0_90 0) (= |v_ULTIMATE.start_main_~#t2567~0.offset_18| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2567~0.base_24|) 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff0~0_579) (= 0 v_~x$w_buff1_used~0_600) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t2567~0.base_24| 1)) (= 0 v_~x$read_delayed~0_7) (= 0 v_~__unbuffered_cnt~0_87) (= 0 v_~x$w_buff0_used~0_867) (= v_~weak$$choice2~0_185 0) (= 0 v_~__unbuffered_p0_EAX~0_64) (= v_~x$r_buff0_thd1~0_344 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x$flush_delayed~0_42 0) (= 0 v_~x~0_132) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_22 0) (= v_~x$r_buff1_thd0~0_139 0) (= 0 v_~x$r_buff1_thd2~0_124) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2567~0.base_24|) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_579, ULTIMATE.start_main_~#t2568~0.base=|v_ULTIMATE.start_main_~#t2568~0.base_25|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_344, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_42, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_273, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, #length=|v_#length_15|, ~y~0=v_~y~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ~x$w_buff1~0=v_~x$w_buff1~0_407, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_75|, ULTIMATE.start_main_~#t2567~0.base=|v_ULTIMATE.start_main_~#t2567~0.base_24|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_85|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_600, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_124, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_45|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_47|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_139, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_163, ULTIMATE.start_main_~#t2568~0.offset=|v_ULTIMATE.start_main_~#t2568~0.offset_18|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_53|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_867, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~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_47|, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ULTIMATE.start_main_~#t2567~0.offset=|v_ULTIMATE.start_main_~#t2567~0.offset_18|, ~weak$$choice2~0=v_~weak$$choice2~0_185, ~x~0=v_~x~0_132, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2568~0.base, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t2567~0.base, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2568~0.offset, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2567~0.offset, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 00:15:34,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L790-1-->L792: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2568~0.base_11| 4) |v_#length_9|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2568~0.base_11| 1)) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2568~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2568~0.base_11|) |v_ULTIMATE.start_main_~#t2568~0.offset_9| 1))) (= 0 |v_ULTIMATE.start_main_~#t2568~0.offset_9|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2568~0.base_11|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2568~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t2568~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t2568~0.base=|v_ULTIMATE.start_main_~#t2568~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2568~0.offset=|v_ULTIMATE.start_main_~#t2568~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2568~0.base, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2568~0.offset] because there is no mapped edge [2019-12-27 00:15:34,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [571] [571] L5-->L767: Formula: (and (= v_~x$r_buff1_thd0~0_14 v_~x$r_buff0_thd0~0_20) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_6) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_22 0)) (= 1 v_~x$r_buff0_thd2~0_15) (= v_~x$r_buff1_thd1~0_21 v_~x$r_buff0_thd1~0_41)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_22, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_22, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_14} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 00:15:34,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L733-->L733-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1974490697 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite9_Out-1974490697| |P0Thread1of1ForFork1_#t~ite8_Out-1974490697|) (= ~x$w_buff0~0_In-1974490697 |P0Thread1of1ForFork1_#t~ite8_Out-1974490697|) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-1974490697 256) 0))) (or (and (= (mod ~x$r_buff1_thd1~0_In-1974490697 256) 0) .cse0) (= 0 (mod ~x$w_buff0_used~0_In-1974490697 256)) (and (= (mod ~x$w_buff1_used~0_In-1974490697 256) 0) .cse0))) .cse1) (and (not .cse1) (= |P0Thread1of1ForFork1_#t~ite9_Out-1974490697| ~x$w_buff0~0_In-1974490697) (= |P0Thread1of1ForFork1_#t~ite8_In-1974490697| |P0Thread1of1ForFork1_#t~ite8_Out-1974490697|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1974490697, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1974490697, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_In-1974490697|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1974490697, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1974490697, ~weak$$choice2~0=~weak$$choice2~0_In-1974490697, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1974490697} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1974490697, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1974490697, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1974490697|, P0Thread1of1ForFork1_#t~ite9=|P0Thread1of1ForFork1_#t~ite9_Out-1974490697|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1974490697, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1974490697, ~weak$$choice2~0=~weak$$choice2~0_In-1974490697, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1974490697} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 00:15:34,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L737-->L738: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_16|, ~weak$$choice2~0=v_~weak$$choice2~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 00:15:34,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L740-->L748: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~x$mem_tmp~0_4 v_~x~0_29) (= v_~x$flush_delayed~0_15 0) (not (= (mod v_~x$flush_delayed~0_16 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_21|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 00:15:34,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [626] [626] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1676085141 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1676085141 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out1676085141| ~x$w_buff0_used~0_In1676085141) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1676085141|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1676085141, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1676085141} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1676085141, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1676085141|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1676085141} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 00:15:34,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L769-->L769-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In786025418 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In786025418 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In786025418 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In786025418 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out786025418| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out786025418| ~x$w_buff1_used~0_In786025418)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In786025418, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In786025418, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In786025418, ~x$w_buff0_used~0=~x$w_buff0_used~0_In786025418} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In786025418, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In786025418, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In786025418, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out786025418|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In786025418} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 00:15:34,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L770-->L771: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-751477572 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-751477572 256)))) (or (and (= ~x$r_buff0_thd2~0_In-751477572 ~x$r_buff0_thd2~0_Out-751477572) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-751477572) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-751477572, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-751477572} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-751477572|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-751477572, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-751477572} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 00:15:34,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L771-->L771-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In773773950 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In773773950 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In773773950 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In773773950 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In773773950 |P1Thread1of1ForFork0_#t~ite31_Out773773950|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out773773950|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In773773950, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In773773950, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In773773950, ~x$w_buff0_used~0=~x$w_buff0_used~0_In773773950} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out773773950|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In773773950, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In773773950, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In773773950, ~x$w_buff0_used~0=~x$w_buff0_used~0_In773773950} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 00:15:34,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L771-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_58 |v_P1Thread1of1ForFork0_#t~ite31_36|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_35|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_58, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 00:15:34,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [573] [573] L792-1-->L798: Formula: (and (= 2 v_~__unbuffered_cnt~0_11) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 00:15:34,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L798-2-->L798-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite35_Out1034716323| |ULTIMATE.start_main_#t~ite34_Out1034716323|)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1034716323 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In1034716323 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= ~x~0_In1034716323 |ULTIMATE.start_main_#t~ite34_Out1034716323|)) (and .cse0 (not .cse1) (= ~x$w_buff1~0_In1034716323 |ULTIMATE.start_main_#t~ite34_Out1034716323|) (not .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1034716323, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1034716323, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1034716323, ~x~0=~x~0_In1034716323} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1034716323, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1034716323|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1034716323, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1034716323, ~x~0=~x~0_In1034716323, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1034716323|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 00:15:34,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1166760675 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1166760675 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite36_Out1166760675|)) (and (= |ULTIMATE.start_main_#t~ite36_Out1166760675| ~x$w_buff0_used~0_In1166760675) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1166760675, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1166760675} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1166760675, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1166760675|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1166760675} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 00:15:34,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L800-->L800-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd0~0_In1112759340 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1112759340 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1112759340 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1112759340 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite37_Out1112759340| 0)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite37_Out1112759340| ~x$w_buff1_used~0_In1112759340) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1112759340, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1112759340, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1112759340, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1112759340} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1112759340, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1112759340, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1112759340|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1112759340, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1112759340} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 00:15:34,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [632] [632] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-334748615 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-334748615 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-334748615| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-334748615| ~x$r_buff0_thd0~0_In-334748615)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-334748615, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-334748615} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-334748615, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-334748615|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-334748615} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 00:15:34,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L802-->L802-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-457622434 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-457622434 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-457622434 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-457622434 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out-457622434| 0)) (and (= |ULTIMATE.start_main_#t~ite39_Out-457622434| ~x$r_buff1_thd0~0_In-457622434) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-457622434, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-457622434, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-457622434, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-457622434} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-457622434, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-457622434|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-457622434, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-457622434, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-457622434} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 00:15:34,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L802-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_22 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~y~0_54 2) (= v_~x$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite39_53|) (= 0 v_~__unbuffered_p0_EAX~0_44) (= v_~main$tmp_guard1~0_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_53|, ~y~0=v_~y~0_54} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_52|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~y~0=v_~y~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_101, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 00:15:34,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:15:34 BasicIcfg [2019-12-27 00:15:34,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 00:15:34,820 INFO L168 Benchmark]: Toolchain (without parser) took 12706.38 ms. Allocated memory was 146.8 MB in the beginning and 358.6 MB in the end (delta: 211.8 MB). Free memory was 101.1 MB in the beginning and 76.1 MB in the end (delta: 25.0 MB). Peak memory consumption was 236.8 MB. Max. memory is 7.1 GB. [2019-12-27 00:15:34,820 INFO L168 Benchmark]: CDTParser took 1.51 ms. Allocated memory is still 146.8 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 00:15:34,821 INFO L168 Benchmark]: CACSL2BoogieTranslator took 829.12 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 158.6 MB in the end (delta: -57.9 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-27 00:15:34,822 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.52 ms. Allocated memory is still 204.5 MB. Free memory was 158.0 MB in the beginning and 155.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 00:15:34,823 INFO L168 Benchmark]: Boogie Preprocessor took 36.82 ms. Allocated memory is still 204.5 MB. Free memory was 155.5 MB in the beginning and 153.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 00:15:34,823 INFO L168 Benchmark]: RCFGBuilder took 708.34 ms. Allocated memory is still 204.5 MB. Free memory was 153.6 MB in the beginning and 113.1 MB in the end (delta: 40.5 MB). Peak memory consumption was 40.5 MB. Max. memory is 7.1 GB. [2019-12-27 00:15:34,824 INFO L168 Benchmark]: TraceAbstraction took 11060.85 ms. Allocated memory was 204.5 MB in the beginning and 358.6 MB in the end (delta: 154.1 MB). Free memory was 112.5 MB in the beginning and 76.1 MB in the end (delta: 36.4 MB). Peak memory consumption was 190.5 MB. Max. memory is 7.1 GB. [2019-12-27 00:15:34,831 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.51 ms. Allocated memory is still 146.8 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 829.12 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 158.6 MB in the end (delta: -57.9 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.52 ms. Allocated memory is still 204.5 MB. Free memory was 158.0 MB in the beginning and 155.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.82 ms. Allocated memory is still 204.5 MB. Free memory was 155.5 MB in the beginning and 153.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 708.34 ms. Allocated memory is still 204.5 MB. Free memory was 153.6 MB in the beginning and 113.1 MB in the end (delta: 40.5 MB). Peak memory consumption was 40.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11060.85 ms. Allocated memory was 204.5 MB in the beginning and 358.6 MB in the end (delta: 154.1 MB). Free memory was 112.5 MB in the beginning and 76.1 MB in the end (delta: 36.4 MB). Peak memory consumption was 190.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 134 ProgramPointsBefore, 66 ProgramPointsAfterwards, 162 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 19 ChoiceCompositions, 4187 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 93 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 40283 CheckedPairsTotal, 100 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L790] FCALL, FORK 0 pthread_create(&t2567, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L792] FCALL, FORK 0 pthread_create(&t2568, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] 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 [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)=5, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L734] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L735] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L738] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 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) [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 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 [L798] 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 [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 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) [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 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 [L801] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 128 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.7s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1362 SDtfs, 1373 SDslu, 2346 SDs, 0 SdLazy, 1422 SolverSat, 117 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6362occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 2118 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 358 ConstructedInterpolants, 0 QuantifiedInterpolants, 40384 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...