/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/mix022_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:49:29,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:49:29,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:49:29,800 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:49:29,801 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:49:29,804 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:49:29,805 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:49:29,809 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:49:29,812 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:49:29,813 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:49:29,820 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:49:29,823 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:49:29,823 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:49:29,826 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:49:29,827 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:49:29,828 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:49:29,830 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:49:29,831 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:49:29,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:49:29,837 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:49:29,838 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:49:29,839 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:49:29,840 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:49:29,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:49:29,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:49:29,844 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:49:29,844 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:49:29,845 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:49:29,845 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:49:29,846 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:49:29,846 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:49:29,847 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:49:29,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:49:29,848 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:49:29,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:49:29,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:49:29,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:49:29,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:49:29,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:49:29,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:49:29,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:49:29,855 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-18 12:49:29,878 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:49:29,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:49:29,880 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:49:29,880 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:49:29,880 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:49:29,881 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:49:29,881 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:49:29,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:49:29,881 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:49:29,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:49:29,882 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:49:29,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:49:29,882 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:49:29,882 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:49:29,882 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:49:29,882 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:49:29,883 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:49:29,883 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:49:29,883 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:49:29,883 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:49:29,883 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:49:29,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:49:29,884 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:49:29,884 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:49:29,884 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:49:29,885 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:49:29,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:49:29,885 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:49:29,885 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:49:29,885 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:49:30,193 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:49:30,216 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:49:30,220 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:49:30,224 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:49:30,224 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:49:30,225 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_rmo.opt.i [2019-12-18 12:49:30,298 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d75b8a2aa/6b9bd8587d384414a5b270df7503bbd3/FLAG0df3f71b5 [2019-12-18 12:49:30,898 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:49:30,899 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_rmo.opt.i [2019-12-18 12:49:30,917 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d75b8a2aa/6b9bd8587d384414a5b270df7503bbd3/FLAG0df3f71b5 [2019-12-18 12:49:31,137 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d75b8a2aa/6b9bd8587d384414a5b270df7503bbd3 [2019-12-18 12:49:31,149 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:49:31,151 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:49:31,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:49:31,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:49:31,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:49:31,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:49:31" (1/1) ... [2019-12-18 12:49:31,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56d76d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:31, skipping insertion in model container [2019-12-18 12:49:31,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:49:31" (1/1) ... [2019-12-18 12:49:31,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:49:31,234 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:49:31,761 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:49:31,777 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:49:31,838 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:49:31,924 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:49:31,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:31 WrapperNode [2019-12-18 12:49:31,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:49:31,925 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:49:31,925 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:49:31,925 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:49:31,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:31" (1/1) ... [2019-12-18 12:49:31,954 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:31" (1/1) ... [2019-12-18 12:49:32,003 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:49:32,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:49:32,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:49:32,003 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:49:32,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:31" (1/1) ... [2019-12-18 12:49:32,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:31" (1/1) ... [2019-12-18 12:49:32,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:31" (1/1) ... [2019-12-18 12:49:32,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:31" (1/1) ... [2019-12-18 12:49:32,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:31" (1/1) ... [2019-12-18 12:49:32,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:31" (1/1) ... [2019-12-18 12:49:32,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:31" (1/1) ... [2019-12-18 12:49:32,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:49:32,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:49:32,039 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:49:32,039 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:49:32,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:49:32,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:49:32,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:49:32,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:49:32,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:49:32,108 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:49:32,108 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:49:32,108 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:49:32,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:49:32,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:49:32,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:49:32,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:49:32,111 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:49:32,837 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:49:32,837 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:49:32,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:49:32 BoogieIcfgContainer [2019-12-18 12:49:32,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:49:32,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:49:32,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:49:32,843 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:49:32,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:49:31" (1/3) ... [2019-12-18 12:49:32,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22569807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:49:32, skipping insertion in model container [2019-12-18 12:49:32,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:49:31" (2/3) ... [2019-12-18 12:49:32,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22569807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:49:32, skipping insertion in model container [2019-12-18 12:49:32,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:49:32" (3/3) ... [2019-12-18 12:49:32,849 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_rmo.opt.i [2019-12-18 12:49:32,860 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:49:32,860 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:49:32,874 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:49:32,875 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:49:32,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,913 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,913 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,914 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,914 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,915 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,925 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,925 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,958 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,958 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,959 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,966 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,971 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:49:32,990 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 12:49:33,030 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:49:33,031 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:49:33,031 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:49:33,031 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:49:33,031 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:49:33,031 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:49:33,032 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:49:33,032 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:49:33,055 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 12:49:33,057 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 12:49:33,146 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 12:49:33,146 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:49:33,165 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 12:49:33,187 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 12:49:33,238 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 12:49:33,238 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:49:33,244 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 12:49:33,258 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 12:49:33,259 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:49:38,364 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 12:49:38,518 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47763 [2019-12-18 12:49:38,518 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-18 12:49:38,521 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 87 transitions [2019-12-18 12:49:38,973 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-18 12:49:38,976 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-18 12:49:38,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:49:38,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:38,983 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:49:38,983 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:38,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:38,990 INFO L82 PathProgramCache]: Analyzing trace with hash 789332, now seen corresponding path program 1 times [2019-12-18 12:49:38,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:38,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019486340] [2019-12-18 12:49:38,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:39,226 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-18 12:49:39,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019486340] [2019-12-18 12:49:39,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:39,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:49:39,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728294293] [2019-12-18 12:49:39,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:49:39,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:39,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:49:39,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:49:39,248 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-18 12:49:39,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:39,550 INFO L93 Difference]: Finished difference Result 8468 states and 27386 transitions. [2019-12-18 12:49:39,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:49:39,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:49:39,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:39,699 INFO L225 Difference]: With dead ends: 8468 [2019-12-18 12:49:39,699 INFO L226 Difference]: Without dead ends: 7976 [2019-12-18 12:49:39,701 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-18 12:49:39,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states. [2019-12-18 12:49:40,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 7976. [2019-12-18 12:49:40,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7976 states. [2019-12-18 12:49:40,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7976 states to 7976 states and 25749 transitions. [2019-12-18 12:49:40,129 INFO L78 Accepts]: Start accepts. Automaton has 7976 states and 25749 transitions. Word has length 3 [2019-12-18 12:49:40,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:40,130 INFO L462 AbstractCegarLoop]: Abstraction has 7976 states and 25749 transitions. [2019-12-18 12:49:40,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:49:40,130 INFO L276 IsEmpty]: Start isEmpty. Operand 7976 states and 25749 transitions. [2019-12-18 12:49:40,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:49:40,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:40,136 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:49:40,137 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:40,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:40,137 INFO L82 PathProgramCache]: Analyzing trace with hash -374477309, now seen corresponding path program 1 times [2019-12-18 12:49:40,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:40,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476433928] [2019-12-18 12:49:40,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:40,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:40,333 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-18 12:49:40,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476433928] [2019-12-18 12:49:40,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:40,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:49:40,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257721670] [2019-12-18 12:49:40,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:49:40,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:40,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:49:40,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:49:40,336 INFO L87 Difference]: Start difference. First operand 7976 states and 25749 transitions. Second operand 4 states. [2019-12-18 12:49:40,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:40,421 INFO L93 Difference]: Finished difference Result 1834 states and 4623 transitions. [2019-12-18 12:49:40,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:49:40,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:49:40,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:40,431 INFO L225 Difference]: With dead ends: 1834 [2019-12-18 12:49:40,431 INFO L226 Difference]: Without dead ends: 1342 [2019-12-18 12:49:40,432 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-18 12:49:40,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2019-12-18 12:49:40,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1342. [2019-12-18 12:49:40,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-12-18 12:49:40,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 3045 transitions. [2019-12-18 12:49:40,474 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 3045 transitions. Word has length 11 [2019-12-18 12:49:40,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:40,474 INFO L462 AbstractCegarLoop]: Abstraction has 1342 states and 3045 transitions. [2019-12-18 12:49:40,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:49:40,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 3045 transitions. [2019-12-18 12:49:40,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 12:49:40,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:40,477 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:49:40,477 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:40,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:40,477 INFO L82 PathProgramCache]: Analyzing trace with hash 56348668, now seen corresponding path program 1 times [2019-12-18 12:49:40,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:40,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329633284] [2019-12-18 12:49:40,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:40,564 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-18 12:49:40,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329633284] [2019-12-18 12:49:40,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:40,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:49:40,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281462829] [2019-12-18 12:49:40,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:49:40,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:40,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:49:40,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:49:40,567 INFO L87 Difference]: Start difference. First operand 1342 states and 3045 transitions. Second operand 4 states. [2019-12-18 12:49:40,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:40,857 INFO L93 Difference]: Finished difference Result 1673 states and 3729 transitions. [2019-12-18 12:49:40,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:49:40,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 12:49:40,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:40,867 INFO L225 Difference]: With dead ends: 1673 [2019-12-18 12:49:40,867 INFO L226 Difference]: Without dead ends: 1673 [2019-12-18 12:49:40,868 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-18 12:49:40,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2019-12-18 12:49:40,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1609. [2019-12-18 12:49:40,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2019-12-18 12:49:40,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 3605 transitions. [2019-12-18 12:49:40,916 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 3605 transitions. Word has length 14 [2019-12-18 12:49:40,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:40,917 INFO L462 AbstractCegarLoop]: Abstraction has 1609 states and 3605 transitions. [2019-12-18 12:49:40,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:49:40,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 3605 transitions. [2019-12-18 12:49:40,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:49:40,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:40,920 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:49:40,920 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:40,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:40,921 INFO L82 PathProgramCache]: Analyzing trace with hash -139254967, now seen corresponding path program 1 times [2019-12-18 12:49:40,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:40,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085136780] [2019-12-18 12:49:40,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:41,106 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-18 12:49:41,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085136780] [2019-12-18 12:49:41,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:41,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:49:41,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361802153] [2019-12-18 12:49:41,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:49:41,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:41,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:49:41,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:49:41,110 INFO L87 Difference]: Start difference. First operand 1609 states and 3605 transitions. Second operand 6 states. [2019-12-18 12:49:41,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:41,798 INFO L93 Difference]: Finished difference Result 4481 states and 9905 transitions. [2019-12-18 12:49:41,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:49:41,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 12:49:41,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:41,823 INFO L225 Difference]: With dead ends: 4481 [2019-12-18 12:49:41,823 INFO L226 Difference]: Without dead ends: 4446 [2019-12-18 12:49:41,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:49:41,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4446 states. [2019-12-18 12:49:41,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4446 to 2169. [2019-12-18 12:49:41,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2169 states. [2019-12-18 12:49:41,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 4909 transitions. [2019-12-18 12:49:41,904 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 4909 transitions. Word has length 25 [2019-12-18 12:49:41,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:41,905 INFO L462 AbstractCegarLoop]: Abstraction has 2169 states and 4909 transitions. [2019-12-18 12:49:41,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:49:41,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 4909 transitions. [2019-12-18 12:49:41,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 12:49:41,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:41,909 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-18 12:49:41,909 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:41,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:41,909 INFO L82 PathProgramCache]: Analyzing trace with hash -662536504, now seen corresponding path program 1 times [2019-12-18 12:49:41,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:41,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790000270] [2019-12-18 12:49:41,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:41,964 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-18 12:49:41,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790000270] [2019-12-18 12:49:41,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:41,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:49:41,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600098686] [2019-12-18 12:49:41,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:49:41,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:41,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:49:41,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:49:41,966 INFO L87 Difference]: Start difference. First operand 2169 states and 4909 transitions. Second operand 3 states. [2019-12-18 12:49:41,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:41,988 INFO L93 Difference]: Finished difference Result 2168 states and 4907 transitions. [2019-12-18 12:49:41,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:49:41,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 12:49:41,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:42,014 INFO L225 Difference]: With dead ends: 2168 [2019-12-18 12:49:42,015 INFO L226 Difference]: Without dead ends: 2168 [2019-12-18 12:49:42,015 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-18 12:49:42,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2019-12-18 12:49:42,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2168. [2019-12-18 12:49:42,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2168 states. [2019-12-18 12:49:42,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 4907 transitions. [2019-12-18 12:49:42,069 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 4907 transitions. Word has length 26 [2019-12-18 12:49:42,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:42,070 INFO L462 AbstractCegarLoop]: Abstraction has 2168 states and 4907 transitions. [2019-12-18 12:49:42,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:49:42,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 4907 transitions. [2019-12-18 12:49:42,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 12:49:42,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:42,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] [2019-12-18 12:49:42,074 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:42,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:42,074 INFO L82 PathProgramCache]: Analyzing trace with hash 2133801578, now seen corresponding path program 1 times [2019-12-18 12:49:42,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:42,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858335791] [2019-12-18 12:49:42,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:42,193 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-18 12:49:42,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858335791] [2019-12-18 12:49:42,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:42,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:49:42,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053779011] [2019-12-18 12:49:42,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:49:42,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:42,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:49:42,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:49:42,196 INFO L87 Difference]: Start difference. First operand 2168 states and 4907 transitions. Second operand 6 states. [2019-12-18 12:49:42,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:42,901 INFO L93 Difference]: Finished difference Result 4358 states and 9517 transitions. [2019-12-18 12:49:42,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:49:42,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-18 12:49:42,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:42,912 INFO L225 Difference]: With dead ends: 4358 [2019-12-18 12:49:42,913 INFO L226 Difference]: Without dead ends: 4329 [2019-12-18 12:49:42,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:49:42,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4329 states. [2019-12-18 12:49:42,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4329 to 2043. [2019-12-18 12:49:42,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2043 states. [2019-12-18 12:49:42,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 2043 states and 4651 transitions. [2019-12-18 12:49:42,980 INFO L78 Accepts]: Start accepts. Automaton has 2043 states and 4651 transitions. Word has length 26 [2019-12-18 12:49:42,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:42,981 INFO L462 AbstractCegarLoop]: Abstraction has 2043 states and 4651 transitions. [2019-12-18 12:49:42,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:49:42,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2043 states and 4651 transitions. [2019-12-18 12:49:42,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:49:42,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:42,984 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:49:42,984 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:42,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:42,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1022467216, now seen corresponding path program 1 times [2019-12-18 12:49:42,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:42,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127005167] [2019-12-18 12:49:42,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:43,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:49:43,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127005167] [2019-12-18 12:49:43,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:43,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:49:43,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984682655] [2019-12-18 12:49:43,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:49:43,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:43,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:49:43,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:49:43,025 INFO L87 Difference]: Start difference. First operand 2043 states and 4651 transitions. Second operand 3 states. [2019-12-18 12:49:43,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:43,045 INFO L93 Difference]: Finished difference Result 3738 states and 8517 transitions. [2019-12-18 12:49:43,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:49:43,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 12:49:43,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:43,052 INFO L225 Difference]: With dead ends: 3738 [2019-12-18 12:49:43,052 INFO L226 Difference]: Without dead ends: 1966 [2019-12-18 12:49:43,052 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-18 12:49:43,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2019-12-18 12:49:43,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1950. [2019-12-18 12:49:43,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2019-12-18 12:49:43,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 4342 transitions. [2019-12-18 12:49:43,093 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 4342 transitions. Word has length 27 [2019-12-18 12:49:43,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:43,094 INFO L462 AbstractCegarLoop]: Abstraction has 1950 states and 4342 transitions. [2019-12-18 12:49:43,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:49:43,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 4342 transitions. [2019-12-18 12:49:43,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:49:43,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:43,097 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:49:43,097 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:43,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:43,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1564138658, now seen corresponding path program 2 times [2019-12-18 12:49:43,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:43,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509810488] [2019-12-18 12:49:43,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:43,196 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-18 12:49:43,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509810488] [2019-12-18 12:49:43,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:43,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:49:43,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109433146] [2019-12-18 12:49:43,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:49:43,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:43,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:49:43,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:49:43,201 INFO L87 Difference]: Start difference. First operand 1950 states and 4342 transitions. Second operand 5 states. [2019-12-18 12:49:43,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:43,649 INFO L93 Difference]: Finished difference Result 2942 states and 6436 transitions. [2019-12-18 12:49:43,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:49:43,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 12:49:43,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:43,658 INFO L225 Difference]: With dead ends: 2942 [2019-12-18 12:49:43,658 INFO L226 Difference]: Without dead ends: 2942 [2019-12-18 12:49:43,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:49:43,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2019-12-18 12:49:43,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 2507. [2019-12-18 12:49:43,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2507 states. [2019-12-18 12:49:43,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 5550 transitions. [2019-12-18 12:49:43,716 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 5550 transitions. Word has length 27 [2019-12-18 12:49:43,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:43,716 INFO L462 AbstractCegarLoop]: Abstraction has 2507 states and 5550 transitions. [2019-12-18 12:49:43,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:49:43,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 5550 transitions. [2019-12-18 12:49:43,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:49:43,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:43,720 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:49:43,721 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:43,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:43,721 INFO L82 PathProgramCache]: Analyzing trace with hash -5510903, now seen corresponding path program 1 times [2019-12-18 12:49:43,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:43,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166414156] [2019-12-18 12:49:43,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:43,819 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-18 12:49:43,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166414156] [2019-12-18 12:49:43,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:43,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:49:43,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824862159] [2019-12-18 12:49:43,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:49:43,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:43,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:49:43,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:49:43,822 INFO L87 Difference]: Start difference. First operand 2507 states and 5550 transitions. Second operand 5 states. [2019-12-18 12:49:43,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:43,867 INFO L93 Difference]: Finished difference Result 1526 states and 3206 transitions. [2019-12-18 12:49:43,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:49:43,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 12:49:43,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:43,872 INFO L225 Difference]: With dead ends: 1526 [2019-12-18 12:49:43,872 INFO L226 Difference]: Without dead ends: 1282 [2019-12-18 12:49:43,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:49:43,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2019-12-18 12:49:43,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1187. [2019-12-18 12:49:43,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1187 states. [2019-12-18 12:49:43,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 2573 transitions. [2019-12-18 12:49:43,898 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 2573 transitions. Word has length 28 [2019-12-18 12:49:43,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:43,898 INFO L462 AbstractCegarLoop]: Abstraction has 1187 states and 2573 transitions. [2019-12-18 12:49:43,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:49:43,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 2573 transitions. [2019-12-18 12:49:43,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 12:49:43,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:43,902 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:49:43,902 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:43,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:43,903 INFO L82 PathProgramCache]: Analyzing trace with hash -282366580, now seen corresponding path program 1 times [2019-12-18 12:49:43,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:43,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572247078] [2019-12-18 12:49:43,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:43,982 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-18 12:49:43,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572247078] [2019-12-18 12:49:43,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:43,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:49:43,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308263722] [2019-12-18 12:49:43,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:49:43,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:43,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:49:43,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:49:43,984 INFO L87 Difference]: Start difference. First operand 1187 states and 2573 transitions. Second operand 7 states. [2019-12-18 12:49:44,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:44,173 INFO L93 Difference]: Finished difference Result 2079 states and 4404 transitions. [2019-12-18 12:49:44,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:49:44,173 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 12:49:44,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:44,178 INFO L225 Difference]: With dead ends: 2079 [2019-12-18 12:49:44,179 INFO L226 Difference]: Without dead ends: 1402 [2019-12-18 12:49:44,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:49:44,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2019-12-18 12:49:44,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1193. [2019-12-18 12:49:44,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2019-12-18 12:49:44,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 2562 transitions. [2019-12-18 12:49:44,244 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 2562 transitions. Word has length 51 [2019-12-18 12:49:44,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:44,244 INFO L462 AbstractCegarLoop]: Abstraction has 1193 states and 2562 transitions. [2019-12-18 12:49:44,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:49:44,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 2562 transitions. [2019-12-18 12:49:44,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 12:49:44,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:44,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:49:44,249 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:44,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:44,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1667743284, now seen corresponding path program 2 times [2019-12-18 12:49:44,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:44,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817579146] [2019-12-18 12:49:44,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:44,370 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-18 12:49:44,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817579146] [2019-12-18 12:49:44,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:44,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:49:44,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493311562] [2019-12-18 12:49:44,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:49:44,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:44,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:49:44,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:49:44,373 INFO L87 Difference]: Start difference. First operand 1193 states and 2562 transitions. Second operand 7 states. [2019-12-18 12:49:45,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:45,632 INFO L93 Difference]: Finished difference Result 2539 states and 5262 transitions. [2019-12-18 12:49:45,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:49:45,632 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 12:49:45,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:45,639 INFO L225 Difference]: With dead ends: 2539 [2019-12-18 12:49:45,639 INFO L226 Difference]: Without dead ends: 2539 [2019-12-18 12:49:45,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:49:45,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2019-12-18 12:49:45,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 1266. [2019-12-18 12:49:45,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2019-12-18 12:49:45,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 2729 transitions. [2019-12-18 12:49:45,676 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 2729 transitions. Word has length 51 [2019-12-18 12:49:45,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:45,676 INFO L462 AbstractCegarLoop]: Abstraction has 1266 states and 2729 transitions. [2019-12-18 12:49:45,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:49:45,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 2729 transitions. [2019-12-18 12:49:45,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 12:49:45,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:45,680 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:49:45,680 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:45,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:45,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1259363204, now seen corresponding path program 3 times [2019-12-18 12:49:45,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:45,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429309757] [2019-12-18 12:49:45,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:45,774 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-18 12:49:45,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429309757] [2019-12-18 12:49:45,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:45,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:49:45,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720243896] [2019-12-18 12:49:45,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:49:45,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:45,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:49:45,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:49:45,777 INFO L87 Difference]: Start difference. First operand 1266 states and 2729 transitions. Second operand 5 states. [2019-12-18 12:49:45,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:45,970 INFO L93 Difference]: Finished difference Result 1395 states and 2962 transitions. [2019-12-18 12:49:45,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:49:45,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-18 12:49:45,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:45,973 INFO L225 Difference]: With dead ends: 1395 [2019-12-18 12:49:45,973 INFO L226 Difference]: Without dead ends: 1395 [2019-12-18 12:49:45,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:49:45,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2019-12-18 12:49:45,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1274. [2019-12-18 12:49:45,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-12-18 12:49:45,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 2746 transitions. [2019-12-18 12:49:45,997 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 2746 transitions. Word has length 51 [2019-12-18 12:49:45,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:45,997 INFO L462 AbstractCegarLoop]: Abstraction has 1274 states and 2746 transitions. [2019-12-18 12:49:45,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:49:45,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 2746 transitions. [2019-12-18 12:49:46,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 12:49:46,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:49:46,001 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:46,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:46,002 INFO L82 PathProgramCache]: Analyzing trace with hash -878142292, now seen corresponding path program 4 times [2019-12-18 12:49:46,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:46,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145504583] [2019-12-18 12:49:46,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:46,106 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-18 12:49:46,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145504583] [2019-12-18 12:49:46,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:46,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:49:46,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745079347] [2019-12-18 12:49:46,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:49:46,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:46,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:49:46,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:49:46,108 INFO L87 Difference]: Start difference. First operand 1274 states and 2746 transitions. Second operand 3 states. [2019-12-18 12:49:46,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:46,139 INFO L93 Difference]: Finished difference Result 1273 states and 2744 transitions. [2019-12-18 12:49:46,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:49:46,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 12:49:46,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:46,142 INFO L225 Difference]: With dead ends: 1273 [2019-12-18 12:49:46,143 INFO L226 Difference]: Without dead ends: 1273 [2019-12-18 12:49:46,143 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-18 12:49:46,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2019-12-18 12:49:46,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1007. [2019-12-18 12:49:46,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2019-12-18 12:49:46,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 2197 transitions. [2019-12-18 12:49:46,163 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 2197 transitions. Word has length 51 [2019-12-18 12:49:46,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:46,165 INFO L462 AbstractCegarLoop]: Abstraction has 1007 states and 2197 transitions. [2019-12-18 12:49:46,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:49:46,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 2197 transitions. [2019-12-18 12:49:46,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 12:49:46,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:46,167 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:49:46,168 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:46,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:46,168 INFO L82 PathProgramCache]: Analyzing trace with hash 2078058895, now seen corresponding path program 1 times [2019-12-18 12:49:46,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:46,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358498378] [2019-12-18 12:49:46,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:49:46,371 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-18 12:49:46,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358498378] [2019-12-18 12:49:46,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:49:46,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:49:46,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457613128] [2019-12-18 12:49:46,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:49:46,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:49:46,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:49:46,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:49:46,375 INFO L87 Difference]: Start difference. First operand 1007 states and 2197 transitions. Second operand 5 states. [2019-12-18 12:49:46,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:49:46,437 INFO L93 Difference]: Finished difference Result 1234 states and 2673 transitions. [2019-12-18 12:49:46,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:49:46,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-18 12:49:46,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:49:46,440 INFO L225 Difference]: With dead ends: 1234 [2019-12-18 12:49:46,441 INFO L226 Difference]: Without dead ends: 1234 [2019-12-18 12:49:46,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:49:46,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2019-12-18 12:49:46,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 903. [2019-12-18 12:49:46,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-12-18 12:49:46,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1961 transitions. [2019-12-18 12:49:46,457 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1961 transitions. Word has length 52 [2019-12-18 12:49:46,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:49:46,458 INFO L462 AbstractCegarLoop]: Abstraction has 903 states and 1961 transitions. [2019-12-18 12:49:46,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:49:46,458 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1961 transitions. [2019-12-18 12:49:46,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 12:49:46,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:49:46,461 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:49:46,461 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:49:46,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:49:46,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1710729972, now seen corresponding path program 1 times [2019-12-18 12:49:46,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:49:46,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850626471] [2019-12-18 12:49:46,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:49:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:49:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:49:46,588 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:49:46,589 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:49:46,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t595~0.base_29|)) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= 0 v_~__unbuffered_cnt~0_62) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t595~0.base_29| 4)) (= |v_ULTIMATE.start_main_~#t595~0.offset_20| 0) (= v_~y$mem_tmp~0_26 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t595~0.base_29|) (= v_~y$w_buff1_used~0_504 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t595~0.base_29| 1) |v_#valid_52|) (= v_~y$r_buff0_thd1~0_219 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t595~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t595~0.base_29|) |v_ULTIMATE.start_main_~#t595~0.offset_20| 0)) |v_#memory_int_15|) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (= 0 v_~y$w_buff0~0_547) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t596~0.base=|v_ULTIMATE.start_main_~#t596~0.base_17|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_796, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, #length=|v_#length_15|, ~y~0=v_~y~0_149, ULTIMATE.start_main_~#t596~0.offset=|v_ULTIMATE.start_main_~#t596~0.offset_14|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_~#t595~0.offset=|v_ULTIMATE.start_main_~#t595~0.offset_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ULTIMATE.start_main_~#t595~0.base=|v_ULTIMATE.start_main_~#t595~0.base_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t596~0.base, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t596~0.offset, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t595~0.offset, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t595~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 12:49:46,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t596~0.base_12| 4)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t596~0.base_12| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t596~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t596~0.base_12|) |v_ULTIMATE.start_main_~#t596~0.offset_10| 1))) (= |v_ULTIMATE.start_main_~#t596~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t596~0.base_12|)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t596~0.base_12|) 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t596~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t596~0.offset=|v_ULTIMATE.start_main_~#t596~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t596~0.base=|v_ULTIMATE.start_main_~#t596~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t596~0.offset, ULTIMATE.start_main_~#t596~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 12:49:46,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66 0)) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66, ~x~0=v_~x~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 12:49:46,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In516770347 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In516770347 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out516770347| ~y$w_buff0_used~0_In516770347)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out516770347| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In516770347, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In516770347} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out516770347|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In516770347, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In516770347} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 12:49:46,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1100765108 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out-1100765108| |P1Thread1of1ForFork1_#t~ite14_Out-1100765108|) (= |P1Thread1of1ForFork1_#t~ite14_Out-1100765108| ~y$w_buff0~0_In-1100765108) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1100765108 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-1100765108 256)) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1100765108 256)) .cse1) (and (= (mod ~y$w_buff1_used~0_In-1100765108 256) 0) .cse1)))) (and (= |P1Thread1of1ForFork1_#t~ite14_In-1100765108| |P1Thread1of1ForFork1_#t~ite14_Out-1100765108|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite15_Out-1100765108| ~y$w_buff0~0_In-1100765108)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1100765108, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1100765108, ~y$w_buff0~0=~y$w_buff0~0_In-1100765108, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1100765108, ~weak$$choice2~0=~weak$$choice2~0_In-1100765108, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-1100765108|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1100765108} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1100765108, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1100765108, ~y$w_buff0~0=~y$w_buff0~0_In-1100765108, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1100765108, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-1100765108|, ~weak$$choice2~0=~weak$$choice2~0_In-1100765108, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1100765108|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1100765108} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 12:49:46,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1887974102 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite18_Out-1887974102| ~y$w_buff1~0_In-1887974102) (= |P1Thread1of1ForFork1_#t~ite17_In-1887974102| |P1Thread1of1ForFork1_#t~ite17_Out-1887974102|)) (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1887974102 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-1887974102 256)) (and (= (mod ~y$r_buff1_thd2~0_In-1887974102 256) 0) .cse1) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1887974102 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite17_Out-1887974102| ~y$w_buff1~0_In-1887974102) (= |P1Thread1of1ForFork1_#t~ite18_Out-1887974102| |P1Thread1of1ForFork1_#t~ite17_Out-1887974102|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1887974102, ~y$w_buff1~0=~y$w_buff1~0_In-1887974102, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1887974102, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1887974102, ~weak$$choice2~0=~weak$$choice2~0_In-1887974102, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-1887974102|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1887974102} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1887974102, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-1887974102|, ~y$w_buff1~0=~y$w_buff1~0_In-1887974102, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1887974102, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1887974102, ~weak$$choice2~0=~weak$$choice2~0_In-1887974102, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-1887974102|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1887974102} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 12:49:46,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1067631490 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-1067631490 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1067631490 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-1067631490 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1067631490| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out-1067631490| ~y$w_buff1_used~0_In-1067631490)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1067631490, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1067631490, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1067631490, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1067631490} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1067631490|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1067631490, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1067631490, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1067631490, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1067631490} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 12:49:46,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In1159688280 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1159688280 256) 0))) (or (and (not .cse0) (= ~y$r_buff0_thd1~0_Out1159688280 0) (not .cse1)) (and (= ~y$r_buff0_thd1~0_Out1159688280 ~y$r_buff0_thd1~0_In1159688280) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1159688280, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1159688280} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1159688280, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1159688280|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1159688280} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:49:46,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1394208900 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In1394208900 256))) (.cse1 (= (mod ~y$r_buff1_thd1~0_In1394208900 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1394208900 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1394208900|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In1394208900 |P0Thread1of1ForFork0_#t~ite8_Out1394208900|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1394208900, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1394208900, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1394208900, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1394208900} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1394208900, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1394208900, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1394208900|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1394208900, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1394208900} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 12:49:46,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-527254484 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite21_Out-527254484| ~y$w_buff0_used~0_In-527254484) (= |P1Thread1of1ForFork1_#t~ite20_In-527254484| |P1Thread1of1ForFork1_#t~ite20_Out-527254484|)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out-527254484| |P1Thread1of1ForFork1_#t~ite21_Out-527254484|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-527254484 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In-527254484 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-527254484 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In-527254484 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite20_Out-527254484| ~y$w_buff0_used~0_In-527254484)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-527254484, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-527254484, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-527254484|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-527254484, ~weak$$choice2~0=~weak$$choice2~0_In-527254484, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-527254484} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-527254484, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-527254484, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-527254484|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-527254484, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-527254484|, ~weak$$choice2~0=~weak$$choice2~0_In-527254484, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-527254484} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 12:49:46,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_14|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 12:49:46,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In121360787 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite30_Out121360787| |P1Thread1of1ForFork1_#t~ite29_Out121360787|) .cse0 (= ~y$r_buff1_thd2~0_In121360787 |P1Thread1of1ForFork1_#t~ite29_Out121360787|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In121360787 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In121360787 256)) (and (= 0 (mod ~y$w_buff1_used~0_In121360787 256)) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In121360787 256)) .cse1)))) (and (= |P1Thread1of1ForFork1_#t~ite30_Out121360787| ~y$r_buff1_thd2~0_In121360787) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In121360787| |P1Thread1of1ForFork1_#t~ite29_Out121360787|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In121360787, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In121360787|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In121360787, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In121360787, ~weak$$choice2~0=~weak$$choice2~0_In121360787, ~y$w_buff1_used~0=~y$w_buff1_used~0_In121360787} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In121360787, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out121360787|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out121360787|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In121360787, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In121360787, ~weak$$choice2~0=~weak$$choice2~0_In121360787, ~y$w_buff1_used~0=~y$w_buff1_used~0_In121360787} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 12:49:46,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:49:46,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_21 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 12:49:46,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1172955621 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1172955621 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In1172955621 |P1Thread1of1ForFork1_#t~ite32_Out1172955621|)) (and (= ~y~0_In1172955621 |P1Thread1of1ForFork1_#t~ite32_Out1172955621|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1172955621, ~y$w_buff1~0=~y$w_buff1~0_In1172955621, ~y~0=~y~0_In1172955621, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1172955621} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1172955621, ~y$w_buff1~0=~y$w_buff1~0_In1172955621, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1172955621|, ~y~0=~y~0_In1172955621, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1172955621} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 12:49:46,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-18 12:49:46,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1104147123 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1104147123 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1104147123|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1104147123 |P1Thread1of1ForFork1_#t~ite34_Out-1104147123|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1104147123, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1104147123} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1104147123, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1104147123, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1104147123|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 12:49:46,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-40299043 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-40299043 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-40299043 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-40299043 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-40299043 |P1Thread1of1ForFork1_#t~ite35_Out-40299043|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-40299043|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-40299043, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-40299043, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-40299043, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-40299043} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-40299043, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-40299043, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-40299043, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-40299043|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-40299043} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 12:49:46,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In805792249 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In805792249 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out805792249| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In805792249 |P1Thread1of1ForFork1_#t~ite36_Out805792249|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In805792249, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In805792249} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In805792249, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In805792249, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out805792249|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 12:49:46,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-886376789 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-886376789 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-886376789 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-886376789 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-886376789|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In-886376789 |P1Thread1of1ForFork1_#t~ite37_Out-886376789|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-886376789, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-886376789, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-886376789, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-886376789} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-886376789, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-886376789, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-886376789, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-886376789|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-886376789} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 12:49:46,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_42|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_42|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_41|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 12:49:46,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 12:49:46,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1140359586 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1140359586 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-1140359586| ~y$w_buff1~0_In-1140359586)) (and (or .cse1 .cse0) (= ~y~0_In-1140359586 |ULTIMATE.start_main_#t~ite40_Out-1140359586|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1140359586, ~y~0=~y~0_In-1140359586, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1140359586, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1140359586} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1140359586|, ~y$w_buff1~0=~y$w_buff1~0_In-1140359586, ~y~0=~y~0_In-1140359586, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1140359586, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1140359586} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 12:49:46,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-18 12:49:46,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In480743657 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In480743657 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In480743657 |ULTIMATE.start_main_#t~ite42_Out480743657|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out480743657|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In480743657, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In480743657} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In480743657, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In480743657, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out480743657|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 12:49:46,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1368519622 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1368519622 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-1368519622 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1368519622 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1368519622 |ULTIMATE.start_main_#t~ite43_Out-1368519622|)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-1368519622|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1368519622, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1368519622, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1368519622, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1368519622} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1368519622, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1368519622, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1368519622|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1368519622, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1368519622} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 12:49:46,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1046277772 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1046277772 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out1046277772| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out1046277772| ~y$r_buff0_thd0~0_In1046277772) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1046277772, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1046277772} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1046277772, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1046277772, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1046277772|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 12:49:46,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1524689664 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1524689664 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1524689664 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1524689664 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1524689664| ~y$r_buff1_thd0~0_In1524689664) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite45_Out1524689664| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1524689664, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1524689664, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1524689664, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1524689664} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1524689664, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1524689664, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1524689664, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1524689664|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1524689664} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 12:49:46,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~__unbuffered_p1_EBX~0_24 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:49:46,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:49:46 BasicIcfg [2019-12-18 12:49:46,674 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:49:46,676 INFO L168 Benchmark]: Toolchain (without parser) took 15525.22 ms. Allocated memory was 142.6 MB in the beginning and 489.2 MB in the end (delta: 346.6 MB). Free memory was 98.8 MB in the beginning and 366.1 MB in the end (delta: -267.4 MB). Peak memory consumption was 79.2 MB. Max. memory is 7.1 GB. [2019-12-18 12:49:46,676 INFO L168 Benchmark]: CDTParser took 0.60 ms. Allocated memory is still 142.6 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 12:49:46,677 INFO L168 Benchmark]: CACSL2BoogieTranslator took 771.67 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 98.3 MB in the beginning and 154.4 MB in the end (delta: -56.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-18 12:49:46,678 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.75 ms. Allocated memory is still 199.8 MB. Free memory was 154.4 MB in the beginning and 151.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 12:49:46,678 INFO L168 Benchmark]: Boogie Preprocessor took 35.08 ms. Allocated memory is still 199.8 MB. Free memory was 151.6 MB in the beginning and 149.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 12:49:46,679 INFO L168 Benchmark]: RCFGBuilder took 800.63 ms. Allocated memory is still 199.8 MB. Free memory was 149.5 MB in the beginning and 105.2 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-18 12:49:46,680 INFO L168 Benchmark]: TraceAbstraction took 13833.72 ms. Allocated memory was 199.8 MB in the beginning and 489.2 MB in the end (delta: 289.4 MB). Free memory was 104.5 MB in the beginning and 366.1 MB in the end (delta: -261.6 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. [2019-12-18 12:49:46,684 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.60 ms. Allocated memory is still 142.6 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 771.67 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 98.3 MB in the beginning and 154.4 MB in the end (delta: -56.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.75 ms. Allocated memory is still 199.8 MB. Free memory was 154.4 MB in the beginning and 151.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.08 ms. Allocated memory is still 199.8 MB. Free memory was 151.6 MB in the beginning and 149.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 800.63 ms. Allocated memory is still 199.8 MB. Free memory was 149.5 MB in the beginning and 105.2 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13833.72 ms. Allocated memory was 199.8 MB in the beginning and 489.2 MB in the end (delta: 289.4 MB). Free memory was 104.5 MB in the beginning and 366.1 MB in the end (delta: -261.6 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 147 ProgramPointsBefore, 77 ProgramPointsAfterwards, 181 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 4555 VarBasedMoverChecksPositive, 216 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 47763 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t595, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L799] FCALL, FORK 0 pthread_create(&t596, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.5s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1862 SDtfs, 1927 SDslu, 3534 SDs, 0 SdLazy, 2534 SolverSat, 143 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 25 SyntacticMatches, 10 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred 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.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 7373 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 496 NumberOfCodeBlocks, 496 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 429 ConstructedInterpolants, 0 QuantifiedInterpolants, 81115 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...