/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/safe013_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:33:21,861 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:33:21,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:33:21,882 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:33:21,882 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:33:21,884 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:33:21,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:33:21,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:33:21,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:33:21,901 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:33:21,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:33:21,905 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:33:21,905 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:33:21,907 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:33:21,910 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:33:21,911 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:33:21,912 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:33:21,913 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:33:21,914 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:33:21,919 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:33:21,924 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:33:21,927 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:33:21,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:33:21,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:33:21,931 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:33:21,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:33:21,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:33:21,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:33:21,934 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:33:21,935 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:33:21,936 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:33:21,936 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:33:21,937 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:33:21,938 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:33:21,939 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:33:21,939 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:33:21,940 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:33:21,940 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:33:21,940 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:33:21,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:33:21,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:33:21,944 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:33:21,969 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:33:21,969 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:33:21,971 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:33:21,971 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:33:21,971 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:33:21,971 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:33:21,971 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:33:21,972 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:33:21,972 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:33:21,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:33:21,972 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:33:21,972 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:33:21,973 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:33:21,973 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:33:21,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:33:21,973 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:33:21,973 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:33:21,974 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:33:21,974 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:33:21,974 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:33:21,974 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:33:21,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:33:21,975 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:33:21,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:33:21,975 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:33:21,975 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:33:21,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:33:21,976 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:33:21,976 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:33:21,976 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:33:22,268 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:33:22,277 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:33:22,280 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:33:22,282 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:33:22,282 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:33:22,283 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_power.oepc.i [2019-12-18 22:33:22,351 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fd7864b4/74de4417c0d94341b7532054e4623377/FLAGfc5ddeb65 [2019-12-18 22:33:22,913 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:33:22,914 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_power.oepc.i [2019-12-18 22:33:22,937 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fd7864b4/74de4417c0d94341b7532054e4623377/FLAGfc5ddeb65 [2019-12-18 22:33:23,191 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fd7864b4/74de4417c0d94341b7532054e4623377 [2019-12-18 22:33:23,201 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:33:23,203 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:33:23,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:33:23,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:33:23,207 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:33:23,208 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:33:23" (1/1) ... [2019-12-18 22:33:23,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201a0304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:23, skipping insertion in model container [2019-12-18 22:33:23,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:33:23" (1/1) ... [2019-12-18 22:33:23,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:33:23,272 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:33:23,819 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:33:23,831 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:33:23,902 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:33:23,973 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:33:23,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:23 WrapperNode [2019-12-18 22:33:23,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:33:23,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:33:23,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:33:23,975 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:33:23,983 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:33:23" (1/1) ... [2019-12-18 22:33:24,003 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:33:23" (1/1) ... [2019-12-18 22:33:24,037 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:33:24,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:33:24,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:33:24,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:33:24,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:23" (1/1) ... [2019-12-18 22:33:24,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:23" (1/1) ... [2019-12-18 22:33:24,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:23" (1/1) ... [2019-12-18 22:33:24,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:23" (1/1) ... [2019-12-18 22:33:24,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:23" (1/1) ... [2019-12-18 22:33:24,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:23" (1/1) ... [2019-12-18 22:33:24,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:23" (1/1) ... [2019-12-18 22:33:24,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:33:24,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:33:24,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:33:24,076 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:33:24,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:23" (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:33:24,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:33:24,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:33:24,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:33:24,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:33:24,131 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:33:24,132 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:33:24,132 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:33:24,133 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:33:24,133 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 22:33:24,134 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 22:33:24,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:33:24,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:33:24,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:33:24,137 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:33:24,881 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:33:24,881 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:33:24,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:33:24 BoogieIcfgContainer [2019-12-18 22:33:24,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:33:24,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:33:24,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:33:24,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:33:24,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:33:23" (1/3) ... [2019-12-18 22:33:24,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29289782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:33:24, skipping insertion in model container [2019-12-18 22:33:24,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:23" (2/3) ... [2019-12-18 22:33:24,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29289782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:33:24, skipping insertion in model container [2019-12-18 22:33:24,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:33:24" (3/3) ... [2019-12-18 22:33:24,891 INFO L109 eAbstractionObserver]: Analyzing ICFG safe013_power.oepc.i [2019-12-18 22:33:24,904 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:33:24,904 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:33:24,915 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:33:24,916 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:33:24,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,961 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,961 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,984 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,985 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,985 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,985 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,986 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:24,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,009 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,009 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,017 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,018 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,018 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,024 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,024 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,028 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,029 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,046 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 22:33:25,065 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:33:25,065 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:33:25,065 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:33:25,065 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:33:25,065 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:33:25,065 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:33:25,066 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:33:25,066 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:33:25,081 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-18 22:33:25,083 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 22:33:25,162 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 22:33:25,163 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:33:25,183 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 22:33:25,210 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 22:33:25,254 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 22:33:25,254 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:33:25,263 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 22:33:25,285 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 22:33:25,286 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:33:28,809 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 22:33:28,929 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 22:33:29,009 INFO L206 etLargeBlockEncoding]: Checked pairs total: 68909 [2019-12-18 22:33:29,009 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-18 22:33:29,014 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 92 transitions [2019-12-18 22:33:42,386 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 92280 states. [2019-12-18 22:33:42,388 INFO L276 IsEmpty]: Start isEmpty. Operand 92280 states. [2019-12-18 22:33:42,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:33:42,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:42,396 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:33:42,397 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:42,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:42,404 INFO L82 PathProgramCache]: Analyzing trace with hash 793714210, now seen corresponding path program 1 times [2019-12-18 22:33:42,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:42,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980845194] [2019-12-18 22:33:42,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:42,651 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:33:42,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980845194] [2019-12-18 22:33:42,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:42,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:33:42,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681575107] [2019-12-18 22:33:42,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:33:42,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:42,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:33:42,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:33:42,681 INFO L87 Difference]: Start difference. First operand 92280 states. Second operand 3 states. [2019-12-18 22:33:43,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:43,751 INFO L93 Difference]: Finished difference Result 90395 states and 387830 transitions. [2019-12-18 22:33:43,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:33:43,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:33:43,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:46,914 INFO L225 Difference]: With dead ends: 90395 [2019-12-18 22:33:46,915 INFO L226 Difference]: Without dead ends: 85117 [2019-12-18 22:33:46,919 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:33:49,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85117 states. [2019-12-18 22:33:52,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85117 to 85117. [2019-12-18 22:33:52,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85117 states. [2019-12-18 22:33:52,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85117 states to 85117 states and 364674 transitions. [2019-12-18 22:33:52,951 INFO L78 Accepts]: Start accepts. Automaton has 85117 states and 364674 transitions. Word has length 5 [2019-12-18 22:33:52,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:52,952 INFO L462 AbstractCegarLoop]: Abstraction has 85117 states and 364674 transitions. [2019-12-18 22:33:52,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:33:52,952 INFO L276 IsEmpty]: Start isEmpty. Operand 85117 states and 364674 transitions. [2019-12-18 22:33:52,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:33:52,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:52,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:33:52,961 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:52,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:52,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1502291338, now seen corresponding path program 1 times [2019-12-18 22:33:52,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:52,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448267622] [2019-12-18 22:33:52,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:53,114 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:33:53,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448267622] [2019-12-18 22:33:53,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:53,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:33:53,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251705464] [2019-12-18 22:33:53,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:33:53,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:53,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:33:53,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:33:53,120 INFO L87 Difference]: Start difference. First operand 85117 states and 364674 transitions. Second operand 4 states. [2019-12-18 22:33:57,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:57,598 INFO L93 Difference]: Finished difference Result 130038 states and 533020 transitions. [2019-12-18 22:33:57,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:33:57,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:33:57,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:58,099 INFO L225 Difference]: With dead ends: 130038 [2019-12-18 22:33:58,099 INFO L226 Difference]: Without dead ends: 129940 [2019-12-18 22:33:58,100 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:34:01,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129940 states. [2019-12-18 22:34:05,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129940 to 116665. [2019-12-18 22:34:05,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116665 states. [2019-12-18 22:34:05,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116665 states to 116665 states and 485676 transitions. [2019-12-18 22:34:05,476 INFO L78 Accepts]: Start accepts. Automaton has 116665 states and 485676 transitions. Word has length 13 [2019-12-18 22:34:05,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:05,477 INFO L462 AbstractCegarLoop]: Abstraction has 116665 states and 485676 transitions. [2019-12-18 22:34:05,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:34:05,477 INFO L276 IsEmpty]: Start isEmpty. Operand 116665 states and 485676 transitions. [2019-12-18 22:34:05,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:34:05,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:05,481 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:05,481 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:05,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:05,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1013715486, now seen corresponding path program 1 times [2019-12-18 22:34:05,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:05,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511699425] [2019-12-18 22:34:05,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:05,576 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:34:05,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511699425] [2019-12-18 22:34:05,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:05,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:34:05,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810149313] [2019-12-18 22:34:05,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:34:05,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:05,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:34:05,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:34:05,578 INFO L87 Difference]: Start difference. First operand 116665 states and 485676 transitions. Second operand 4 states. [2019-12-18 22:34:10,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:10,252 INFO L93 Difference]: Finished difference Result 161841 states and 657746 transitions. [2019-12-18 22:34:10,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:34:10,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:34:10,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:10,775 INFO L225 Difference]: With dead ends: 161841 [2019-12-18 22:34:10,775 INFO L226 Difference]: Without dead ends: 161729 [2019-12-18 22:34:10,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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:34:15,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161729 states. [2019-12-18 22:34:17,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161729 to 135524. [2019-12-18 22:34:17,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135524 states. [2019-12-18 22:34:18,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135524 states to 135524 states and 561455 transitions. [2019-12-18 22:34:18,210 INFO L78 Accepts]: Start accepts. Automaton has 135524 states and 561455 transitions. Word has length 13 [2019-12-18 22:34:18,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:18,210 INFO L462 AbstractCegarLoop]: Abstraction has 135524 states and 561455 transitions. [2019-12-18 22:34:18,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:34:18,210 INFO L276 IsEmpty]: Start isEmpty. Operand 135524 states and 561455 transitions. [2019-12-18 22:34:18,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:34:18,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:18,214 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:18,214 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:18,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:18,214 INFO L82 PathProgramCache]: Analyzing trace with hash -19781077, now seen corresponding path program 1 times [2019-12-18 22:34:18,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:18,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208731670] [2019-12-18 22:34:18,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:18,264 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:34:18,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208731670] [2019-12-18 22:34:18,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:18,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:34:18,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831138887] [2019-12-18 22:34:18,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:34:18,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:18,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:34:18,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:34:18,270 INFO L87 Difference]: Start difference. First operand 135524 states and 561455 transitions. Second operand 3 states. [2019-12-18 22:34:24,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:24,103 INFO L93 Difference]: Finished difference Result 181948 states and 742402 transitions. [2019-12-18 22:34:24,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:34:24,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 22:34:24,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:24,718 INFO L225 Difference]: With dead ends: 181948 [2019-12-18 22:34:24,718 INFO L226 Difference]: Without dead ends: 181948 [2019-12-18 22:34:24,719 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:34:28,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181948 states. [2019-12-18 22:34:34,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181948 to 149024. [2019-12-18 22:34:34,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149024 states. [2019-12-18 22:34:35,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149024 states to 149024 states and 615188 transitions. [2019-12-18 22:34:35,449 INFO L78 Accepts]: Start accepts. Automaton has 149024 states and 615188 transitions. Word has length 14 [2019-12-18 22:34:35,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:35,449 INFO L462 AbstractCegarLoop]: Abstraction has 149024 states and 615188 transitions. [2019-12-18 22:34:35,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:34:35,449 INFO L276 IsEmpty]: Start isEmpty. Operand 149024 states and 615188 transitions. [2019-12-18 22:34:35,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:34:35,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:35,453 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:35,453 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:35,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:35,453 INFO L82 PathProgramCache]: Analyzing trace with hash -19914749, now seen corresponding path program 1 times [2019-12-18 22:34:35,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:35,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568884006] [2019-12-18 22:34:35,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:35,536 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:34:35,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568884006] [2019-12-18 22:34:35,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:35,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:34:35,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35523738] [2019-12-18 22:34:35,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:34:35,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:35,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:34:35,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:34:35,538 INFO L87 Difference]: Start difference. First operand 149024 states and 615188 transitions. Second operand 4 states. [2019-12-18 22:34:37,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:37,698 INFO L93 Difference]: Finished difference Result 176806 states and 719392 transitions. [2019-12-18 22:34:37,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:34:37,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 22:34:37,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:38,244 INFO L225 Difference]: With dead ends: 176806 [2019-12-18 22:34:38,245 INFO L226 Difference]: Without dead ends: 176726 [2019-12-18 22:34:38,245 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:34:48,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176726 states. [2019-12-18 22:34:50,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176726 to 154481. [2019-12-18 22:34:50,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154481 states. [2019-12-18 22:34:52,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154481 states to 154481 states and 636822 transitions. [2019-12-18 22:34:52,388 INFO L78 Accepts]: Start accepts. Automaton has 154481 states and 636822 transitions. Word has length 14 [2019-12-18 22:34:52,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:52,388 INFO L462 AbstractCegarLoop]: Abstraction has 154481 states and 636822 transitions. [2019-12-18 22:34:52,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:34:52,388 INFO L276 IsEmpty]: Start isEmpty. Operand 154481 states and 636822 transitions. [2019-12-18 22:34:52,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:34:52,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:52,391 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:52,392 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:52,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:52,392 INFO L82 PathProgramCache]: Analyzing trace with hash 140256175, now seen corresponding path program 1 times [2019-12-18 22:34:52,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:52,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290700385] [2019-12-18 22:34:52,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:52,482 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:34:52,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290700385] [2019-12-18 22:34:52,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:52,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:34:52,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894658302] [2019-12-18 22:34:52,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:34:52,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:52,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:34:52,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:34:52,484 INFO L87 Difference]: Start difference. First operand 154481 states and 636822 transitions. Second operand 4 states. [2019-12-18 22:34:53,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:53,663 INFO L93 Difference]: Finished difference Result 181899 states and 742115 transitions. [2019-12-18 22:34:53,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:34:53,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 22:34:53,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:55,776 INFO L225 Difference]: With dead ends: 181899 [2019-12-18 22:34:55,776 INFO L226 Difference]: Without dead ends: 181811 [2019-12-18 22:34:55,776 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:35:05,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181811 states. [2019-12-18 22:35:08,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181811 to 156231. [2019-12-18 22:35:08,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156231 states. [2019-12-18 22:35:09,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156231 states to 156231 states and 644534 transitions. [2019-12-18 22:35:09,438 INFO L78 Accepts]: Start accepts. Automaton has 156231 states and 644534 transitions. Word has length 14 [2019-12-18 22:35:09,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:09,438 INFO L462 AbstractCegarLoop]: Abstraction has 156231 states and 644534 transitions. [2019-12-18 22:35:09,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:35:09,439 INFO L276 IsEmpty]: Start isEmpty. Operand 156231 states and 644534 transitions. [2019-12-18 22:35:09,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 22:35:09,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:09,457 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:35:09,458 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:09,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:09,458 INFO L82 PathProgramCache]: Analyzing trace with hash -757674417, now seen corresponding path program 1 times [2019-12-18 22:35:09,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:09,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823651025] [2019-12-18 22:35:09,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:09,505 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:35:09,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823651025] [2019-12-18 22:35:09,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:09,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:35:09,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770968415] [2019-12-18 22:35:09,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:35:09,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:09,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:35:09,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:35:09,508 INFO L87 Difference]: Start difference. First operand 156231 states and 644534 transitions. Second operand 3 states. [2019-12-18 22:35:11,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:11,399 INFO L93 Difference]: Finished difference Result 155313 states and 640741 transitions. [2019-12-18 22:35:11,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:35:11,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 22:35:11,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:11,882 INFO L225 Difference]: With dead ends: 155313 [2019-12-18 22:35:11,882 INFO L226 Difference]: Without dead ends: 155313 [2019-12-18 22:35:11,882 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:35:21,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155313 states. [2019-12-18 22:35:23,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155313 to 155313. [2019-12-18 22:35:23,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155313 states. [2019-12-18 22:35:25,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155313 states to 155313 states and 640741 transitions. [2019-12-18 22:35:25,105 INFO L78 Accepts]: Start accepts. Automaton has 155313 states and 640741 transitions. Word has length 18 [2019-12-18 22:35:25,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:25,106 INFO L462 AbstractCegarLoop]: Abstraction has 155313 states and 640741 transitions. [2019-12-18 22:35:25,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:35:25,106 INFO L276 IsEmpty]: Start isEmpty. Operand 155313 states and 640741 transitions. [2019-12-18 22:35:25,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 22:35:25,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:25,127 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:35:25,127 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:25,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:25,127 INFO L82 PathProgramCache]: Analyzing trace with hash -562123947, now seen corresponding path program 1 times [2019-12-18 22:35:25,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:25,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771805283] [2019-12-18 22:35:25,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:25,184 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:35:25,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771805283] [2019-12-18 22:35:25,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:25,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:35:25,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823830498] [2019-12-18 22:35:25,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:35:25,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:25,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:35:25,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:35:25,187 INFO L87 Difference]: Start difference. First operand 155313 states and 640741 transitions. Second operand 4 states. [2019-12-18 22:35:33,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:33,081 INFO L93 Difference]: Finished difference Result 243262 states and 1008109 transitions. [2019-12-18 22:35:33,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:35:33,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 22:35:33,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:33,480 INFO L225 Difference]: With dead ends: 243262 [2019-12-18 22:35:33,481 INFO L226 Difference]: Without dead ends: 120708 [2019-12-18 22:35:33,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:35:36,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120708 states. [2019-12-18 22:35:38,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120708 to 120708. [2019-12-18 22:35:38,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120708 states. [2019-12-18 22:35:39,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120708 states to 120708 states and 492233 transitions. [2019-12-18 22:35:39,689 INFO L78 Accepts]: Start accepts. Automaton has 120708 states and 492233 transitions. Word has length 19 [2019-12-18 22:35:39,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:39,689 INFO L462 AbstractCegarLoop]: Abstraction has 120708 states and 492233 transitions. [2019-12-18 22:35:39,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:35:39,689 INFO L276 IsEmpty]: Start isEmpty. Operand 120708 states and 492233 transitions. [2019-12-18 22:35:39,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 22:35:39,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:39,703 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:35:39,703 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:39,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:39,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1224805741, now seen corresponding path program 1 times [2019-12-18 22:35:39,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:39,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632234377] [2019-12-18 22:35:39,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:39,787 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:35:39,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632234377] [2019-12-18 22:35:39,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:39,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:35:39,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736780220] [2019-12-18 22:35:39,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:35:39,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:39,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:35:39,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:35:39,789 INFO L87 Difference]: Start difference. First operand 120708 states and 492233 transitions. Second operand 4 states. [2019-12-18 22:35:39,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:39,944 INFO L93 Difference]: Finished difference Result 34867 states and 119851 transitions. [2019-12-18 22:35:39,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:35:39,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 22:35:39,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:39,992 INFO L225 Difference]: With dead ends: 34867 [2019-12-18 22:35:39,992 INFO L226 Difference]: Without dead ends: 27307 [2019-12-18 22:35:39,993 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:35:40,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27307 states. [2019-12-18 22:35:40,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27307 to 27307. [2019-12-18 22:35:40,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27307 states. [2019-12-18 22:35:40,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27307 states to 27307 states and 90236 transitions. [2019-12-18 22:35:40,467 INFO L78 Accepts]: Start accepts. Automaton has 27307 states and 90236 transitions. Word has length 19 [2019-12-18 22:35:40,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:40,467 INFO L462 AbstractCegarLoop]: Abstraction has 27307 states and 90236 transitions. [2019-12-18 22:35:40,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:35:40,467 INFO L276 IsEmpty]: Start isEmpty. Operand 27307 states and 90236 transitions. [2019-12-18 22:35:40,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 22:35:40,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:40,473 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:35:40,473 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:40,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:40,473 INFO L82 PathProgramCache]: Analyzing trace with hash -108369065, now seen corresponding path program 1 times [2019-12-18 22:35:40,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:40,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276072048] [2019-12-18 22:35:40,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:40,557 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:35:40,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276072048] [2019-12-18 22:35:40,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:40,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:35:40,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385424411] [2019-12-18 22:35:40,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:35:40,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:40,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:35:40,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:35:40,559 INFO L87 Difference]: Start difference. First operand 27307 states and 90236 transitions. Second operand 5 states. [2019-12-18 22:35:41,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:41,010 INFO L93 Difference]: Finished difference Result 36015 states and 116977 transitions. [2019-12-18 22:35:41,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:35:41,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 22:35:41,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:41,068 INFO L225 Difference]: With dead ends: 36015 [2019-12-18 22:35:41,068 INFO L226 Difference]: Without dead ends: 35713 [2019-12-18 22:35:41,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:35:41,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35713 states. [2019-12-18 22:35:43,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35713 to 28287. [2019-12-18 22:35:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28287 states. [2019-12-18 22:35:43,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28287 states to 28287 states and 93457 transitions. [2019-12-18 22:35:43,479 INFO L78 Accepts]: Start accepts. Automaton has 28287 states and 93457 transitions. Word has length 22 [2019-12-18 22:35:43,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:43,479 INFO L462 AbstractCegarLoop]: Abstraction has 28287 states and 93457 transitions. [2019-12-18 22:35:43,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:35:43,480 INFO L276 IsEmpty]: Start isEmpty. Operand 28287 states and 93457 transitions. [2019-12-18 22:35:43,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 22:35:43,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:43,485 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:35:43,485 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:43,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:43,486 INFO L82 PathProgramCache]: Analyzing trace with hash 576586499, now seen corresponding path program 1 times [2019-12-18 22:35:43,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:43,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462925157] [2019-12-18 22:35:43,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:43,563 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:35:43,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462925157] [2019-12-18 22:35:43,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:43,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:35:43,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115219596] [2019-12-18 22:35:43,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:35:43,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:43,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:35:43,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:35:43,566 INFO L87 Difference]: Start difference. First operand 28287 states and 93457 transitions. Second operand 5 states. [2019-12-18 22:35:44,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:44,090 INFO L93 Difference]: Finished difference Result 36002 states and 117278 transitions. [2019-12-18 22:35:44,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:35:44,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 22:35:44,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:44,148 INFO L225 Difference]: With dead ends: 36002 [2019-12-18 22:35:44,148 INFO L226 Difference]: Without dead ends: 35602 [2019-12-18 22:35:44,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:35:44,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35602 states. [2019-12-18 22:35:44,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35602 to 27135. [2019-12-18 22:35:44,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27135 states. [2019-12-18 22:35:44,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27135 states to 27135 states and 89912 transitions. [2019-12-18 22:35:44,696 INFO L78 Accepts]: Start accepts. Automaton has 27135 states and 89912 transitions. Word has length 22 [2019-12-18 22:35:44,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:44,696 INFO L462 AbstractCegarLoop]: Abstraction has 27135 states and 89912 transitions. [2019-12-18 22:35:44,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:35:44,696 INFO L276 IsEmpty]: Start isEmpty. Operand 27135 states and 89912 transitions. [2019-12-18 22:35:44,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:35:44,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:44,705 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:35:44,705 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:44,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:44,705 INFO L82 PathProgramCache]: Analyzing trace with hash -589690530, now seen corresponding path program 1 times [2019-12-18 22:35:44,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:44,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10000770] [2019-12-18 22:35:44,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:44,792 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:35:44,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10000770] [2019-12-18 22:35:44,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:44,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:35:44,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199226603] [2019-12-18 22:35:44,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:35:44,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:44,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:35:44,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:35:44,794 INFO L87 Difference]: Start difference. First operand 27135 states and 89912 transitions. Second operand 5 states. [2019-12-18 22:35:45,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:45,184 INFO L93 Difference]: Finished difference Result 27534 states and 90654 transitions. [2019-12-18 22:35:45,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:35:45,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 22:35:45,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:45,251 INFO L225 Difference]: With dead ends: 27534 [2019-12-18 22:35:45,251 INFO L226 Difference]: Without dead ends: 27114 [2019-12-18 22:35:45,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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:35:45,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27114 states. [2019-12-18 22:35:46,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27114 to 26972. [2019-12-18 22:35:46,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26972 states. [2019-12-18 22:35:46,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26972 states to 26972 states and 89404 transitions. [2019-12-18 22:35:46,150 INFO L78 Accepts]: Start accepts. Automaton has 26972 states and 89404 transitions. Word has length 25 [2019-12-18 22:35:46,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:46,150 INFO L462 AbstractCegarLoop]: Abstraction has 26972 states and 89404 transitions. [2019-12-18 22:35:46,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:35:46,150 INFO L276 IsEmpty]: Start isEmpty. Operand 26972 states and 89404 transitions. [2019-12-18 22:35:46,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 22:35:46,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:46,163 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:35:46,163 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:46,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:46,163 INFO L82 PathProgramCache]: Analyzing trace with hash 40947621, now seen corresponding path program 1 times [2019-12-18 22:35:46,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:46,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027253333] [2019-12-18 22:35:46,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:46,228 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:35:46,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027253333] [2019-12-18 22:35:46,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:46,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:35:46,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398442725] [2019-12-18 22:35:46,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:35:46,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:46,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:35:46,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:35:46,232 INFO L87 Difference]: Start difference. First operand 26972 states and 89404 transitions. Second operand 5 states. [2019-12-18 22:35:46,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:46,344 INFO L93 Difference]: Finished difference Result 12492 states and 38303 transitions. [2019-12-18 22:35:46,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:35:46,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 22:35:46,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:46,359 INFO L225 Difference]: With dead ends: 12492 [2019-12-18 22:35:46,359 INFO L226 Difference]: Without dead ends: 10644 [2019-12-18 22:35:46,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:35:46,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10644 states. [2019-12-18 22:35:46,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10644 to 10604. [2019-12-18 22:35:46,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10604 states. [2019-12-18 22:35:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10604 states to 10604 states and 32266 transitions. [2019-12-18 22:35:46,512 INFO L78 Accepts]: Start accepts. Automaton has 10604 states and 32266 transitions. Word has length 28 [2019-12-18 22:35:46,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:46,513 INFO L462 AbstractCegarLoop]: Abstraction has 10604 states and 32266 transitions. [2019-12-18 22:35:46,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:35:46,513 INFO L276 IsEmpty]: Start isEmpty. Operand 10604 states and 32266 transitions. [2019-12-18 22:35:46,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 22:35:46,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:46,527 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:35:46,528 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:46,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:46,528 INFO L82 PathProgramCache]: Analyzing trace with hash -112163197, now seen corresponding path program 1 times [2019-12-18 22:35:46,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:46,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567839302] [2019-12-18 22:35:46,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:46,571 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:35:46,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567839302] [2019-12-18 22:35:46,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:46,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:35:46,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043658651] [2019-12-18 22:35:46,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:35:46,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:46,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:35:46,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:35:46,573 INFO L87 Difference]: Start difference. First operand 10604 states and 32266 transitions. Second operand 3 states. [2019-12-18 22:35:46,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:46,649 INFO L93 Difference]: Finished difference Result 16413 states and 50245 transitions. [2019-12-18 22:35:46,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:35:46,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 22:35:46,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:46,663 INFO L225 Difference]: With dead ends: 16413 [2019-12-18 22:35:46,663 INFO L226 Difference]: Without dead ends: 6546 [2019-12-18 22:35:46,665 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:35:46,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6546 states. [2019-12-18 22:35:46,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6546 to 6220. [2019-12-18 22:35:46,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2019-12-18 22:35:46,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 18995 transitions. [2019-12-18 22:35:46,823 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 18995 transitions. Word has length 39 [2019-12-18 22:35:46,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:46,824 INFO L462 AbstractCegarLoop]: Abstraction has 6220 states and 18995 transitions. [2019-12-18 22:35:46,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:35:46,824 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 18995 transitions. [2019-12-18 22:35:46,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 22:35:46,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:46,836 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:35:46,836 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:46,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:46,837 INFO L82 PathProgramCache]: Analyzing trace with hash -2009375071, now seen corresponding path program 1 times [2019-12-18 22:35:46,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:46,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174200677] [2019-12-18 22:35:46,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:46,976 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:35:46,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174200677] [2019-12-18 22:35:46,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:46,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:35:46,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719160185] [2019-12-18 22:35:46,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:35:46,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:46,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:35:46,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:35:46,979 INFO L87 Difference]: Start difference. First operand 6220 states and 18995 transitions. Second operand 6 states. [2019-12-18 22:35:47,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:47,079 INFO L93 Difference]: Finished difference Result 5287 states and 16625 transitions. [2019-12-18 22:35:47,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:35:47,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 22:35:47,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:47,091 INFO L225 Difference]: With dead ends: 5287 [2019-12-18 22:35:47,091 INFO L226 Difference]: Without dead ends: 4788 [2019-12-18 22:35:47,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:35:47,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4788 states. [2019-12-18 22:35:47,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4788 to 4788. [2019-12-18 22:35:47,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4788 states. [2019-12-18 22:35:47,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4788 states to 4788 states and 15565 transitions. [2019-12-18 22:35:47,214 INFO L78 Accepts]: Start accepts. Automaton has 4788 states and 15565 transitions. Word has length 40 [2019-12-18 22:35:47,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:47,214 INFO L462 AbstractCegarLoop]: Abstraction has 4788 states and 15565 transitions. [2019-12-18 22:35:47,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:35:47,215 INFO L276 IsEmpty]: Start isEmpty. Operand 4788 states and 15565 transitions. [2019-12-18 22:35:47,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:35:47,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:47,231 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] [2019-12-18 22:35:47,231 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:47,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:47,231 INFO L82 PathProgramCache]: Analyzing trace with hash -26633300, now seen corresponding path program 1 times [2019-12-18 22:35:47,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:47,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831848869] [2019-12-18 22:35:47,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:47,326 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:35:47,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831848869] [2019-12-18 22:35:47,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:47,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:35:47,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181867485] [2019-12-18 22:35:47,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:35:47,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:47,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:35:47,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:35:47,330 INFO L87 Difference]: Start difference. First operand 4788 states and 15565 transitions. Second operand 7 states. [2019-12-18 22:35:47,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:47,569 INFO L93 Difference]: Finished difference Result 9084 states and 28982 transitions. [2019-12-18 22:35:47,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 22:35:47,569 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 22:35:47,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:47,582 INFO L225 Difference]: With dead ends: 9084 [2019-12-18 22:35:47,583 INFO L226 Difference]: Without dead ends: 6576 [2019-12-18 22:35:47,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:35:47,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6576 states. [2019-12-18 22:35:47,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6576 to 5930. [2019-12-18 22:35:47,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5930 states. [2019-12-18 22:35:47,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5930 states to 5930 states and 19209 transitions. [2019-12-18 22:35:47,708 INFO L78 Accepts]: Start accepts. Automaton has 5930 states and 19209 transitions. Word has length 54 [2019-12-18 22:35:47,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:47,708 INFO L462 AbstractCegarLoop]: Abstraction has 5930 states and 19209 transitions. [2019-12-18 22:35:47,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:35:47,708 INFO L276 IsEmpty]: Start isEmpty. Operand 5930 states and 19209 transitions. [2019-12-18 22:35:47,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:35:47,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:47,716 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] [2019-12-18 22:35:47,716 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:47,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:47,716 INFO L82 PathProgramCache]: Analyzing trace with hash 219895980, now seen corresponding path program 2 times [2019-12-18 22:35:47,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:47,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971538366] [2019-12-18 22:35:47,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:47,795 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:35:47,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971538366] [2019-12-18 22:35:47,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:47,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:35:47,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843604528] [2019-12-18 22:35:47,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:35:47,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:47,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:35:47,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:35:47,798 INFO L87 Difference]: Start difference. First operand 5930 states and 19209 transitions. Second operand 7 states. [2019-12-18 22:35:48,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:48,060 INFO L93 Difference]: Finished difference Result 11036 states and 34911 transitions. [2019-12-18 22:35:48,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 22:35:48,061 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 22:35:48,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:48,077 INFO L225 Difference]: With dead ends: 11036 [2019-12-18 22:35:48,077 INFO L226 Difference]: Without dead ends: 8066 [2019-12-18 22:35:48,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:35:48,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8066 states. [2019-12-18 22:35:48,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8066 to 7238. [2019-12-18 22:35:48,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7238 states. [2019-12-18 22:35:48,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7238 states to 7238 states and 23230 transitions. [2019-12-18 22:35:48,351 INFO L78 Accepts]: Start accepts. Automaton has 7238 states and 23230 transitions. Word has length 54 [2019-12-18 22:35:48,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:48,352 INFO L462 AbstractCegarLoop]: Abstraction has 7238 states and 23230 transitions. [2019-12-18 22:35:48,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:35:48,352 INFO L276 IsEmpty]: Start isEmpty. Operand 7238 states and 23230 transitions. [2019-12-18 22:35:48,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:35:48,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:48,360 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] [2019-12-18 22:35:48,360 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:48,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:48,361 INFO L82 PathProgramCache]: Analyzing trace with hash 625959458, now seen corresponding path program 3 times [2019-12-18 22:35:48,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:48,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307950355] [2019-12-18 22:35:48,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:48,453 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:35:48,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307950355] [2019-12-18 22:35:48,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:48,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:35:48,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226119171] [2019-12-18 22:35:48,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 22:35:48,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:48,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 22:35:48,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:35:48,455 INFO L87 Difference]: Start difference. First operand 7238 states and 23230 transitions. Second operand 8 states. [2019-12-18 22:35:49,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:49,200 INFO L93 Difference]: Finished difference Result 15765 states and 48235 transitions. [2019-12-18 22:35:49,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 22:35:49,201 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-18 22:35:49,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:49,224 INFO L225 Difference]: With dead ends: 15765 [2019-12-18 22:35:49,225 INFO L226 Difference]: Without dead ends: 13391 [2019-12-18 22:35:49,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-18 22:35:49,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13391 states. [2019-12-18 22:35:49,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13391 to 7278. [2019-12-18 22:35:49,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7278 states. [2019-12-18 22:35:49,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7278 states to 7278 states and 23316 transitions. [2019-12-18 22:35:49,384 INFO L78 Accepts]: Start accepts. Automaton has 7278 states and 23316 transitions. Word has length 54 [2019-12-18 22:35:49,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:49,385 INFO L462 AbstractCegarLoop]: Abstraction has 7278 states and 23316 transitions. [2019-12-18 22:35:49,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 22:35:49,385 INFO L276 IsEmpty]: Start isEmpty. Operand 7278 states and 23316 transitions. [2019-12-18 22:35:49,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:35:49,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:49,393 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] [2019-12-18 22:35:49,394 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:49,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:49,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1940623004, now seen corresponding path program 4 times [2019-12-18 22:35:49,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:49,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567271641] [2019-12-18 22:35:49,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:49,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:35:49,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567271641] [2019-12-18 22:35:49,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:49,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:35:49,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233030061] [2019-12-18 22:35:49,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:35:49,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:49,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:35:49,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:35:49,502 INFO L87 Difference]: Start difference. First operand 7278 states and 23316 transitions. Second operand 9 states. [2019-12-18 22:35:50,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:50,541 INFO L93 Difference]: Finished difference Result 21985 states and 67252 transitions. [2019-12-18 22:35:50,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 22:35:50,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 22:35:50,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:50,580 INFO L225 Difference]: With dead ends: 21985 [2019-12-18 22:35:50,580 INFO L226 Difference]: Without dead ends: 19611 [2019-12-18 22:35:50,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2019-12-18 22:35:50,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19611 states. [2019-12-18 22:35:50,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19611 to 7158. [2019-12-18 22:35:50,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7158 states. [2019-12-18 22:35:50,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7158 states to 7158 states and 22938 transitions. [2019-12-18 22:35:50,791 INFO L78 Accepts]: Start accepts. Automaton has 7158 states and 22938 transitions. Word has length 54 [2019-12-18 22:35:50,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:50,791 INFO L462 AbstractCegarLoop]: Abstraction has 7158 states and 22938 transitions. [2019-12-18 22:35:50,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:35:50,792 INFO L276 IsEmpty]: Start isEmpty. Operand 7158 states and 22938 transitions. [2019-12-18 22:35:50,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:35:50,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:50,803 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] [2019-12-18 22:35:50,803 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:50,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:50,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1600716830, now seen corresponding path program 5 times [2019-12-18 22:35:50,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:50,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325527319] [2019-12-18 22:35:50,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:50,928 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:35:50,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325527319] [2019-12-18 22:35:50,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:50,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:35:50,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203643144] [2019-12-18 22:35:50,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:35:50,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:50,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:35:50,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:35:50,930 INFO L87 Difference]: Start difference. First operand 7158 states and 22938 transitions. Second operand 9 states. [2019-12-18 22:35:52,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:52,327 INFO L93 Difference]: Finished difference Result 29906 states and 91401 transitions. [2019-12-18 22:35:52,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 22:35:52,327 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 22:35:52,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:52,360 INFO L225 Difference]: With dead ends: 29906 [2019-12-18 22:35:52,361 INFO L226 Difference]: Without dead ends: 23860 [2019-12-18 22:35:52,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=347, Invalid=985, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 22:35:52,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23860 states. [2019-12-18 22:35:52,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23860 to 9222. [2019-12-18 22:35:52,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9222 states. [2019-12-18 22:35:52,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9222 states to 9222 states and 29627 transitions. [2019-12-18 22:35:52,607 INFO L78 Accepts]: Start accepts. Automaton has 9222 states and 29627 transitions. Word has length 54 [2019-12-18 22:35:52,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:52,607 INFO L462 AbstractCegarLoop]: Abstraction has 9222 states and 29627 transitions. [2019-12-18 22:35:52,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:35:52,607 INFO L276 IsEmpty]: Start isEmpty. Operand 9222 states and 29627 transitions. [2019-12-18 22:35:52,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:35:52,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:52,618 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] [2019-12-18 22:35:52,618 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:52,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:52,619 INFO L82 PathProgramCache]: Analyzing trace with hash 644386982, now seen corresponding path program 6 times [2019-12-18 22:35:52,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:52,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502089348] [2019-12-18 22:35:52,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:52,722 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:35:52,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502089348] [2019-12-18 22:35:52,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:52,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:35:52,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066155512] [2019-12-18 22:35:52,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:35:52,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:52,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:35:52,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:35:52,724 INFO L87 Difference]: Start difference. First operand 9222 states and 29627 transitions. Second operand 7 states. [2019-12-18 22:35:53,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:53,468 INFO L93 Difference]: Finished difference Result 20541 states and 63453 transitions. [2019-12-18 22:35:53,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 22:35:53,469 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 22:35:53,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:53,499 INFO L225 Difference]: With dead ends: 20541 [2019-12-18 22:35:53,499 INFO L226 Difference]: Without dead ends: 20457 [2019-12-18 22:35:53,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:35:53,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20457 states. [2019-12-18 22:35:53,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20457 to 13774. [2019-12-18 22:35:53,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13774 states. [2019-12-18 22:35:53,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13774 states to 13774 states and 42784 transitions. [2019-12-18 22:35:53,758 INFO L78 Accepts]: Start accepts. Automaton has 13774 states and 42784 transitions. Word has length 54 [2019-12-18 22:35:53,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:53,758 INFO L462 AbstractCegarLoop]: Abstraction has 13774 states and 42784 transitions. [2019-12-18 22:35:53,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:35:53,758 INFO L276 IsEmpty]: Start isEmpty. Operand 13774 states and 42784 transitions. [2019-12-18 22:35:53,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:35:53,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:53,781 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] [2019-12-18 22:35:53,781 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:53,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:53,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1158703824, now seen corresponding path program 7 times [2019-12-18 22:35:53,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:53,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537830600] [2019-12-18 22:35:53,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:53,865 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:35:53,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537830600] [2019-12-18 22:35:53,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:53,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:35:53,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179257569] [2019-12-18 22:35:53,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:35:53,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:53,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:35:53,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:35:53,868 INFO L87 Difference]: Start difference. First operand 13774 states and 42784 transitions. Second operand 6 states. [2019-12-18 22:35:54,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:54,473 INFO L93 Difference]: Finished difference Result 21447 states and 65099 transitions. [2019-12-18 22:35:54,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:35:54,474 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-18 22:35:54,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:54,506 INFO L225 Difference]: With dead ends: 21447 [2019-12-18 22:35:54,506 INFO L226 Difference]: Without dead ends: 21337 [2019-12-18 22:35:54,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:35:54,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21337 states. [2019-12-18 22:35:54,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21337 to 17792. [2019-12-18 22:35:54,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17792 states. [2019-12-18 22:35:54,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17792 states to 17792 states and 55019 transitions. [2019-12-18 22:35:54,799 INFO L78 Accepts]: Start accepts. Automaton has 17792 states and 55019 transitions. Word has length 54 [2019-12-18 22:35:54,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:54,800 INFO L462 AbstractCegarLoop]: Abstraction has 17792 states and 55019 transitions. [2019-12-18 22:35:54,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:35:54,800 INFO L276 IsEmpty]: Start isEmpty. Operand 17792 states and 55019 transitions. [2019-12-18 22:35:54,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:35:54,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:54,826 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:35:54,826 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:54,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:54,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1984492944, now seen corresponding path program 8 times [2019-12-18 22:35:54,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:54,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564348387] [2019-12-18 22:35:54,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:54,889 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:35:54,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564348387] [2019-12-18 22:35:54,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:54,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:35:54,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608126449] [2019-12-18 22:35:54,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:35:54,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:54,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:35:54,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:35:54,891 INFO L87 Difference]: Start difference. First operand 17792 states and 55019 transitions. Second operand 3 states. [2019-12-18 22:35:55,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:55,178 INFO L93 Difference]: Finished difference Result 17790 states and 55014 transitions. [2019-12-18 22:35:55,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:35:55,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 22:35:55,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:55,214 INFO L225 Difference]: With dead ends: 17790 [2019-12-18 22:35:55,214 INFO L226 Difference]: Without dead ends: 17790 [2019-12-18 22:35:55,214 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:35:55,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17790 states. [2019-12-18 22:35:55,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17790 to 15448. [2019-12-18 22:35:55,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15448 states. [2019-12-18 22:35:55,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15448 states to 15448 states and 48469 transitions. [2019-12-18 22:35:55,679 INFO L78 Accepts]: Start accepts. Automaton has 15448 states and 48469 transitions. Word has length 54 [2019-12-18 22:35:55,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:55,680 INFO L462 AbstractCegarLoop]: Abstraction has 15448 states and 48469 transitions. [2019-12-18 22:35:55,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:35:55,680 INFO L276 IsEmpty]: Start isEmpty. Operand 15448 states and 48469 transitions. [2019-12-18 22:35:55,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:35:55,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:55,715 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] [2019-12-18 22:35:55,715 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:55,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:55,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1045193736, now seen corresponding path program 1 times [2019-12-18 22:35:55,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:55,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939777750] [2019-12-18 22:35:55,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:55,814 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:35:55,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939777750] [2019-12-18 22:35:55,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:55,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:35:55,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493202528] [2019-12-18 22:35:55,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:35:55,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:55,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:35:55,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:35:55,819 INFO L87 Difference]: Start difference. First operand 15448 states and 48469 transitions. Second operand 3 states. [2019-12-18 22:35:55,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:55,906 INFO L93 Difference]: Finished difference Result 10874 states and 33734 transitions. [2019-12-18 22:35:55,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:35:55,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 22:35:55,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:55,936 INFO L225 Difference]: With dead ends: 10874 [2019-12-18 22:35:55,936 INFO L226 Difference]: Without dead ends: 10874 [2019-12-18 22:35:55,937 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:35:56,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10874 states. [2019-12-18 22:35:56,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10874 to 10632. [2019-12-18 22:35:56,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10632 states. [2019-12-18 22:35:56,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10632 states to 10632 states and 33043 transitions. [2019-12-18 22:35:56,280 INFO L78 Accepts]: Start accepts. Automaton has 10632 states and 33043 transitions. Word has length 55 [2019-12-18 22:35:56,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:56,280 INFO L462 AbstractCegarLoop]: Abstraction has 10632 states and 33043 transitions. [2019-12-18 22:35:56,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:35:56,280 INFO L276 IsEmpty]: Start isEmpty. Operand 10632 states and 33043 transitions. [2019-12-18 22:35:56,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:35:56,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:56,304 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] [2019-12-18 22:35:56,304 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:56,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:56,305 INFO L82 PathProgramCache]: Analyzing trace with hash -887839476, now seen corresponding path program 1 times [2019-12-18 22:35:56,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:56,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649942474] [2019-12-18 22:35:56,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:56,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:35:56,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649942474] [2019-12-18 22:35:56,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:56,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 22:35:56,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182258757] [2019-12-18 22:35:56,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 22:35:56,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:56,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 22:35:56,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:35:56,776 INFO L87 Difference]: Start difference. First operand 10632 states and 33043 transitions. Second operand 15 states. [2019-12-18 22:35:59,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:59,673 INFO L93 Difference]: Finished difference Result 15523 states and 47384 transitions. [2019-12-18 22:35:59,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 22:35:59,673 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-18 22:35:59,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:59,693 INFO L225 Difference]: With dead ends: 15523 [2019-12-18 22:35:59,693 INFO L226 Difference]: Without dead ends: 12813 [2019-12-18 22:35:59,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=426, Invalid=2124, Unknown=0, NotChecked=0, Total=2550 [2019-12-18 22:35:59,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12813 states. [2019-12-18 22:35:59,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12813 to 11054. [2019-12-18 22:35:59,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11054 states. [2019-12-18 22:36:00,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11054 states to 11054 states and 34153 transitions. [2019-12-18 22:36:00,063 INFO L78 Accepts]: Start accepts. Automaton has 11054 states and 34153 transitions. Word has length 56 [2019-12-18 22:36:00,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:00,063 INFO L462 AbstractCegarLoop]: Abstraction has 11054 states and 34153 transitions. [2019-12-18 22:36:00,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 22:36:00,063 INFO L276 IsEmpty]: Start isEmpty. Operand 11054 states and 34153 transitions. [2019-12-18 22:36:00,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:36:00,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:00,074 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:36:00,074 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:00,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:00,074 INFO L82 PathProgramCache]: Analyzing trace with hash -2011437082, now seen corresponding path program 2 times [2019-12-18 22:36:00,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:00,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077023449] [2019-12-18 22:36:00,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:00,262 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:36:00,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077023449] [2019-12-18 22:36:00,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:00,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:36:00,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215293662] [2019-12-18 22:36:00,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:36:00,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:00,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:36:00,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:36:00,264 INFO L87 Difference]: Start difference. First operand 11054 states and 34153 transitions. Second operand 11 states. [2019-12-18 22:36:00,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:00,955 INFO L93 Difference]: Finished difference Result 17293 states and 52589 transitions. [2019-12-18 22:36:00,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 22:36:00,956 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 22:36:00,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:00,974 INFO L225 Difference]: With dead ends: 17293 [2019-12-18 22:36:00,974 INFO L226 Difference]: Without dead ends: 11845 [2019-12-18 22:36:00,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2019-12-18 22:36:01,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11845 states. [2019-12-18 22:36:01,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11845 to 10875. [2019-12-18 22:36:01,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10875 states. [2019-12-18 22:36:01,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10875 states to 10875 states and 33273 transitions. [2019-12-18 22:36:01,141 INFO L78 Accepts]: Start accepts. Automaton has 10875 states and 33273 transitions. Word has length 56 [2019-12-18 22:36:01,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:01,141 INFO L462 AbstractCegarLoop]: Abstraction has 10875 states and 33273 transitions. [2019-12-18 22:36:01,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:36:01,141 INFO L276 IsEmpty]: Start isEmpty. Operand 10875 states and 33273 transitions. [2019-12-18 22:36:01,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:36:01,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:01,153 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] [2019-12-18 22:36:01,153 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:01,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:01,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1805028998, now seen corresponding path program 3 times [2019-12-18 22:36:01,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:01,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321826041] [2019-12-18 22:36:01,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:01,490 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:36:01,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321826041] [2019-12-18 22:36:01,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:01,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:36:01,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359607935] [2019-12-18 22:36:01,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 22:36:01,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:01,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 22:36:01,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:36:01,493 INFO L87 Difference]: Start difference. First operand 10875 states and 33273 transitions. Second operand 12 states. [2019-12-18 22:36:02,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:02,209 INFO L93 Difference]: Finished difference Result 12116 states and 36398 transitions. [2019-12-18 22:36:02,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 22:36:02,210 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-18 22:36:02,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:02,227 INFO L225 Difference]: With dead ends: 12116 [2019-12-18 22:36:02,227 INFO L226 Difference]: Without dead ends: 11541 [2019-12-18 22:36:02,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 22:36:02,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11541 states. [2019-12-18 22:36:02,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11541 to 10557. [2019-12-18 22:36:02,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10557 states. [2019-12-18 22:36:02,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10557 states to 10557 states and 32409 transitions. [2019-12-18 22:36:02,395 INFO L78 Accepts]: Start accepts. Automaton has 10557 states and 32409 transitions. Word has length 56 [2019-12-18 22:36:02,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:02,395 INFO L462 AbstractCegarLoop]: Abstraction has 10557 states and 32409 transitions. [2019-12-18 22:36:02,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 22:36:02,395 INFO L276 IsEmpty]: Start isEmpty. Operand 10557 states and 32409 transitions. [2019-12-18 22:36:02,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:36:02,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:02,407 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] [2019-12-18 22:36:02,407 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:02,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:02,407 INFO L82 PathProgramCache]: Analyzing trace with hash 639764934, now seen corresponding path program 4 times [2019-12-18 22:36:02,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:02,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938908991] [2019-12-18 22:36:02,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:36:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:36:02,508 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:36:02,508 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:36:02,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_58| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2073~0.base_22| 1) |v_#valid_56|) (= 0 v_~__unbuffered_p0_EAX~0_13) (= |v_ULTIMATE.start_main_~#t2073~0.offset_18| 0) (= v_~x$r_buff1_thd1~0_42 0) (= 0 v_~x$r_buff0_thd2~0_26) (= 0 v_~x$w_buff1~0_26) (= 0 v_~x$r_buff0_thd0~0_22) (= v_~z~0_14 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~weak$$choice2~0_34) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2073~0.base_22| 4)) (= v_~x$r_buff1_thd0~0_21 0) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_cnt~0_19) (= 0 v_~weak$$choice0~0_7) (= 0 v_~__unbuffered_p2_EAX~0_13) (= v_~x$mem_tmp~0_10 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd2~0_19 0) (= 0 v_~x$r_buff0_thd3~0_20) (= v_~x$flush_delayed~0_12 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2073~0.base_22| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2073~0.base_22|) |v_ULTIMATE.start_main_~#t2073~0.offset_18| 0)) |v_#memory_int_23|) (= |v_#NULL.offset_4| 0) (= v_~x~0_22 0) (= v_~x$r_buff1_thd3~0_17 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2073~0.base_22|)) (= 0 v_~x$r_buff0_thd1~0_70) (= 0 v_~x$w_buff0~0_31) (= v_~main$tmp_guard1~0_13 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2073~0.base_22|) (= 0 v_~x$w_buff0_used~0_112) (= v_~x$w_buff1_used~0_68 0) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_31, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, ULTIMATE.start_main_~#t2075~0.base=|v_ULTIMATE.start_main_~#t2075~0.base_19|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_42, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_13, ULTIMATE.start_main_~#t2074~0.offset=|v_ULTIMATE.start_main_~#t2074~0.offset_18|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_68, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ULTIMATE.start_main_~#t2074~0.base=|v_ULTIMATE.start_main_~#t2074~0.base_23|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t2073~0.offset=|v_ULTIMATE.start_main_~#t2073~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x~0=v_~x~0_22, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_70, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_20|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_~#t2075~0.offset=|v_ULTIMATE.start_main_~#t2075~0.offset_14|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ULTIMATE.start_main_~#t2073~0.base=|v_ULTIMATE.start_main_~#t2073~0.base_22|, ~y~0=v_~y~0_9, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_21, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t2075~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t2075~0.offset, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2073~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2074~0.offset, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2074~0.base, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_~#t2073~0.offset, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 22:36:02,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L818-1-->L820: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2074~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2074~0.base_10|) |v_ULTIMATE.start_main_~#t2074~0.offset_9| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t2074~0.offset_9| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2074~0.base_10|) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2074~0.base_10|) 0) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2074~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2074~0.base_10|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2074~0.base_10| 4) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2074~0.offset=|v_ULTIMATE.start_main_~#t2074~0.offset_9|, ULTIMATE.start_main_~#t2074~0.base=|v_ULTIMATE.start_main_~#t2074~0.base_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2074~0.offset, ULTIMATE.start_main_~#t2074~0.base] because there is no mapped edge [2019-12-18 22:36:02,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] P1ENTRY-->L5-3: Formula: (and (= 1 v_~x$w_buff0~0_14) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_4|) (= v_~x$w_buff1_used~0_41 v_~x$w_buff0_used~0_70) (= 1 v_~x$w_buff0_used~0_69) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_4|) (= v_~x$w_buff0~0_15 v_~x$w_buff1~0_14) (= (mod v_~x$w_buff1_used~0_41 256) 0) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_15, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_70} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_14, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~x$w_buff1~0=v_~x$w_buff1~0_14, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_41, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_69} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 22:36:02,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L820-1-->L822: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2075~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2075~0.base_11|) |v_ULTIMATE.start_main_~#t2075~0.offset_10| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2075~0.base_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2075~0.base_11| 1)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2075~0.base_11|)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2075~0.base_11| 4) |v_#length_13|) (= |v_ULTIMATE.start_main_~#t2075~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t2075~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2075~0.base=|v_ULTIMATE.start_main_~#t2075~0.base_11|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t2075~0.offset=|v_ULTIMATE.start_main_~#t2075~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2075~0.base, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2075~0.offset] because there is no mapped edge [2019-12-18 22:36:02,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In133793735 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In133793735 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out133793735| ~x$w_buff1~0_In133793735)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out133793735| ~x~0_In133793735)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In133793735, ~x$w_buff1_used~0=~x$w_buff1_used~0_In133793735, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In133793735, ~x~0=~x~0_In133793735} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out133793735|, ~x$w_buff1~0=~x$w_buff1~0_In133793735, ~x$w_buff1_used~0=~x$w_buff1_used~0_In133793735, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In133793735, ~x~0=~x~0_In133793735} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 22:36:02,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_14 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 22:36:02,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1681320624 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In1681320624 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1681320624 |P2Thread1of1ForFork1_#t~ite34_Out1681320624|)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out1681320624| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1681320624, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1681320624} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1681320624|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1681320624, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1681320624} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 22:36:02,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1540872042 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1540872042 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1540872042|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In1540872042 |P1Thread1of1ForFork0_#t~ite28_Out1540872042|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1540872042, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1540872042} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1540872042, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1540872042|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1540872042} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 22:36:02,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L777-->L777-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In-1509456849 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1509456849 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1509456849 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-1509456849 256) 0))) (or (and (= ~x$w_buff1_used~0_In-1509456849 |P1Thread1of1ForFork0_#t~ite29_Out-1509456849|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1509456849|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1509456849, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1509456849, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1509456849, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1509456849} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1509456849, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1509456849, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1509456849, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1509456849|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1509456849} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 22:36:02,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L778-->L779: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-578770646 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-578770646 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-578770646)) (and (= ~x$r_buff0_thd2~0_In-578770646 ~x$r_buff0_thd2~0_Out-578770646) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-578770646, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-578770646} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-578770646|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-578770646, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-578770646} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 22:36:02,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-1199565585 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1199565585 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-1199565585 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1199565585 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out-1199565585| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out-1199565585| ~x$r_buff1_thd2~0_In-1199565585) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1199565585, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1199565585, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1199565585, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1199565585} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1199565585|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1199565585, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1199565585, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1199565585, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1199565585} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 22:36:02,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L779-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork0_#t~ite31_8|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 22:36:02,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-215341858 256) 0))) (or (and (= ~x$w_buff0~0_In-215341858 |P0Thread1of1ForFork2_#t~ite9_Out-215341858|) (= |P0Thread1of1ForFork2_#t~ite8_In-215341858| |P0Thread1of1ForFork2_#t~ite8_Out-215341858|) (not .cse0)) (and (= |P0Thread1of1ForFork2_#t~ite9_Out-215341858| |P0Thread1of1ForFork2_#t~ite8_Out-215341858|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-215341858 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-215341858 256)) (and (= (mod ~x$w_buff1_used~0_In-215341858 256) 0) .cse1) (and (= (mod ~x$r_buff1_thd1~0_In-215341858 256) 0) .cse1))) .cse0 (= ~x$w_buff0~0_In-215341858 |P0Thread1of1ForFork2_#t~ite8_Out-215341858|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-215341858, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-215341858, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-215341858|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-215341858, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-215341858, ~weak$$choice2~0=~weak$$choice2~0_In-215341858, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-215341858} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-215341858, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-215341858, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-215341858|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-215341858, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-215341858|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-215341858, ~weak$$choice2~0=~weak$$choice2~0_In-215341858, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-215341858} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 22:36:02,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L797-->L797-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In932228253 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In932228253 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In932228253 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In932228253 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite35_Out932228253| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In932228253 |P2Thread1of1ForFork1_#t~ite35_Out932228253|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In932228253, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In932228253, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In932228253, ~x$w_buff0_used~0=~x$w_buff0_used~0_In932228253} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out932228253|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In932228253, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In932228253, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In932228253, ~x$w_buff0_used~0=~x$w_buff0_used~0_In932228253} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 22:36:02,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In16442928 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In16442928 256) 0))) (or (and (= ~x$r_buff0_thd3~0_In16442928 |P2Thread1of1ForFork1_#t~ite36_Out16442928|) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out16442928| 0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In16442928, ~x$w_buff0_used~0=~x$w_buff0_used~0_In16442928} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out16442928|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In16442928, ~x$w_buff0_used~0=~x$w_buff0_used~0_In16442928} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 22:36:02,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1300848546 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1300848546 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1300848546 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In1300848546 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out1300848546| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out1300848546| ~x$r_buff1_thd3~0_In1300848546)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1300848546, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1300848546, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1300848546, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1300848546} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1300848546|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1300848546, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1300848546, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1300848546, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1300848546} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 22:36:02,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 22:36:02,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In873489479 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite17_In873489479| |P0Thread1of1ForFork2_#t~ite17_Out873489479|) (not .cse0) (= ~x$w_buff1_used~0_In873489479 |P0Thread1of1ForFork2_#t~ite18_Out873489479|)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In873489479 256)))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In873489479 256)) .cse1) (and (= 0 (mod ~x$w_buff1_used~0_In873489479 256)) .cse1) (= (mod ~x$w_buff0_used~0_In873489479 256) 0))) (= ~x$w_buff1_used~0_In873489479 |P0Thread1of1ForFork2_#t~ite17_Out873489479|) .cse0 (= |P0Thread1of1ForFork2_#t~ite18_Out873489479| |P0Thread1of1ForFork2_#t~ite17_Out873489479|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In873489479, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In873489479|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In873489479, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In873489479, ~weak$$choice2~0=~weak$$choice2~0_In873489479, ~x$w_buff0_used~0=~x$w_buff0_used~0_In873489479} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In873489479, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out873489479|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out873489479|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In873489479, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In873489479, ~weak$$choice2~0=~weak$$choice2~0_In873489479, ~x$w_buff0_used~0=~x$w_buff0_used~0_In873489479} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 22:36:02,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_53 v_~x$r_buff0_thd1~0_52) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_52, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_23, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 22:36:02,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L745-->L745-8: Formula: (let ((.cse4 (= (mod ~x$w_buff1_used~0_In-720345801 256) 0)) (.cse0 (= 0 (mod ~weak$$choice2~0_In-720345801 256))) (.cse5 (= |P0Thread1of1ForFork2_#t~ite23_Out-720345801| |P0Thread1of1ForFork2_#t~ite24_Out-720345801|)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-720345801 256))) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-720345801 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-720345801 256)))) (or (and (or (and (= |P0Thread1of1ForFork2_#t~ite23_Out-720345801| |P0Thread1of1ForFork2_#t~ite23_In-720345801|) (= |P0Thread1of1ForFork2_#t~ite24_Out-720345801| ~x$r_buff1_thd1~0_In-720345801) (not .cse0)) (and (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2)) .cse0 .cse5 (= |P0Thread1of1ForFork2_#t~ite23_Out-720345801| ~x$r_buff1_thd1~0_In-720345801))) (= |P0Thread1of1ForFork2_#t~ite22_In-720345801| |P0Thread1of1ForFork2_#t~ite22_Out-720345801|)) (let ((.cse6 (not .cse2))) (and (or .cse6 (not .cse4)) (= |P0Thread1of1ForFork2_#t~ite23_Out-720345801| |P0Thread1of1ForFork2_#t~ite22_Out-720345801|) .cse0 (= 0 |P0Thread1of1ForFork2_#t~ite22_Out-720345801|) .cse5 (not .cse3) (or .cse6 (not .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-720345801, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-720345801, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-720345801, ~weak$$choice2~0=~weak$$choice2~0_In-720345801, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-720345801|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_In-720345801|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-720345801} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-720345801, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-720345801, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-720345801, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-720345801|, ~weak$$choice2~0=~weak$$choice2~0_In-720345801, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-720345801|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_Out-720345801|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-720345801} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22] because there is no mapped edge [2019-12-18 22:36:02,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L747-->L755: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_4 v_~x~0_17) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 22:36:02,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L826-->L828-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= (mod v_~x$w_buff0_used~0_82 256) 0) (= (mod v_~x$r_buff0_thd0~0_14 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 22:36:02,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L828-2-->L828-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In888044248 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In888044248 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out888044248| ~x$w_buff1~0_In888044248) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite41_Out888044248| ~x~0_In888044248)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In888044248, ~x$w_buff1_used~0=~x$w_buff1_used~0_In888044248, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In888044248, ~x~0=~x~0_In888044248} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out888044248|, ~x$w_buff1~0=~x$w_buff1~0_In888044248, ~x$w_buff1_used~0=~x$w_buff1_used~0_In888044248, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In888044248, ~x~0=~x~0_In888044248} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 22:36:02,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_15 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 22:36:02,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1929423680 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1929423680 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out-1929423680|)) (and (= ~x$w_buff0_used~0_In-1929423680 |ULTIMATE.start_main_#t~ite43_Out-1929423680|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1929423680, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1929423680} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1929423680, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1929423680|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1929423680} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 22:36:02,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L830-->L830-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In256909242 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In256909242 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In256909242 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In256909242 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite44_Out256909242|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out256909242| ~x$w_buff1_used~0_In256909242)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In256909242, ~x$w_buff1_used~0=~x$w_buff1_used~0_In256909242, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In256909242, ~x$w_buff0_used~0=~x$w_buff0_used~0_In256909242} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In256909242, ~x$w_buff1_used~0=~x$w_buff1_used~0_In256909242, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In256909242, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out256909242|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In256909242} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 22:36:02,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1339990401 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1339990401 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In-1339990401 |ULTIMATE.start_main_#t~ite45_Out-1339990401|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-1339990401|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1339990401, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1339990401} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1339990401, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1339990401|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1339990401} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 22:36:02,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L832-->L832-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In605232528 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In605232528 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In605232528 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In605232528 256)))) (or (and (= ~x$r_buff1_thd0~0_In605232528 |ULTIMATE.start_main_#t~ite46_Out605232528|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite46_Out605232528| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In605232528, ~x$w_buff1_used~0=~x$w_buff1_used~0_In605232528, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In605232528, ~x$w_buff0_used~0=~x$w_buff0_used~0_In605232528} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In605232528, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out605232528|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In605232528, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In605232528, ~x$w_buff0_used~0=~x$w_buff0_used~0_In605232528} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 22:36:02,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z~0_11 2) (= v_~main$tmp_guard1~0_10 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_10 256)) (= 0 v_~__unbuffered_p0_EAX~0_10) (= 1 v_~__unbuffered_p2_EAX~0_10) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~x$r_buff1_thd0~0_18 |v_ULTIMATE.start_main_#t~ite46_16|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_11} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_18, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:36:02,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:36:02 BasicIcfg [2019-12-18 22:36:02,631 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:36:02,633 INFO L168 Benchmark]: Toolchain (without parser) took 159430.47 ms. Allocated memory was 144.2 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 101.1 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 22:36:02,633 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 144.2 MB. Free memory is still 120.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 22:36:02,634 INFO L168 Benchmark]: CACSL2BoogieTranslator took 770.53 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 100.6 MB in the beginning and 156.1 MB in the end (delta: -55.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:36:02,634 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.39 ms. Allocated memory is still 202.4 MB. Free memory was 156.1 MB in the beginning and 153.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:36:02,640 INFO L168 Benchmark]: Boogie Preprocessor took 37.72 ms. Allocated memory is still 202.4 MB. Free memory was 153.2 MB in the beginning and 151.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:36:02,640 INFO L168 Benchmark]: RCFGBuilder took 807.41 ms. Allocated memory is still 202.4 MB. Free memory was 151.3 MB in the beginning and 104.8 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:36:02,641 INFO L168 Benchmark]: TraceAbstraction took 157747.08 ms. Allocated memory was 202.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 103.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 22:36:02,643 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.19 ms. Allocated memory is still 144.2 MB. Free memory is still 120.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 770.53 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 100.6 MB in the beginning and 156.1 MB in the end (delta: -55.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.39 ms. Allocated memory is still 202.4 MB. Free memory was 156.1 MB in the beginning and 153.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.72 ms. Allocated memory is still 202.4 MB. Free memory was 153.2 MB in the beginning and 151.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 807.41 ms. Allocated memory is still 202.4 MB. Free memory was 151.3 MB in the beginning and 104.8 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 157747.08 ms. Allocated memory was 202.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 103.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 163 ProgramPointsBefore, 84 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 27 ChoiceCompositions, 6547 VarBasedMoverChecksPositive, 203 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 68909 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2073, ((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, z=0] [L820] FCALL, FORK 0 pthread_create(&t2074, ((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, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 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=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] 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 [__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=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2075, ((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=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 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=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 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) [L730] 1 z = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __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=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __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=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 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 [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __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=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 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 [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __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=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 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 [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 157.4s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 49.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4343 SDtfs, 8001 SDslu, 12877 SDs, 0 SdLazy, 6870 SolverSat, 396 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 326 GetRequests, 37 SyntacticMatches, 16 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1645 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156231occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 86.6s AutomataMinimizationTime, 27 MinimizatonAttempts, 187833 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1016 NumberOfCodeBlocks, 1016 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 933 ConstructedInterpolants, 0 QuantifiedInterpolants, 161778 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...