/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:14:25,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:14:25,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:14:25,764 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:14:25,764 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:14:25,766 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:14:25,768 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:14:25,777 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:14:25,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:14:25,783 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:14:25,785 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:14:25,787 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:14:25,787 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:14:25,788 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:14:25,791 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:14:25,792 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:14:25,793 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:14:25,794 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:14:25,795 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:14:25,800 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:14:25,804 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:14:25,809 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:14:25,810 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:14:25,810 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:14:25,813 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:14:25,813 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:14:25,814 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:14:25,815 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:14:25,816 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:14:25,817 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:14:25,817 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:14:25,818 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:14:25,819 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:14:25,820 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:14:25,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:14:25,821 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:14:25,821 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:14:25,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:14:25,822 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:14:25,824 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:14:25,825 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:14:25,826 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 22:14:25,853 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:14:25,854 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:14:25,858 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:14:25,858 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:14:25,859 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:14:25,859 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:14:25,859 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:14:25,859 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:14:25,859 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:14:25,859 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:14:25,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:14:25,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:14:25,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:14:25,861 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:14:25,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:14:25,862 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:14:25,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:14:25,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:14:25,863 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:14:25,863 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:14:25,863 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:14:25,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:14:25,864 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:14:25,864 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:14:25,864 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:14:25,865 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:14:25,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:14:25,866 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:14:25,866 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:14:25,866 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:14:26,173 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:14:26,195 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:14:26,199 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:14:26,201 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:14:26,202 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:14:26,203 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_power.opt.i [2019-12-18 22:14:26,275 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b150d2a87/7101d3c582cd40e8855cee2ba865ddd2/FLAG27170707e [2019-12-18 22:14:26,831 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:14:26,832 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_power.opt.i [2019-12-18 22:14:26,849 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b150d2a87/7101d3c582cd40e8855cee2ba865ddd2/FLAG27170707e [2019-12-18 22:14:27,124 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b150d2a87/7101d3c582cd40e8855cee2ba865ddd2 [2019-12-18 22:14:27,135 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:14:27,137 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:14:27,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:14:27,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:14:27,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:14:27,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:14:27" (1/1) ... [2019-12-18 22:14:27,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a58602b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:14:27, skipping insertion in model container [2019-12-18 22:14:27,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:14:27" (1/1) ... [2019-12-18 22:14:27,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:14:27,211 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:14:27,744 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:14:27,762 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:14:27,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:14:27,934 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:14:27,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:14:27 WrapperNode [2019-12-18 22:14:27,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:14:27,936 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:14:27,936 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:14:27,936 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:14:27,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:14:27" (1/1) ... [2019-12-18 22:14:27,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:14:27" (1/1) ... [2019-12-18 22:14:28,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:14:28,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:14:28,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:14:28,016 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:14:28,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:14:27" (1/1) ... [2019-12-18 22:14:28,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:14:27" (1/1) ... [2019-12-18 22:14:28,031 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:14:27" (1/1) ... [2019-12-18 22:14:28,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:14:27" (1/1) ... [2019-12-18 22:14:28,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:14:27" (1/1) ... [2019-12-18 22:14:28,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:14:27" (1/1) ... [2019-12-18 22:14:28,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:14:27" (1/1) ... [2019-12-18 22:14:28,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:14:28,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:14:28,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:14:28,074 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:14:28,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:14:27" (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 22:14:28,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:14:28,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:14:28,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:14:28,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:14:28,144 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:14:28,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:14:28,145 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:14:28,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:14:28,145 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 22:14:28,146 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 22:14:28,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:14:28,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:14:28,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:14:28,148 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 22:14:28,947 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:14:28,948 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:14:28,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:14:28 BoogieIcfgContainer [2019-12-18 22:14:28,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:14:28,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:14:28,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:14:28,954 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:14:28,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:14:27" (1/3) ... [2019-12-18 22:14:28,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2abcd897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:14:28, skipping insertion in model container [2019-12-18 22:14:28,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:14:27" (2/3) ... [2019-12-18 22:14:28,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2abcd897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:14:28, skipping insertion in model container [2019-12-18 22:14:28,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:14:28" (3/3) ... [2019-12-18 22:14:28,958 INFO L109 eAbstractionObserver]: Analyzing ICFG safe001_power.opt.i [2019-12-18 22:14:28,968 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:14:28,969 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:14:28,977 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:14:28,978 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:14:29,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,017 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,017 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,047 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,047 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,047 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,050 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,050 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,062 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,062 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,068 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,069 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,070 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,071 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,080 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,080 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,083 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,083 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,084 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,091 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,092 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:14:29,107 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 22:14:29,127 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:14:29,127 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:14:29,127 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:14:29,127 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:14:29,127 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:14:29,127 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:14:29,128 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:14:29,128 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:14:29,143 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-18 22:14:29,145 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 22:14:29,233 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 22:14:29,233 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:14:29,258 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 22:14:29,284 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 22:14:29,367 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 22:14:29,367 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:14:29,375 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 22:14:29,394 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-18 22:14:29,395 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:14:32,775 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 22:14:32,901 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 22:14:32,930 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82010 [2019-12-18 22:14:32,930 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-18 22:14:32,934 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 109 transitions [2019-12-18 22:14:52,420 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 117808 states. [2019-12-18 22:14:52,422 INFO L276 IsEmpty]: Start isEmpty. Operand 117808 states. [2019-12-18 22:14:52,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:14:52,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:14:52,430 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:14:52,431 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:14:52,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:14:52,436 INFO L82 PathProgramCache]: Analyzing trace with hash 806008766, now seen corresponding path program 1 times [2019-12-18 22:14:52,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:14:52,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234483654] [2019-12-18 22:14:52,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:14:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:14:52,660 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 22:14:52,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234483654] [2019-12-18 22:14:52,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:14:52,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:14:52,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704913136] [2019-12-18 22:14:52,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:14:52,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:14:52,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:14:52,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:14:52,686 INFO L87 Difference]: Start difference. First operand 117808 states. Second operand 3 states. [2019-12-18 22:14:56,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:14:56,677 INFO L93 Difference]: Finished difference Result 117244 states and 506404 transitions. [2019-12-18 22:14:56,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:14:56,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:14:56,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:14:57,513 INFO L225 Difference]: With dead ends: 117244 [2019-12-18 22:14:57,513 INFO L226 Difference]: Without dead ends: 114878 [2019-12-18 22:14:57,515 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 22:15:01,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114878 states. [2019-12-18 22:15:04,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114878 to 114878. [2019-12-18 22:15:04,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114878 states. [2019-12-18 22:15:04,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114878 states to 114878 states and 496758 transitions. [2019-12-18 22:15:04,836 INFO L78 Accepts]: Start accepts. Automaton has 114878 states and 496758 transitions. Word has length 5 [2019-12-18 22:15:04,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:15:04,837 INFO L462 AbstractCegarLoop]: Abstraction has 114878 states and 496758 transitions. [2019-12-18 22:15:04,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:15:04,837 INFO L276 IsEmpty]: Start isEmpty. Operand 114878 states and 496758 transitions. [2019-12-18 22:15:04,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:15:04,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:15:04,844 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:15:04,845 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:15:04,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:15:04,845 INFO L82 PathProgramCache]: Analyzing trace with hash 702926397, now seen corresponding path program 1 times [2019-12-18 22:15:04,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:15:04,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921119087] [2019-12-18 22:15:04,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:15:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:15:04,988 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 22:15:04,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921119087] [2019-12-18 22:15:04,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:15:04,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:15:04,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315651196] [2019-12-18 22:15:04,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:15:04,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:15:04,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:15:04,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:15:04,992 INFO L87 Difference]: Start difference. First operand 114878 states and 496758 transitions. Second operand 4 states. [2019-12-18 22:15:09,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:15:09,800 INFO L93 Difference]: Finished difference Result 184188 states and 760222 transitions. [2019-12-18 22:15:09,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:15:09,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:15:09,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:15:10,482 INFO L225 Difference]: With dead ends: 184188 [2019-12-18 22:15:10,483 INFO L226 Difference]: Without dead ends: 184139 [2019-12-18 22:15:10,483 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 22:15:20,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184139 states. [2019-12-18 22:15:23,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184139 to 169203. [2019-12-18 22:15:23,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169203 states. [2019-12-18 22:15:24,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169203 states to 169203 states and 707190 transitions. [2019-12-18 22:15:24,838 INFO L78 Accepts]: Start accepts. Automaton has 169203 states and 707190 transitions. Word has length 11 [2019-12-18 22:15:24,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:15:24,839 INFO L462 AbstractCegarLoop]: Abstraction has 169203 states and 707190 transitions. [2019-12-18 22:15:24,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:15:24,839 INFO L276 IsEmpty]: Start isEmpty. Operand 169203 states and 707190 transitions. [2019-12-18 22:15:24,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:15:24,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:15:24,846 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:15:24,846 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:15:24,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:15:24,847 INFO L82 PathProgramCache]: Analyzing trace with hash 702866747, now seen corresponding path program 1 times [2019-12-18 22:15:24,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:15:24,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108136802] [2019-12-18 22:15:24,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:15:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:15:24,938 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 22:15:24,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108136802] [2019-12-18 22:15:24,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:15:24,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:15:24,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206401928] [2019-12-18 22:15:24,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:15:24,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:15:24,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:15:24,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:15:24,940 INFO L87 Difference]: Start difference. First operand 169203 states and 707190 transitions. Second operand 4 states. [2019-12-18 22:15:33,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:15:33,347 INFO L93 Difference]: Finished difference Result 240014 states and 977713 transitions. [2019-12-18 22:15:33,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:15:33,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:15:33,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:15:34,232 INFO L225 Difference]: With dead ends: 240014 [2019-12-18 22:15:34,232 INFO L226 Difference]: Without dead ends: 239951 [2019-12-18 22:15:34,232 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 22:15:39,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239951 states. [2019-12-18 22:15:43,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239951 to 203645. [2019-12-18 22:15:43,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203645 states. [2019-12-18 22:15:44,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203645 states to 203645 states and 844323 transitions. [2019-12-18 22:15:44,681 INFO L78 Accepts]: Start accepts. Automaton has 203645 states and 844323 transitions. Word has length 13 [2019-12-18 22:15:44,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:15:44,682 INFO L462 AbstractCegarLoop]: Abstraction has 203645 states and 844323 transitions. [2019-12-18 22:15:44,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:15:44,682 INFO L276 IsEmpty]: Start isEmpty. Operand 203645 states and 844323 transitions. [2019-12-18 22:15:44,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:15:44,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:15:44,686 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:15:44,686 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:15:44,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:15:44,686 INFO L82 PathProgramCache]: Analyzing trace with hash 464803757, now seen corresponding path program 1 times [2019-12-18 22:15:44,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:15:44,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23591846] [2019-12-18 22:15:44,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:15:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:15:44,750 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 22:15:44,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23591846] [2019-12-18 22:15:44,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:15:44,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:15:44,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788174602] [2019-12-18 22:15:44,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:15:44,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:15:44,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:15:44,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:15:44,753 INFO L87 Difference]: Start difference. First operand 203645 states and 844323 transitions. Second operand 3 states. [2019-12-18 22:15:44,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:15:44,927 INFO L93 Difference]: Finished difference Result 39928 states and 130360 transitions. [2019-12-18 22:15:44,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:15:44,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 22:15:44,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:15:45,004 INFO L225 Difference]: With dead ends: 39928 [2019-12-18 22:15:45,004 INFO L226 Difference]: Without dead ends: 39928 [2019-12-18 22:15:45,004 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 22:15:45,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39928 states. [2019-12-18 22:15:51,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39928 to 39928. [2019-12-18 22:15:51,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39928 states. [2019-12-18 22:15:51,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39928 states to 39928 states and 130360 transitions. [2019-12-18 22:15:51,670 INFO L78 Accepts]: Start accepts. Automaton has 39928 states and 130360 transitions. Word has length 13 [2019-12-18 22:15:51,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:15:51,670 INFO L462 AbstractCegarLoop]: Abstraction has 39928 states and 130360 transitions. [2019-12-18 22:15:51,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:15:51,670 INFO L276 IsEmpty]: Start isEmpty. Operand 39928 states and 130360 transitions. [2019-12-18 22:15:51,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 22:15:51,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:15:51,674 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:15:51,674 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:15:51,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:15:51,674 INFO L82 PathProgramCache]: Analyzing trace with hash -2009264966, now seen corresponding path program 1 times [2019-12-18 22:15:51,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:15:51,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240130683] [2019-12-18 22:15:51,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:15:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:15:51,784 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 22:15:51,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240130683] [2019-12-18 22:15:51,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:15:51,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:15:51,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804565894] [2019-12-18 22:15:51,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:15:51,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:15:51,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:15:51,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:15:51,786 INFO L87 Difference]: Start difference. First operand 39928 states and 130360 transitions. Second operand 5 states. [2019-12-18 22:15:52,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:15:52,572 INFO L93 Difference]: Finished difference Result 53752 states and 171521 transitions. [2019-12-18 22:15:52,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:15:52,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 22:15:52,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:15:52,667 INFO L225 Difference]: With dead ends: 53752 [2019-12-18 22:15:52,667 INFO L226 Difference]: Without dead ends: 53739 [2019-12-18 22:15:52,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:15:52,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53739 states. [2019-12-18 22:15:53,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53739 to 40157. [2019-12-18 22:15:53,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40157 states. [2019-12-18 22:15:53,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40157 states to 40157 states and 130977 transitions. [2019-12-18 22:15:53,426 INFO L78 Accepts]: Start accepts. Automaton has 40157 states and 130977 transitions. Word has length 19 [2019-12-18 22:15:53,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:15:53,426 INFO L462 AbstractCegarLoop]: Abstraction has 40157 states and 130977 transitions. [2019-12-18 22:15:53,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:15:53,427 INFO L276 IsEmpty]: Start isEmpty. Operand 40157 states and 130977 transitions. [2019-12-18 22:15:53,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:15:53,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:15:53,437 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 22:15:53,438 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:15:53,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:15:53,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1059595659, now seen corresponding path program 1 times [2019-12-18 22:15:53,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:15:53,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624400525] [2019-12-18 22:15:53,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:15:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:15:53,499 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 22:15:53,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624400525] [2019-12-18 22:15:53,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:15:53,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:15:53,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158960955] [2019-12-18 22:15:53,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:15:53,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:15:53,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:15:53,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:15:53,502 INFO L87 Difference]: Start difference. First operand 40157 states and 130977 transitions. Second operand 4 states. [2019-12-18 22:15:53,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:15:53,542 INFO L93 Difference]: Finished difference Result 7224 states and 19739 transitions. [2019-12-18 22:15:53,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:15:53,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 22:15:53,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:15:53,554 INFO L225 Difference]: With dead ends: 7224 [2019-12-18 22:15:53,554 INFO L226 Difference]: Without dead ends: 7224 [2019-12-18 22:15:53,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:15:53,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states. [2019-12-18 22:15:53,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7224 to 7112. [2019-12-18 22:15:53,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7112 states. [2019-12-18 22:15:53,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7112 states to 7112 states and 19419 transitions. [2019-12-18 22:15:53,652 INFO L78 Accepts]: Start accepts. Automaton has 7112 states and 19419 transitions. Word has length 25 [2019-12-18 22:15:53,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:15:53,652 INFO L462 AbstractCegarLoop]: Abstraction has 7112 states and 19419 transitions. [2019-12-18 22:15:53,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:15:53,652 INFO L276 IsEmpty]: Start isEmpty. Operand 7112 states and 19419 transitions. [2019-12-18 22:15:53,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 22:15:53,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:15:53,663 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:15:53,663 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:15:53,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:15:53,664 INFO L82 PathProgramCache]: Analyzing trace with hash -81356198, now seen corresponding path program 1 times [2019-12-18 22:15:53,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:15:53,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565068656] [2019-12-18 22:15:53,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:15:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:15:53,740 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 22:15:53,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565068656] [2019-12-18 22:15:53,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:15:53,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:15:53,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980136252] [2019-12-18 22:15:53,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:15:53,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:15:53,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:15:53,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:15:53,743 INFO L87 Difference]: Start difference. First operand 7112 states and 19419 transitions. Second operand 5 states. [2019-12-18 22:15:53,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:15:53,773 INFO L93 Difference]: Finished difference Result 5025 states and 14423 transitions. [2019-12-18 22:15:53,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:15:53,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 22:15:53,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:15:53,781 INFO L225 Difference]: With dead ends: 5025 [2019-12-18 22:15:53,781 INFO L226 Difference]: Without dead ends: 5025 [2019-12-18 22:15:53,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:15:53,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5025 states. [2019-12-18 22:15:54,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5025 to 4661. [2019-12-18 22:15:54,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4661 states. [2019-12-18 22:15:54,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4661 states to 4661 states and 13439 transitions. [2019-12-18 22:15:54,029 INFO L78 Accepts]: Start accepts. Automaton has 4661 states and 13439 transitions. Word has length 37 [2019-12-18 22:15:54,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:15:54,029 INFO L462 AbstractCegarLoop]: Abstraction has 4661 states and 13439 transitions. [2019-12-18 22:15:54,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:15:54,029 INFO L276 IsEmpty]: Start isEmpty. Operand 4661 states and 13439 transitions. [2019-12-18 22:15:54,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:15:54,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:15:54,037 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:15:54,037 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:15:54,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:15:54,038 INFO L82 PathProgramCache]: Analyzing trace with hash 2136434843, now seen corresponding path program 1 times [2019-12-18 22:15:54,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:15:54,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823331087] [2019-12-18 22:15:54,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:15:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:15:54,115 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 22:15:54,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823331087] [2019-12-18 22:15:54,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:15:54,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:15:54,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995793360] [2019-12-18 22:15:54,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:15:54,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:15:54,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:15:54,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:15:54,118 INFO L87 Difference]: Start difference. First operand 4661 states and 13439 transitions. Second operand 3 states. [2019-12-18 22:15:54,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:15:54,183 INFO L93 Difference]: Finished difference Result 4670 states and 13453 transitions. [2019-12-18 22:15:54,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:15:54,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:15:54,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:15:54,196 INFO L225 Difference]: With dead ends: 4670 [2019-12-18 22:15:54,197 INFO L226 Difference]: Without dead ends: 4670 [2019-12-18 22:15:54,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:15:54,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-18 22:15:54,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-18 22:15:54,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-18 22:15:54,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13449 transitions. [2019-12-18 22:15:54,285 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13449 transitions. Word has length 65 [2019-12-18 22:15:54,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:15:54,285 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13449 transitions. [2019-12-18 22:15:54,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:15:54,286 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13449 transitions. [2019-12-18 22:15:54,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:15:54,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:15:54,292 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:15:54,292 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:15:54,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:15:54,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1287100776, now seen corresponding path program 1 times [2019-12-18 22:15:54,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:15:54,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512446363] [2019-12-18 22:15:54,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:15:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:15:54,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:15:54,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512446363] [2019-12-18 22:15:54,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:15:54,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:15:54,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071643987] [2019-12-18 22:15:54,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:15:54,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:15:54,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:15:54,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:15:54,365 INFO L87 Difference]: Start difference. First operand 4666 states and 13449 transitions. Second operand 3 states. [2019-12-18 22:15:54,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:15:54,419 INFO L93 Difference]: Finished difference Result 4670 states and 13443 transitions. [2019-12-18 22:15:54,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:15:54,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:15:54,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:15:54,427 INFO L225 Difference]: With dead ends: 4670 [2019-12-18 22:15:54,427 INFO L226 Difference]: Without dead ends: 4670 [2019-12-18 22:15:54,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:15:54,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-18 22:15:54,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-18 22:15:54,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-18 22:15:54,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13439 transitions. [2019-12-18 22:15:54,495 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13439 transitions. Word has length 65 [2019-12-18 22:15:54,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:15:54,495 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13439 transitions. [2019-12-18 22:15:54,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:15:54,496 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13439 transitions. [2019-12-18 22:15:54,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:15:54,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:15:54,502 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:15:54,503 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:15:54,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:15:54,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1294757063, now seen corresponding path program 1 times [2019-12-18 22:15:54,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:15:54,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766794345] [2019-12-18 22:15:54,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:15:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:15:54,596 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 22:15:54,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766794345] [2019-12-18 22:15:54,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:15:54,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:15:54,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531450982] [2019-12-18 22:15:54,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:15:54,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:15:54,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:15:54,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:15:54,598 INFO L87 Difference]: Start difference. First operand 4666 states and 13439 transitions. Second operand 3 states. [2019-12-18 22:15:54,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:15:54,625 INFO L93 Difference]: Finished difference Result 4414 states and 12534 transitions. [2019-12-18 22:15:54,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:15:54,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:15:54,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:15:54,632 INFO L225 Difference]: With dead ends: 4414 [2019-12-18 22:15:54,633 INFO L226 Difference]: Without dead ends: 4414 [2019-12-18 22:15:54,633 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 22:15:54,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4414 states. [2019-12-18 22:15:54,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4414 to 4414. [2019-12-18 22:15:54,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4414 states. [2019-12-18 22:15:54,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4414 states to 4414 states and 12534 transitions. [2019-12-18 22:15:54,714 INFO L78 Accepts]: Start accepts. Automaton has 4414 states and 12534 transitions. Word has length 65 [2019-12-18 22:15:54,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:15:54,714 INFO L462 AbstractCegarLoop]: Abstraction has 4414 states and 12534 transitions. [2019-12-18 22:15:54,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:15:54,714 INFO L276 IsEmpty]: Start isEmpty. Operand 4414 states and 12534 transitions. [2019-12-18 22:15:54,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:15:54,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:15:54,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:15:54,723 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:15:54,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:15:54,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1361414887, now seen corresponding path program 1 times [2019-12-18 22:15:54,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:15:54,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143396420] [2019-12-18 22:15:54,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:15:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:15:54,861 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 22:15:54,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143396420] [2019-12-18 22:15:54,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:15:54,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:15:54,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766023612] [2019-12-18 22:15:54,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:15:54,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:15:54,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:15:54,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:15:54,863 INFO L87 Difference]: Start difference. First operand 4414 states and 12534 transitions. Second operand 5 states. [2019-12-18 22:15:55,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:15:55,197 INFO L93 Difference]: Finished difference Result 7038 states and 19759 transitions. [2019-12-18 22:15:55,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:15:55,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-18 22:15:55,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:15:55,209 INFO L225 Difference]: With dead ends: 7038 [2019-12-18 22:15:55,210 INFO L226 Difference]: Without dead ends: 7038 [2019-12-18 22:15:55,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:15:55,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7038 states. [2019-12-18 22:15:55,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7038 to 4840. [2019-12-18 22:15:55,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4840 states. [2019-12-18 22:15:55,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4840 states to 4840 states and 13808 transitions. [2019-12-18 22:15:55,313 INFO L78 Accepts]: Start accepts. Automaton has 4840 states and 13808 transitions. Word has length 66 [2019-12-18 22:15:55,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:15:55,313 INFO L462 AbstractCegarLoop]: Abstraction has 4840 states and 13808 transitions. [2019-12-18 22:15:55,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:15:55,313 INFO L276 IsEmpty]: Start isEmpty. Operand 4840 states and 13808 transitions. [2019-12-18 22:15:55,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:15:55,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:15:55,320 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:15:55,320 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:15:55,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:15:55,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1912682329, now seen corresponding path program 2 times [2019-12-18 22:15:55,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:15:55,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440166851] [2019-12-18 22:15:55,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:15:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:15:55,452 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 22:15:55,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440166851] [2019-12-18 22:15:55,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:15:55,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:15:55,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163501631] [2019-12-18 22:15:55,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:15:55,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:15:55,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:15:55,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:15:55,454 INFO L87 Difference]: Start difference. First operand 4840 states and 13808 transitions. Second operand 6 states. [2019-12-18 22:15:55,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:15:55,937 INFO L93 Difference]: Finished difference Result 7012 states and 19685 transitions. [2019-12-18 22:15:55,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:15:55,937 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 22:15:55,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:15:55,948 INFO L225 Difference]: With dead ends: 7012 [2019-12-18 22:15:55,948 INFO L226 Difference]: Without dead ends: 7012 [2019-12-18 22:15:55,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:15:55,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7012 states. [2019-12-18 22:15:56,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7012 to 5533. [2019-12-18 22:15:56,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5533 states. [2019-12-18 22:15:56,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5533 states to 5533 states and 15753 transitions. [2019-12-18 22:15:56,070 INFO L78 Accepts]: Start accepts. Automaton has 5533 states and 15753 transitions. Word has length 66 [2019-12-18 22:15:56,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:15:56,070 INFO L462 AbstractCegarLoop]: Abstraction has 5533 states and 15753 transitions. [2019-12-18 22:15:56,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:15:56,071 INFO L276 IsEmpty]: Start isEmpty. Operand 5533 states and 15753 transitions. [2019-12-18 22:15:56,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:15:56,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:15:56,081 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:15:56,081 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:15:56,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:15:56,082 INFO L82 PathProgramCache]: Analyzing trace with hash -710018751, now seen corresponding path program 3 times [2019-12-18 22:15:56,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:15:56,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68305922] [2019-12-18 22:15:56,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:15:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:15:56,176 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 22:15:56,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68305922] [2019-12-18 22:15:56,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:15:56,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:15:56,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103547951] [2019-12-18 22:15:56,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:15:56,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:15:56,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:15:56,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:15:56,178 INFO L87 Difference]: Start difference. First operand 5533 states and 15753 transitions. Second operand 6 states. [2019-12-18 22:15:56,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:15:56,623 INFO L93 Difference]: Finished difference Result 7599 states and 21224 transitions. [2019-12-18 22:15:56,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:15:56,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 22:15:56,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:15:56,634 INFO L225 Difference]: With dead ends: 7599 [2019-12-18 22:15:56,634 INFO L226 Difference]: Without dead ends: 7599 [2019-12-18 22:15:56,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:15:56,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7599 states. [2019-12-18 22:15:56,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7599 to 5932. [2019-12-18 22:15:56,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5932 states. [2019-12-18 22:15:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5932 states to 5932 states and 16732 transitions. [2019-12-18 22:15:56,775 INFO L78 Accepts]: Start accepts. Automaton has 5932 states and 16732 transitions. Word has length 66 [2019-12-18 22:15:56,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:15:56,776 INFO L462 AbstractCegarLoop]: Abstraction has 5932 states and 16732 transitions. [2019-12-18 22:15:56,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:15:56,776 INFO L276 IsEmpty]: Start isEmpty. Operand 5932 states and 16732 transitions. [2019-12-18 22:15:56,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:15:56,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:15:56,788 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:15:56,788 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:15:56,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:15:56,789 INFO L82 PathProgramCache]: Analyzing trace with hash -397995211, now seen corresponding path program 4 times [2019-12-18 22:15:56,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:15:56,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815066827] [2019-12-18 22:15:56,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:15:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:15:56,891 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 22:15:56,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815066827] [2019-12-18 22:15:56,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:15:56,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:15:56,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737883387] [2019-12-18 22:15:56,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:15:56,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:15:56,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:15:56,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:15:56,893 INFO L87 Difference]: Start difference. First operand 5932 states and 16732 transitions. Second operand 7 states. [2019-12-18 22:15:57,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:15:57,616 INFO L93 Difference]: Finished difference Result 8663 states and 24095 transitions. [2019-12-18 22:15:57,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 22:15:57,616 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 22:15:57,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:15:57,629 INFO L225 Difference]: With dead ends: 8663 [2019-12-18 22:15:57,629 INFO L226 Difference]: Without dead ends: 8663 [2019-12-18 22:15:57,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:15:57,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8663 states. [2019-12-18 22:15:57,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8663 to 5848. [2019-12-18 22:15:57,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5848 states. [2019-12-18 22:15:57,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5848 states to 5848 states and 16506 transitions. [2019-12-18 22:15:57,897 INFO L78 Accepts]: Start accepts. Automaton has 5848 states and 16506 transitions. Word has length 66 [2019-12-18 22:15:57,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:15:57,897 INFO L462 AbstractCegarLoop]: Abstraction has 5848 states and 16506 transitions. [2019-12-18 22:15:57,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:15:57,897 INFO L276 IsEmpty]: Start isEmpty. Operand 5848 states and 16506 transitions. [2019-12-18 22:15:57,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:15:57,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:15:57,905 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:15:57,905 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:15:57,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:15:57,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1480872019, now seen corresponding path program 5 times [2019-12-18 22:15:57,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:15:57,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27994377] [2019-12-18 22:15:57,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:15:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:15:57,993 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 22:15:57,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27994377] [2019-12-18 22:15:57,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:15:57,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:15:57,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228661674] [2019-12-18 22:15:57,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:15:57,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:15:57,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:15:57,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:15:57,995 INFO L87 Difference]: Start difference. First operand 5848 states and 16506 transitions. Second operand 5 states. [2019-12-18 22:15:58,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:15:58,204 INFO L93 Difference]: Finished difference Result 7639 states and 21271 transitions. [2019-12-18 22:15:58,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:15:58,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-18 22:15:58,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:15:58,214 INFO L225 Difference]: With dead ends: 7639 [2019-12-18 22:15:58,215 INFO L226 Difference]: Without dead ends: 7639 [2019-12-18 22:15:58,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:15:58,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7639 states. [2019-12-18 22:15:58,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7639 to 6002. [2019-12-18 22:15:58,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6002 states. [2019-12-18 22:15:58,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6002 states to 6002 states and 16932 transitions. [2019-12-18 22:15:58,303 INFO L78 Accepts]: Start accepts. Automaton has 6002 states and 16932 transitions. Word has length 66 [2019-12-18 22:15:58,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:15:58,303 INFO L462 AbstractCegarLoop]: Abstraction has 6002 states and 16932 transitions. [2019-12-18 22:15:58,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:15:58,303 INFO L276 IsEmpty]: Start isEmpty. Operand 6002 states and 16932 transitions. [2019-12-18 22:15:58,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:15:58,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:15:58,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:15:58,312 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:15:58,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:15:58,312 INFO L82 PathProgramCache]: Analyzing trace with hash -745144111, now seen corresponding path program 6 times [2019-12-18 22:15:58,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:15:58,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451325690] [2019-12-18 22:15:58,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:15:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:15:58,461 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 22:15:58,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451325690] [2019-12-18 22:15:58,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:15:58,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:15:58,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55415295] [2019-12-18 22:15:58,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 22:15:58,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:15:58,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 22:15:58,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:15:58,466 INFO L87 Difference]: Start difference. First operand 6002 states and 16932 transitions. Second operand 8 states. [2019-12-18 22:15:59,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:15:59,018 INFO L93 Difference]: Finished difference Result 8592 states and 23897 transitions. [2019-12-18 22:15:59,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 22:15:59,019 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 22:15:59,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:15:59,032 INFO L225 Difference]: With dead ends: 8592 [2019-12-18 22:15:59,032 INFO L226 Difference]: Without dead ends: 8592 [2019-12-18 22:15:59,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:15:59,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8592 states. [2019-12-18 22:15:59,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8592 to 5694. [2019-12-18 22:15:59,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5694 states. [2019-12-18 22:15:59,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5694 states to 5694 states and 16080 transitions. [2019-12-18 22:15:59,148 INFO L78 Accepts]: Start accepts. Automaton has 5694 states and 16080 transitions. Word has length 66 [2019-12-18 22:15:59,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:15:59,149 INFO L462 AbstractCegarLoop]: Abstraction has 5694 states and 16080 transitions. [2019-12-18 22:15:59,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 22:15:59,149 INFO L276 IsEmpty]: Start isEmpty. Operand 5694 states and 16080 transitions. [2019-12-18 22:15:59,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:15:59,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:15:59,157 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:15:59,157 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:15:59,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:15:59,157 INFO L82 PathProgramCache]: Analyzing trace with hash 879933987, now seen corresponding path program 7 times [2019-12-18 22:15:59,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:15:59,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486080989] [2019-12-18 22:15:59,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:15:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:15:59,448 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 22:15:59,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486080989] [2019-12-18 22:15:59,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:15:59,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:15:59,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014883343] [2019-12-18 22:15:59,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:15:59,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:15:59,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:15:59,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:15:59,452 INFO L87 Difference]: Start difference. First operand 5694 states and 16080 transitions. Second operand 11 states. [2019-12-18 22:16:00,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:16:00,642 INFO L93 Difference]: Finished difference Result 9443 states and 26136 transitions. [2019-12-18 22:16:00,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 22:16:00,642 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 22:16:00,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:16:00,655 INFO L225 Difference]: With dead ends: 9443 [2019-12-18 22:16:00,655 INFO L226 Difference]: Without dead ends: 9443 [2019-12-18 22:16:00,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-12-18 22:16:00,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9443 states. [2019-12-18 22:16:00,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9443 to 5941. [2019-12-18 22:16:00,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5941 states. [2019-12-18 22:16:00,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5941 states to 5941 states and 16718 transitions. [2019-12-18 22:16:00,765 INFO L78 Accepts]: Start accepts. Automaton has 5941 states and 16718 transitions. Word has length 66 [2019-12-18 22:16:00,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:16:00,766 INFO L462 AbstractCegarLoop]: Abstraction has 5941 states and 16718 transitions. [2019-12-18 22:16:00,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:16:00,766 INFO L276 IsEmpty]: Start isEmpty. Operand 5941 states and 16718 transitions. [2019-12-18 22:16:00,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:16:00,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:16:00,774 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:16:00,774 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:16:00,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:16:00,774 INFO L82 PathProgramCache]: Analyzing trace with hash -74195049, now seen corresponding path program 8 times [2019-12-18 22:16:00,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:16:00,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832318649] [2019-12-18 22:16:00,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:16:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:16:00,904 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 22:16:00,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832318649] [2019-12-18 22:16:00,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:16:00,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:16:00,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778253079] [2019-12-18 22:16:00,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:16:00,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:16:00,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:16:00,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:16:00,906 INFO L87 Difference]: Start difference. First operand 5941 states and 16718 transitions. Second operand 7 states. [2019-12-18 22:16:01,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:16:01,043 INFO L93 Difference]: Finished difference Result 12787 states and 36240 transitions. [2019-12-18 22:16:01,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:16:01,044 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 22:16:01,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:16:01,055 INFO L225 Difference]: With dead ends: 12787 [2019-12-18 22:16:01,055 INFO L226 Difference]: Without dead ends: 7211 [2019-12-18 22:16:01,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:16:01,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7211 states. [2019-12-18 22:16:01,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7211 to 5425. [2019-12-18 22:16:01,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5425 states. [2019-12-18 22:16:01,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5425 states to 5425 states and 15269 transitions. [2019-12-18 22:16:01,175 INFO L78 Accepts]: Start accepts. Automaton has 5425 states and 15269 transitions. Word has length 66 [2019-12-18 22:16:01,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:16:01,176 INFO L462 AbstractCegarLoop]: Abstraction has 5425 states and 15269 transitions. [2019-12-18 22:16:01,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:16:01,176 INFO L276 IsEmpty]: Start isEmpty. Operand 5425 states and 15269 transitions. [2019-12-18 22:16:01,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:16:01,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:16:01,184 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:16:01,184 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:16:01,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:16:01,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1756813155, now seen corresponding path program 9 times [2019-12-18 22:16:01,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:16:01,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31067808] [2019-12-18 22:16:01,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:16:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:16:01,247 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 22:16:01,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31067808] [2019-12-18 22:16:01,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:16:01,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:16:01,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661747147] [2019-12-18 22:16:01,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:16:01,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:16:01,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:16:01,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:16:01,250 INFO L87 Difference]: Start difference. First operand 5425 states and 15269 transitions. Second operand 3 states. [2019-12-18 22:16:01,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:16:01,310 INFO L93 Difference]: Finished difference Result 5425 states and 15268 transitions. [2019-12-18 22:16:01,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:16:01,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 22:16:01,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:16:01,318 INFO L225 Difference]: With dead ends: 5425 [2019-12-18 22:16:01,318 INFO L226 Difference]: Without dead ends: 5425 [2019-12-18 22:16:01,319 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 22:16:01,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5425 states. [2019-12-18 22:16:01,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5425 to 3425. [2019-12-18 22:16:01,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3425 states. [2019-12-18 22:16:01,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3425 states to 3425 states and 9733 transitions. [2019-12-18 22:16:01,397 INFO L78 Accepts]: Start accepts. Automaton has 3425 states and 9733 transitions. Word has length 66 [2019-12-18 22:16:01,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:16:01,398 INFO L462 AbstractCegarLoop]: Abstraction has 3425 states and 9733 transitions. [2019-12-18 22:16:01,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:16:01,398 INFO L276 IsEmpty]: Start isEmpty. Operand 3425 states and 9733 transitions. [2019-12-18 22:16:01,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:16:01,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:16:01,402 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:16:01,402 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:16:01,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:16:01,402 INFO L82 PathProgramCache]: Analyzing trace with hash 471698454, now seen corresponding path program 1 times [2019-12-18 22:16:01,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:16:01,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519045968] [2019-12-18 22:16:01,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:16:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:16:01,517 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 22:16:01,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519045968] [2019-12-18 22:16:01,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:16:01,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:16:01,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155799163] [2019-12-18 22:16:01,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:16:01,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:16:01,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:16:01,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:16:01,520 INFO L87 Difference]: Start difference. First operand 3425 states and 9733 transitions. Second operand 6 states. [2019-12-18 22:16:01,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:16:01,758 INFO L93 Difference]: Finished difference Result 5904 states and 16795 transitions. [2019-12-18 22:16:01,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:16:01,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-18 22:16:01,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:16:01,763 INFO L225 Difference]: With dead ends: 5904 [2019-12-18 22:16:01,763 INFO L226 Difference]: Without dead ends: 2822 [2019-12-18 22:16:01,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:16:01,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822 states. [2019-12-18 22:16:01,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 2408. [2019-12-18 22:16:01,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2408 states. [2019-12-18 22:16:01,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 6775 transitions. [2019-12-18 22:16:01,796 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 6775 transitions. Word has length 67 [2019-12-18 22:16:01,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:16:01,796 INFO L462 AbstractCegarLoop]: Abstraction has 2408 states and 6775 transitions. [2019-12-18 22:16:01,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:16:01,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 6775 transitions. [2019-12-18 22:16:01,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:16:01,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:16:01,800 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:16:01,800 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:16:01,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:16:01,801 INFO L82 PathProgramCache]: Analyzing trace with hash 625388338, now seen corresponding path program 2 times [2019-12-18 22:16:01,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:16:01,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218711831] [2019-12-18 22:16:01,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:16:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:16:01,858 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 22:16:01,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218711831] [2019-12-18 22:16:01,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:16:01,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:16:01,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417094591] [2019-12-18 22:16:01,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:16:01,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:16:01,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:16:01,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:16:01,860 INFO L87 Difference]: Start difference. First operand 2408 states and 6775 transitions. Second operand 3 states. [2019-12-18 22:16:01,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:16:01,878 INFO L93 Difference]: Finished difference Result 2251 states and 6228 transitions. [2019-12-18 22:16:01,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:16:01,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 22:16:01,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:16:01,882 INFO L225 Difference]: With dead ends: 2251 [2019-12-18 22:16:01,882 INFO L226 Difference]: Without dead ends: 2251 [2019-12-18 22:16:01,882 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 22:16:01,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2251 states. [2019-12-18 22:16:01,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2251 to 2167. [2019-12-18 22:16:01,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2167 states. [2019-12-18 22:16:01,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 6002 transitions. [2019-12-18 22:16:01,925 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 6002 transitions. Word has length 67 [2019-12-18 22:16:01,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:16:01,925 INFO L462 AbstractCegarLoop]: Abstraction has 2167 states and 6002 transitions. [2019-12-18 22:16:01,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:16:01,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 6002 transitions. [2019-12-18 22:16:01,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:16:01,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:16:01,929 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:16:01,929 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:16:01,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:16:01,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1952420056, now seen corresponding path program 1 times [2019-12-18 22:16:01,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:16:01,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182261896] [2019-12-18 22:16:01,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:16:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:16:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:16:02,043 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:16:02,044 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:16:02,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t1804~0.base_20| 1)) (= v_~main$tmp_guard0~0_10 0) (= v_~x$r_buff1_thd1~0_19 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1804~0.base_20|) (= v_~__unbuffered_p0_EAX~0_8 0) (= 0 v_~weak$$choice0~0_8) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1804~0.base_20| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1804~0.base_20|) |v_ULTIMATE.start_main_~#t1804~0.offset_17| 0)) |v_#memory_int_21|) (= 0 v_~x$w_buff0_used~0_117) (= v_~x$w_buff1_used~0_74 0) (= 0 v_~x$r_buff0_thd2~0_26) (= v_~x~0_30 0) (= 0 v_~x$r_buff0_thd1~0_20) (= v_~y~0_14 0) (= v_~x$flush_delayed~0_16 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~__unbuffered_p2_EAX~0_8 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd0~0_47 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~x$r_buff0_thd0~0_79) (= 0 |v_#NULL.base_4|) (= 0 v_~x$w_buff1~0_29) (= 0 v_~__unbuffered_cnt~0_19) (= v_~x$r_buff1_thd2~0_19 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1804~0.base_20|)) (= |v_#NULL.offset_4| 0) (= v_~x$mem_tmp~0_11 0) (= v_~x$r_buff1_thd3~0_17 0) (= 0 v_~x$r_buff0_thd3~0_19) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff0~0_30) (= v_~main$tmp_guard1~0_12 0) (= |v_ULTIMATE.start_main_~#t1804~0.offset_17| 0) (= 0 v_~weak$$choice2~0_31) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1804~0.base_20| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_9|, ~x$w_buff0~0=v_~x$w_buff0~0_30, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_11|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_13|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_14|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_16|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ULTIMATE.start_main_~#t1805~0.offset=|v_ULTIMATE.start_main_~#t1805~0.offset_17|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_79, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ~x$w_buff1~0=v_~x$w_buff1~0_29, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_74, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t1805~0.base=|v_ULTIMATE.start_main_~#t1805~0.base_21|, ULTIMATE.start_main_~#t1806~0.offset=|v_ULTIMATE.start_main_~#t1806~0.offset_16|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ULTIMATE.start_main_~#t1804~0.base=|v_ULTIMATE.start_main_~#t1804~0.base_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x~0=v_~x~0_30, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_9|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_~#t1804~0.offset=|v_ULTIMATE.start_main_~#t1804~0.offset_17|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_13|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_13|, ULTIMATE.start_main_~#t1806~0.base=|v_ULTIMATE.start_main_~#t1806~0.base_20|, ~y~0=v_~y~0_14, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_47, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_31, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1805~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ULTIMATE.start_main_~#t1805~0.base, ULTIMATE.start_main_~#t1806~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1804~0.base, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1804~0.offset, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1806~0.base, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 22:16:02,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L805-1-->L807: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1805~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1805~0.base_11| 4)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1805~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1805~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1805~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1805~0.base_11|) |v_ULTIMATE.start_main_~#t1805~0.offset_10| 1)) |v_#memory_int_13|) (= |v_ULTIMATE.start_main_~#t1805~0.offset_10| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1805~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1805~0.offset=|v_ULTIMATE.start_main_~#t1805~0.offset_10|, ULTIMATE.start_main_~#t1805~0.base=|v_ULTIMATE.start_main_~#t1805~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1805~0.offset, ULTIMATE.start_main_~#t1805~0.base] because there is no mapped edge [2019-12-18 22:16:02,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1806~0.base_9| 1)) (not (= |v_ULTIMATE.start_main_~#t1806~0.base_9| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1806~0.base_9|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1806~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1806~0.base_9|) |v_ULTIMATE.start_main_~#t1806~0.offset_8| 2)) |v_#memory_int_9|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1806~0.base_9| 4)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1806~0.base_9|) 0) (= |v_ULTIMATE.start_main_~#t1806~0.offset_8| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1806~0.base=|v_ULTIMATE.start_main_~#t1806~0.base_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1806~0.offset=|v_ULTIMATE.start_main_~#t1806~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1806~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1806~0.offset] because there is no mapped edge [2019-12-18 22:16:02,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= 2 v_~x$w_buff0~0_17) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= 1 v_~x$w_buff0_used~0_80) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= v_~x$w_buff0~0_18 v_~x$w_buff1~0_15) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= v_~x$w_buff1_used~0_49 v_~x$w_buff0_used~0_81) (= (mod v_~x$w_buff1_used~0_49 256) 0)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_18, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_17, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_80} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 22:16:02,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1531144446 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1531144446 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite15_Out1531144446| ~x~0_In1531144446) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out1531144446| ~x$w_buff1~0_In1531144446) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1531144446, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1531144446, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1531144446, ~x~0=~x~0_In1531144446} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1531144446|, ~x$w_buff1~0=~x$w_buff1~0_In1531144446, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1531144446, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1531144446, ~x~0=~x~0_In1531144446} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 22:16:02,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L782-4-->L783: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~x~0_17) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-18 22:16:02,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-758947277 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-758947277 256) 0))) (or (and (= ~x$w_buff0_used~0_In-758947277 |P2Thread1of1ForFork2_#t~ite17_Out-758947277|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-758947277|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-758947277, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-758947277} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-758947277, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-758947277|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-758947277} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 22:16:02,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In604474397 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In604474397 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In604474397 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In604474397 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In604474397 |P2Thread1of1ForFork2_#t~ite18_Out604474397|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite18_Out604474397|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In604474397, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In604474397, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In604474397, ~x$w_buff0_used~0=~x$w_buff0_used~0_In604474397} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In604474397, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In604474397, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In604474397, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out604474397|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In604474397} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 22:16:02,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L733-2-->L733-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out-1716093354| |P0Thread1of1ForFork0_#t~ite3_Out-1716093354|)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1716093354 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-1716093354 256) 0))) (or (and .cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out-1716093354| ~x~0_In-1716093354) (or .cse1 .cse2)) (and (= |P0Thread1of1ForFork0_#t~ite3_Out-1716093354| ~x$w_buff1~0_In-1716093354) .cse0 (not .cse1) (not .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1716093354, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1716093354, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1716093354, ~x~0=~x~0_In-1716093354} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1716093354|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1716093354|, ~x$w_buff1~0=~x$w_buff1~0_In-1716093354, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1716093354, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1716093354, ~x~0=~x~0_In-1716093354} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 22:16:02,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L734-->L734-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In1414489092 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1414489092 256)))) (or (and (= ~x$w_buff0_used~0_In1414489092 |P0Thread1of1ForFork0_#t~ite5_Out1414489092|) (or .cse0 .cse1)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1414489092| 0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1414489092, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1414489092} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1414489092|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1414489092, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1414489092} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 22:16:02,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L735-->L735-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-464618699 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-464618699 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-464618699 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-464618699 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-464618699 |P0Thread1of1ForFork0_#t~ite6_Out-464618699|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-464618699|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-464618699, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-464618699, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-464618699, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-464618699} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-464618699|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-464618699, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-464618699, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-464618699, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-464618699} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 22:16:02,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In2021659815 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In2021659815 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out2021659815| ~x$r_buff0_thd3~0_In2021659815)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out2021659815| 0) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2021659815, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2021659815} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2021659815, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out2021659815|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2021659815} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 22:16:02,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1159178565 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1159178565 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1159178565 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd3~0_In-1159178565 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out-1159178565| ~x$r_buff1_thd3~0_In-1159178565) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite20_Out-1159178565| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1159178565, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1159178565, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1159178565, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1159178565} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1159178565|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1159178565, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1159178565, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1159178565, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1159178565} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 22:16:02,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~x$r_buff1_thd3~0_13)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_13, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 22:16:02,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L736-->L736-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-329396092 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-329396092 256) 0))) (or (and (= ~x$r_buff0_thd1~0_In-329396092 |P0Thread1of1ForFork0_#t~ite7_Out-329396092|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-329396092|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-329396092, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-329396092} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-329396092, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-329396092|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-329396092} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 22:16:02,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L737-->L737-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-137682372 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-137682372 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-137682372 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-137682372 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-137682372|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd1~0_In-137682372 |P0Thread1of1ForFork0_#t~ite8_Out-137682372|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-137682372, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-137682372, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-137682372, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-137682372} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-137682372, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-137682372|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-137682372, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-137682372, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-137682372} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 22:16:02,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L737-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 22:16:02,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-2017748873 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-2017748873 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-2017748873|) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-2017748873| ~x$w_buff0_used~0_In-2017748873) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2017748873, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2017748873} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-2017748873|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2017748873, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2017748873} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 22:16:02,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L764-->L764-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd2~0_In-149127606 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-149127606 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-149127606 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-149127606 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out-149127606| 0)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out-149127606| ~x$w_buff1_used~0_In-149127606) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-149127606, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-149127606, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-149127606, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-149127606} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-149127606, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-149127606, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-149127606|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-149127606, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-149127606} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 22:16:02,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L766: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-58135571 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-58135571 256)))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out-58135571) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In-58135571 ~x$r_buff0_thd2~0_Out-58135571) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-58135571, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-58135571} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-58135571|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-58135571, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-58135571} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 22:16:02,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L766-->L766-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In457271050 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In457271050 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In457271050 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In457271050 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out457271050| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out457271050| ~x$r_buff1_thd2~0_In457271050)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In457271050, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In457271050, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In457271050, ~x$w_buff0_used~0=~x$w_buff0_used~0_In457271050} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In457271050, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In457271050, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In457271050, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out457271050|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In457271050} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 22:16:02,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~x$r_buff1_thd2~0_15 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 22:16:02,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 22:16:02,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L815-2-->L815-5: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-381935908 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-381935908 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite24_Out-381935908| |ULTIMATE.start_main_#t~ite25_Out-381935908|))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out-381935908| ~x~0_In-381935908) (or .cse0 .cse1) .cse2) (and (= |ULTIMATE.start_main_#t~ite24_Out-381935908| ~x$w_buff1~0_In-381935908) (not .cse0) (not .cse1) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-381935908, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-381935908, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-381935908, ~x~0=~x~0_In-381935908} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-381935908, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-381935908|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-381935908|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-381935908, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-381935908, ~x~0=~x~0_In-381935908} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 22:16:02,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In2078505225 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In2078505225 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite26_Out2078505225|) (not .cse1)) (and (= ~x$w_buff0_used~0_In2078505225 |ULTIMATE.start_main_#t~ite26_Out2078505225|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2078505225, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2078505225} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2078505225, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out2078505225|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2078505225} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 22:16:02,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L817-->L817-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In140231879 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In140231879 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In140231879 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In140231879 256)))) (or (and (= |ULTIMATE.start_main_#t~ite27_Out140231879| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite27_Out140231879| ~x$w_buff1_used~0_In140231879) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In140231879, ~x$w_buff1_used~0=~x$w_buff1_used~0_In140231879, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In140231879, ~x$w_buff0_used~0=~x$w_buff0_used~0_In140231879} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In140231879, ~x$w_buff1_used~0=~x$w_buff1_used~0_In140231879, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out140231879|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In140231879, ~x$w_buff0_used~0=~x$w_buff0_used~0_In140231879} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 22:16:02,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1064817571 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1064817571 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite28_Out-1064817571| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite28_Out-1064817571| ~x$r_buff0_thd0~0_In-1064817571)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1064817571, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1064817571} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1064817571, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1064817571|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1064817571} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 22:16:02,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In249221721 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In249221721 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In249221721 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In249221721 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite29_Out249221721| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In249221721 |ULTIMATE.start_main_#t~ite29_Out249221721|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In249221721, ~x$w_buff1_used~0=~x$w_buff1_used~0_In249221721, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In249221721, ~x$w_buff0_used~0=~x$w_buff0_used~0_In249221721} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In249221721, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out249221721|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In249221721, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In249221721, ~x$w_buff0_used~0=~x$w_buff0_used~0_In249221721} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 22:16:02,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L831-->L832: Formula: (and (= v_~x$r_buff0_thd0~0_57 v_~x$r_buff0_thd0~0_56) (not (= (mod v_~weak$$choice2~0_21 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 22:16:02,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L834-->L837-1: Formula: (and (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_~x$flush_delayed~0_10 0) (= v_~x$mem_tmp~0_7 v_~x~0_25)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_7} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_7, ~x~0=v_~x~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:16:02,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 22:16:02,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:16:02 BasicIcfg [2019-12-18 22:16:02,192 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:16:02,195 INFO L168 Benchmark]: Toolchain (without parser) took 95057.78 ms. Allocated memory was 146.3 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 101.5 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 22:16:02,195 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 22:16:02,196 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.49 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.1 MB in the beginning and 157.6 MB in the end (delta: -56.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-18 22:16:02,196 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.01 ms. Allocated memory is still 203.9 MB. Free memory was 157.6 MB in the beginning and 154.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 22:16:02,198 INFO L168 Benchmark]: Boogie Preprocessor took 51.51 ms. Allocated memory is still 203.9 MB. Free memory was 154.4 MB in the beginning and 151.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:16:02,198 INFO L168 Benchmark]: RCFGBuilder took 881.96 ms. Allocated memory is still 203.9 MB. Free memory was 151.8 MB in the beginning and 102.0 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-18 22:16:02,201 INFO L168 Benchmark]: TraceAbstraction took 93241.50 ms. Allocated memory was 203.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 101.4 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 22:16:02,210 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.48 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 797.49 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.1 MB in the beginning and 157.6 MB in the end (delta: -56.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.01 ms. Allocated memory is still 203.9 MB. Free memory was 157.6 MB in the beginning and 154.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.51 ms. Allocated memory is still 203.9 MB. Free memory was 154.4 MB in the beginning and 151.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 881.96 ms. Allocated memory is still 203.9 MB. Free memory was 151.8 MB in the beginning and 102.0 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 93241.50 ms. Allocated memory was 203.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 101.4 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 174 ProgramPointsBefore, 96 ProgramPointsAfterwards, 211 TransitionsBefore, 109 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 28 ChoiceCompositions, 5983 VarBasedMoverChecksPositive, 190 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 82010 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t1804, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L807] FCALL, FORK 0 pthread_create(&t1805, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L809] FCALL, FORK 0 pthread_create(&t1806, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 2 x$r_buff0_thd2 = (_Bool)1 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L727] 1 __unbuffered_p0_EAX = y [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L733] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L784] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L785] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L762] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L763] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L764] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L815] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L816] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L817] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L818] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L819] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 x$flush_delayed = weak$$choice2 [L825] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L827] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L828] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L828] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L829] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L830] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L832] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 92.9s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 25.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3161 SDtfs, 2662 SDslu, 6121 SDs, 0 SdLazy, 4056 SolverSat, 181 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 45 SyntacticMatches, 24 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203645occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 41.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 85788 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1114 NumberOfCodeBlocks, 1114 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1025 ConstructedInterpolants, 0 QuantifiedInterpolants, 178347 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...