/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix015_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:37:07,855 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:37:07,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:37:07,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:37:07,876 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:37:07,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:37:07,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:37:07,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:37:07,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:37:07,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:37:07,900 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:37:07,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:37:07,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:37:07,907 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:37:07,910 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:37:07,912 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:37:07,913 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:37:07,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:37:07,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:37:07,923 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:37:07,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:37:07,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:37:07,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:37:07,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:37:07,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:37:07,933 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:37:07,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:37:07,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:37:07,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:37:07,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:37:07,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:37:07,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:37:07,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:37:07,941 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:37:07,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:37:07,943 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:37:07,944 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:37:07,945 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:37:07,945 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:37:07,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:37:07,950 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:37:07,950 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 21:37:07,967 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:37:07,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:37:07,968 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:37:07,969 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:37:07,969 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:37:07,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:37:07,969 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:37:07,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:37:07,970 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:37:07,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:37:07,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:37:07,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:37:07,971 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:37:07,971 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:37:07,971 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:37:07,971 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:37:07,971 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:37:07,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:37:07,972 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:37:07,972 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:37:07,972 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:37:07,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:37:07,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:37:07,973 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:37:07,973 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:37:07,974 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:37:07,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:37:07,974 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:37:07,974 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:37:07,974 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:37:08,278 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:37:08,301 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:37:08,305 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:37:08,306 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:37:08,307 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:37:08,307 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015_rmo.oepc.i [2019-12-26 21:37:08,371 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a620d68ff/7b89a6cf288a44b6bb4e519bc69adf50/FLAGde200fe42 [2019-12-26 21:37:08,886 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:37:08,887 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015_rmo.oepc.i [2019-12-26 21:37:08,908 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a620d68ff/7b89a6cf288a44b6bb4e519bc69adf50/FLAGde200fe42 [2019-12-26 21:37:09,175 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a620d68ff/7b89a6cf288a44b6bb4e519bc69adf50 [2019-12-26 21:37:09,186 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:37:09,188 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:37:09,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:37:09,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:37:09,193 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:37:09,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:37:09" (1/1) ... [2019-12-26 21:37:09,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f989e0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:37:09, skipping insertion in model container [2019-12-26 21:37:09,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:37:09" (1/1) ... [2019-12-26 21:37:09,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:37:09,259 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:37:09,983 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:37:10,004 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:37:10,078 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:37:10,159 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:37:10,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:37:10 WrapperNode [2019-12-26 21:37:10,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:37:10,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:37:10,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:37:10,161 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:37:10,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:37:10" (1/1) ... [2019-12-26 21:37:10,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:37:10" (1/1) ... [2019-12-26 21:37:10,226 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:37:10,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:37:10,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:37:10,227 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:37:10,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:37:10" (1/1) ... [2019-12-26 21:37:10,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:37:10" (1/1) ... [2019-12-26 21:37:10,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:37:10" (1/1) ... [2019-12-26 21:37:10,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:37:10" (1/1) ... [2019-12-26 21:37:10,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:37:10" (1/1) ... [2019-12-26 21:37:10,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:37:10" (1/1) ... [2019-12-26 21:37:10,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:37:10" (1/1) ... [2019-12-26 21:37:10,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:37:10,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:37:10,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:37:10,270 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:37:10,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:37:10" (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-26 21:37:10,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:37:10,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:37:10,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:37:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:37:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:37:10,352 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:37:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:37:10,353 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:37:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:37:10,354 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:37:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:37:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:37:10,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:37:10,357 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 21:37:11,112 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:37:11,113 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:37:11,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:37:11 BoogieIcfgContainer [2019-12-26 21:37:11,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:37:11,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:37:11,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:37:11,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:37:11,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:37:09" (1/3) ... [2019-12-26 21:37:11,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@686d884c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:37:11, skipping insertion in model container [2019-12-26 21:37:11,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:37:10" (2/3) ... [2019-12-26 21:37:11,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@686d884c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:37:11, skipping insertion in model container [2019-12-26 21:37:11,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:37:11" (3/3) ... [2019-12-26 21:37:11,127 INFO L109 eAbstractionObserver]: Analyzing ICFG mix015_rmo.oepc.i [2019-12-26 21:37:11,139 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:37:11,140 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:37:11,152 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:37:11,153 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:37:11,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,230 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,231 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,231 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,231 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,231 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,242 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,242 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,256 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,256 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,292 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,294 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,302 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,302 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,303 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,304 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,305 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:37:11,320 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 21:37:11,341 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:37:11,341 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:37:11,341 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:37:11,341 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:37:11,341 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:37:11,342 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:37:11,342 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:37:11,342 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:37:11,358 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-26 21:37:11,360 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-26 21:37:11,471 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-26 21:37:11,471 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:37:11,489 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:37:11,515 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-26 21:37:11,571 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-26 21:37:11,572 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:37:11,580 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 21:37:11,602 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 21:37:11,604 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:37:15,873 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-12-26 21:37:16,586 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-26 21:37:16,722 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-26 21:37:16,881 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80759 [2019-12-26 21:37:16,882 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-26 21:37:16,885 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 102 transitions [2019-12-26 21:37:34,848 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 118022 states. [2019-12-26 21:37:34,850 INFO L276 IsEmpty]: Start isEmpty. Operand 118022 states. [2019-12-26 21:37:34,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 21:37:34,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:37:34,855 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 21:37:34,856 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:37:34,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:37:34,860 INFO L82 PathProgramCache]: Analyzing trace with hash 922782, now seen corresponding path program 1 times [2019-12-26 21:37:34,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:37:34,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709189828] [2019-12-26 21:37:34,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:37:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:37:35,062 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-26 21:37:35,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709189828] [2019-12-26 21:37:35,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:37:35,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:37:35,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654563701] [2019-12-26 21:37:35,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:37:35,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:37:35,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:37:35,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:37:35,088 INFO L87 Difference]: Start difference. First operand 118022 states. Second operand 3 states. [2019-12-26 21:37:38,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:37:38,560 INFO L93 Difference]: Finished difference Result 116858 states and 495582 transitions. [2019-12-26 21:37:38,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:37:38,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 21:37:38,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:37:39,183 INFO L225 Difference]: With dead ends: 116858 [2019-12-26 21:37:39,183 INFO L226 Difference]: Without dead ends: 110138 [2019-12-26 21:37:39,185 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-26 21:37:44,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110138 states. [2019-12-26 21:37:46,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110138 to 110138. [2019-12-26 21:37:46,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110138 states. [2019-12-26 21:37:47,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110138 states to 110138 states and 466462 transitions. [2019-12-26 21:37:47,543 INFO L78 Accepts]: Start accepts. Automaton has 110138 states and 466462 transitions. Word has length 3 [2019-12-26 21:37:47,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:37:47,543 INFO L462 AbstractCegarLoop]: Abstraction has 110138 states and 466462 transitions. [2019-12-26 21:37:47,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:37:47,543 INFO L276 IsEmpty]: Start isEmpty. Operand 110138 states and 466462 transitions. [2019-12-26 21:37:47,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 21:37:47,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:37:47,547 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:37:47,547 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:37:47,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:37:47,548 INFO L82 PathProgramCache]: Analyzing trace with hash 228105342, now seen corresponding path program 1 times [2019-12-26 21:37:47,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:37:47,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324459151] [2019-12-26 21:37:47,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:37:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:37:51,118 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-26 21:37:51,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324459151] [2019-12-26 21:37:51,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:37:51,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:37:51,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127509881] [2019-12-26 21:37:51,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:37:51,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:37:51,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:37:51,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:37:51,122 INFO L87 Difference]: Start difference. First operand 110138 states and 466462 transitions. Second operand 4 states. [2019-12-26 21:37:52,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:37:52,686 INFO L93 Difference]: Finished difference Result 170904 states and 695583 transitions. [2019-12-26 21:37:52,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:37:52,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 21:37:52,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:37:54,023 INFO L225 Difference]: With dead ends: 170904 [2019-12-26 21:37:54,023 INFO L226 Difference]: Without dead ends: 170855 [2019-12-26 21:37:54,024 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-26 21:38:03,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170855 states. [2019-12-26 21:38:07,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170855 to 156295. [2019-12-26 21:38:07,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156295 states. [2019-12-26 21:38:08,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156295 states to 156295 states and 644009 transitions. [2019-12-26 21:38:08,765 INFO L78 Accepts]: Start accepts. Automaton has 156295 states and 644009 transitions. Word has length 11 [2019-12-26 21:38:08,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:08,765 INFO L462 AbstractCegarLoop]: Abstraction has 156295 states and 644009 transitions. [2019-12-26 21:38:08,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:38:08,765 INFO L276 IsEmpty]: Start isEmpty. Operand 156295 states and 644009 transitions. [2019-12-26 21:38:08,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 21:38:08,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:08,774 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:38:08,774 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:08,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:08,774 INFO L82 PathProgramCache]: Analyzing trace with hash 891607686, now seen corresponding path program 1 times [2019-12-26 21:38:08,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:08,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271579477] [2019-12-26 21:38:08,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:08,867 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-26 21:38:08,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271579477] [2019-12-26 21:38:08,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:08,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:38:08,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818580514] [2019-12-26 21:38:08,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:38:08,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:08,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:38:08,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:38:08,870 INFO L87 Difference]: Start difference. First operand 156295 states and 644009 transitions. Second operand 3 states. [2019-12-26 21:38:09,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:09,012 INFO L93 Difference]: Finished difference Result 33673 states and 108735 transitions. [2019-12-26 21:38:09,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:38:09,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 21:38:09,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:09,070 INFO L225 Difference]: With dead ends: 33673 [2019-12-26 21:38:09,070 INFO L226 Difference]: Without dead ends: 33673 [2019-12-26 21:38:09,071 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-26 21:38:09,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33673 states. [2019-12-26 21:38:09,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33673 to 33673. [2019-12-26 21:38:09,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33673 states. [2019-12-26 21:38:09,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33673 states to 33673 states and 108735 transitions. [2019-12-26 21:38:09,673 INFO L78 Accepts]: Start accepts. Automaton has 33673 states and 108735 transitions. Word has length 13 [2019-12-26 21:38:09,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:09,674 INFO L462 AbstractCegarLoop]: Abstraction has 33673 states and 108735 transitions. [2019-12-26 21:38:09,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:38:09,674 INFO L276 IsEmpty]: Start isEmpty. Operand 33673 states and 108735 transitions. [2019-12-26 21:38:09,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:38:09,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:09,677 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:38:09,677 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:09,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:09,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1993825600, now seen corresponding path program 1 times [2019-12-26 21:38:09,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:09,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259770677] [2019-12-26 21:38:09,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:09,798 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-26 21:38:09,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259770677] [2019-12-26 21:38:09,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:09,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:38:09,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328188748] [2019-12-26 21:38:09,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:38:09,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:09,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:38:09,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:38:09,803 INFO L87 Difference]: Start difference. First operand 33673 states and 108735 transitions. Second operand 4 states. [2019-12-26 21:38:10,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:10,160 INFO L93 Difference]: Finished difference Result 42056 states and 135369 transitions. [2019-12-26 21:38:10,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:38:10,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 21:38:10,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:10,230 INFO L225 Difference]: With dead ends: 42056 [2019-12-26 21:38:10,230 INFO L226 Difference]: Without dead ends: 42056 [2019-12-26 21:38:10,230 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-26 21:38:10,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42056 states. [2019-12-26 21:38:13,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42056 to 37770. [2019-12-26 21:38:13,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37770 states. [2019-12-26 21:38:13,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37770 states to 37770 states and 121950 transitions. [2019-12-26 21:38:13,396 INFO L78 Accepts]: Start accepts. Automaton has 37770 states and 121950 transitions. Word has length 16 [2019-12-26 21:38:13,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:13,397 INFO L462 AbstractCegarLoop]: Abstraction has 37770 states and 121950 transitions. [2019-12-26 21:38:13,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:38:13,397 INFO L276 IsEmpty]: Start isEmpty. Operand 37770 states and 121950 transitions. [2019-12-26 21:38:13,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 21:38:13,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:13,406 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-26 21:38:13,406 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:13,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:13,406 INFO L82 PathProgramCache]: Analyzing trace with hash 674854723, now seen corresponding path program 1 times [2019-12-26 21:38:13,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:13,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683016308] [2019-12-26 21:38:13,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:13,495 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-26 21:38:13,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683016308] [2019-12-26 21:38:13,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:13,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:38:13,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481438790] [2019-12-26 21:38:13,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:38:13,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:13,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:38:13,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:38:13,497 INFO L87 Difference]: Start difference. First operand 37770 states and 121950 transitions. Second operand 5 states. [2019-12-26 21:38:14,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:14,119 INFO L93 Difference]: Finished difference Result 48537 states and 154193 transitions. [2019-12-26 21:38:14,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:38:14,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 21:38:14,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:14,202 INFO L225 Difference]: With dead ends: 48537 [2019-12-26 21:38:14,202 INFO L226 Difference]: Without dead ends: 48530 [2019-12-26 21:38:14,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:38:14,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48530 states. [2019-12-26 21:38:14,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48530 to 37459. [2019-12-26 21:38:14,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37459 states. [2019-12-26 21:38:14,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37459 states to 37459 states and 120776 transitions. [2019-12-26 21:38:14,943 INFO L78 Accepts]: Start accepts. Automaton has 37459 states and 120776 transitions. Word has length 22 [2019-12-26 21:38:14,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:14,943 INFO L462 AbstractCegarLoop]: Abstraction has 37459 states and 120776 transitions. [2019-12-26 21:38:14,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:38:14,944 INFO L276 IsEmpty]: Start isEmpty. Operand 37459 states and 120776 transitions. [2019-12-26 21:38:14,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 21:38:14,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:14,956 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-26 21:38:14,956 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:14,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:14,957 INFO L82 PathProgramCache]: Analyzing trace with hash 332765886, now seen corresponding path program 1 times [2019-12-26 21:38:14,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:14,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320321238] [2019-12-26 21:38:14,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:15,030 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-26 21:38:15,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320321238] [2019-12-26 21:38:15,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:15,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:38:15,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119440026] [2019-12-26 21:38:15,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:38:15,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:15,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:38:15,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:38:15,034 INFO L87 Difference]: Start difference. First operand 37459 states and 120776 transitions. Second operand 4 states. [2019-12-26 21:38:15,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:15,105 INFO L93 Difference]: Finished difference Result 14576 states and 44297 transitions. [2019-12-26 21:38:15,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:38:15,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 21:38:15,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:15,130 INFO L225 Difference]: With dead ends: 14576 [2019-12-26 21:38:15,131 INFO L226 Difference]: Without dead ends: 14576 [2019-12-26 21:38:15,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:38:15,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14576 states. [2019-12-26 21:38:15,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14576 to 14332. [2019-12-26 21:38:15,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14332 states. [2019-12-26 21:38:15,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14332 states to 14332 states and 43601 transitions. [2019-12-26 21:38:15,743 INFO L78 Accepts]: Start accepts. Automaton has 14332 states and 43601 transitions. Word has length 25 [2019-12-26 21:38:15,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:15,743 INFO L462 AbstractCegarLoop]: Abstraction has 14332 states and 43601 transitions. [2019-12-26 21:38:15,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:38:15,743 INFO L276 IsEmpty]: Start isEmpty. Operand 14332 states and 43601 transitions. [2019-12-26 21:38:15,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:38:15,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:15,754 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:38:15,754 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:15,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:15,755 INFO L82 PathProgramCache]: Analyzing trace with hash 445555351, now seen corresponding path program 1 times [2019-12-26 21:38:15,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:15,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145688633] [2019-12-26 21:38:15,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:15,802 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-26 21:38:15,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145688633] [2019-12-26 21:38:15,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:15,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:38:15,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048604910] [2019-12-26 21:38:15,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:38:15,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:15,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:38:15,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:38:15,805 INFO L87 Difference]: Start difference. First operand 14332 states and 43601 transitions. Second operand 3 states. [2019-12-26 21:38:15,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:15,905 INFO L93 Difference]: Finished difference Result 22367 states and 67484 transitions. [2019-12-26 21:38:15,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:38:15,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-26 21:38:15,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:15,936 INFO L225 Difference]: With dead ends: 22367 [2019-12-26 21:38:15,936 INFO L226 Difference]: Without dead ends: 22367 [2019-12-26 21:38:15,936 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-26 21:38:16,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22367 states. [2019-12-26 21:38:16,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22367 to 16938. [2019-12-26 21:38:16,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-26 21:38:16,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 51830 transitions. [2019-12-26 21:38:16,230 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 51830 transitions. Word has length 27 [2019-12-26 21:38:16,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:16,231 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 51830 transitions. [2019-12-26 21:38:16,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:38:16,231 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 51830 transitions. [2019-12-26 21:38:16,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:38:16,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:16,244 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:38:16,244 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:16,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:16,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1217095067, now seen corresponding path program 1 times [2019-12-26 21:38:16,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:16,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867701237] [2019-12-26 21:38:16,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:16,294 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-26 21:38:16,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867701237] [2019-12-26 21:38:16,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:16,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:38:16,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970370944] [2019-12-26 21:38:16,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:38:16,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:16,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:38:16,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:38:16,299 INFO L87 Difference]: Start difference. First operand 16938 states and 51830 transitions. Second operand 3 states. [2019-12-26 21:38:16,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:16,388 INFO L93 Difference]: Finished difference Result 22367 states and 66493 transitions. [2019-12-26 21:38:16,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:38:16,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-26 21:38:16,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:16,419 INFO L225 Difference]: With dead ends: 22367 [2019-12-26 21:38:16,419 INFO L226 Difference]: Without dead ends: 22367 [2019-12-26 21:38:16,420 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-26 21:38:16,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22367 states. [2019-12-26 21:38:16,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22367 to 16938. [2019-12-26 21:38:16,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-26 21:38:16,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 50839 transitions. [2019-12-26 21:38:16,719 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 50839 transitions. Word has length 27 [2019-12-26 21:38:16,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:16,719 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 50839 transitions. [2019-12-26 21:38:16,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:38:16,719 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 50839 transitions. [2019-12-26 21:38:16,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 21:38:16,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:16,732 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:38:16,733 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:16,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:16,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1361870049, now seen corresponding path program 1 times [2019-12-26 21:38:16,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:16,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374587037] [2019-12-26 21:38:16,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:16,821 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-26 21:38:16,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374587037] [2019-12-26 21:38:16,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:16,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:38:16,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391645666] [2019-12-26 21:38:16,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:38:16,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:16,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:38:16,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:38:16,824 INFO L87 Difference]: Start difference. First operand 16938 states and 50839 transitions. Second operand 6 states. [2019-12-26 21:38:17,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:17,432 INFO L93 Difference]: Finished difference Result 31275 states and 92943 transitions. [2019-12-26 21:38:17,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:38:17,433 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-26 21:38:17,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:17,482 INFO L225 Difference]: With dead ends: 31275 [2019-12-26 21:38:17,482 INFO L226 Difference]: Without dead ends: 31275 [2019-12-26 21:38:17,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:38:17,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31275 states. [2019-12-26 21:38:17,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31275 to 19607. [2019-12-26 21:38:17,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19607 states. [2019-12-26 21:38:17,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19607 states to 19607 states and 58673 transitions. [2019-12-26 21:38:17,858 INFO L78 Accepts]: Start accepts. Automaton has 19607 states and 58673 transitions. Word has length 27 [2019-12-26 21:38:17,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:17,858 INFO L462 AbstractCegarLoop]: Abstraction has 19607 states and 58673 transitions. [2019-12-26 21:38:17,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:38:17,858 INFO L276 IsEmpty]: Start isEmpty. Operand 19607 states and 58673 transitions. [2019-12-26 21:38:17,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 21:38:17,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:17,874 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-26 21:38:17,874 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:17,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:17,874 INFO L82 PathProgramCache]: Analyzing trace with hash -2015671980, now seen corresponding path program 1 times [2019-12-26 21:38:17,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:17,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554360653] [2019-12-26 21:38:17,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:17,959 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-26 21:38:17,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554360653] [2019-12-26 21:38:17,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:17,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:38:17,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464754685] [2019-12-26 21:38:17,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:38:17,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:17,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:38:17,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:38:17,961 INFO L87 Difference]: Start difference. First operand 19607 states and 58673 transitions. Second operand 6 states. [2019-12-26 21:38:18,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:18,866 INFO L93 Difference]: Finished difference Result 30618 states and 90299 transitions. [2019-12-26 21:38:18,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:38:18,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-26 21:38:18,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:18,910 INFO L225 Difference]: With dead ends: 30618 [2019-12-26 21:38:18,910 INFO L226 Difference]: Without dead ends: 30618 [2019-12-26 21:38:18,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:38:19,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30618 states. [2019-12-26 21:38:19,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30618 to 19271. [2019-12-26 21:38:19,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19271 states. [2019-12-26 21:38:19,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19271 states to 19271 states and 57577 transitions. [2019-12-26 21:38:19,277 INFO L78 Accepts]: Start accepts. Automaton has 19271 states and 57577 transitions. Word has length 28 [2019-12-26 21:38:19,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:19,277 INFO L462 AbstractCegarLoop]: Abstraction has 19271 states and 57577 transitions. [2019-12-26 21:38:19,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:38:19,278 INFO L276 IsEmpty]: Start isEmpty. Operand 19271 states and 57577 transitions. [2019-12-26 21:38:19,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 21:38:19,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:19,299 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] [2019-12-26 21:38:19,299 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:19,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:19,299 INFO L82 PathProgramCache]: Analyzing trace with hash 405285854, now seen corresponding path program 1 times [2019-12-26 21:38:19,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:19,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108796527] [2019-12-26 21:38:19,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:19,408 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-26 21:38:19,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108796527] [2019-12-26 21:38:19,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:19,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:38:19,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787806184] [2019-12-26 21:38:19,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:38:19,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:19,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:38:19,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:38:19,410 INFO L87 Difference]: Start difference. First operand 19271 states and 57577 transitions. Second operand 6 states. [2019-12-26 21:38:19,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:19,988 INFO L93 Difference]: Finished difference Result 24609 states and 72444 transitions. [2019-12-26 21:38:19,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:38:19,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-26 21:38:19,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:20,022 INFO L225 Difference]: With dead ends: 24609 [2019-12-26 21:38:20,022 INFO L226 Difference]: Without dead ends: 24609 [2019-12-26 21:38:20,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:38:20,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24609 states. [2019-12-26 21:38:20,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24609 to 19900. [2019-12-26 21:38:20,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19900 states. [2019-12-26 21:38:20,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19900 states to 19900 states and 59467 transitions. [2019-12-26 21:38:20,337 INFO L78 Accepts]: Start accepts. Automaton has 19900 states and 59467 transitions. Word has length 33 [2019-12-26 21:38:20,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:20,338 INFO L462 AbstractCegarLoop]: Abstraction has 19900 states and 59467 transitions. [2019-12-26 21:38:20,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:38:20,338 INFO L276 IsEmpty]: Start isEmpty. Operand 19900 states and 59467 transitions. [2019-12-26 21:38:20,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 21:38:20,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:20,359 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] [2019-12-26 21:38:20,359 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:20,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:20,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1258895234, now seen corresponding path program 2 times [2019-12-26 21:38:20,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:20,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808146244] [2019-12-26 21:38:20,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:20,460 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-26 21:38:20,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808146244] [2019-12-26 21:38:20,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:20,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:38:20,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923696239] [2019-12-26 21:38:20,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:38:20,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:20,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:38:20,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:38:20,462 INFO L87 Difference]: Start difference. First operand 19900 states and 59467 transitions. Second operand 7 states. [2019-12-26 21:38:21,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:21,766 INFO L93 Difference]: Finished difference Result 41205 states and 121054 transitions. [2019-12-26 21:38:21,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 21:38:21,767 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-26 21:38:21,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:21,824 INFO L225 Difference]: With dead ends: 41205 [2019-12-26 21:38:21,824 INFO L226 Difference]: Without dead ends: 41205 [2019-12-26 21:38:21,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-26 21:38:21,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41205 states. [2019-12-26 21:38:22,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41205 to 21428. [2019-12-26 21:38:22,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21428 states. [2019-12-26 21:38:22,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21428 states to 21428 states and 64061 transitions. [2019-12-26 21:38:22,413 INFO L78 Accepts]: Start accepts. Automaton has 21428 states and 64061 transitions. Word has length 33 [2019-12-26 21:38:22,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:22,413 INFO L462 AbstractCegarLoop]: Abstraction has 21428 states and 64061 transitions. [2019-12-26 21:38:22,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:38:22,413 INFO L276 IsEmpty]: Start isEmpty. Operand 21428 states and 64061 transitions. [2019-12-26 21:38:22,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 21:38:22,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:22,431 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] [2019-12-26 21:38:22,431 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:22,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:22,431 INFO L82 PathProgramCache]: Analyzing trace with hash -454706214, now seen corresponding path program 3 times [2019-12-26 21:38:22,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:22,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205518129] [2019-12-26 21:38:22,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:22,599 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-26 21:38:22,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205518129] [2019-12-26 21:38:22,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:22,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:38:22,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575767891] [2019-12-26 21:38:22,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:38:22,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:22,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:38:22,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:38:22,603 INFO L87 Difference]: Start difference. First operand 21428 states and 64061 transitions. Second operand 9 states. [2019-12-26 21:38:25,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:25,648 INFO L93 Difference]: Finished difference Result 60444 states and 174804 transitions. [2019-12-26 21:38:25,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-26 21:38:25,649 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-26 21:38:25,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:25,735 INFO L225 Difference]: With dead ends: 60444 [2019-12-26 21:38:25,735 INFO L226 Difference]: Without dead ends: 60444 [2019-12-26 21:38:25,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=333, Invalid=1149, Unknown=0, NotChecked=0, Total=1482 [2019-12-26 21:38:25,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60444 states. [2019-12-26 21:38:26,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60444 to 21456. [2019-12-26 21:38:26,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21456 states. [2019-12-26 21:38:26,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21456 states to 21456 states and 64310 transitions. [2019-12-26 21:38:26,309 INFO L78 Accepts]: Start accepts. Automaton has 21456 states and 64310 transitions. Word has length 33 [2019-12-26 21:38:26,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:26,310 INFO L462 AbstractCegarLoop]: Abstraction has 21456 states and 64310 transitions. [2019-12-26 21:38:26,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:38:26,310 INFO L276 IsEmpty]: Start isEmpty. Operand 21456 states and 64310 transitions. [2019-12-26 21:38:26,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 21:38:26,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:26,331 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:38:26,331 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:26,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:26,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1655017129, now seen corresponding path program 1 times [2019-12-26 21:38:26,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:26,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766290572] [2019-12-26 21:38:26,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:26,440 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-26 21:38:26,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766290572] [2019-12-26 21:38:26,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:26,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:38:26,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145862307] [2019-12-26 21:38:26,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:38:26,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:26,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:38:26,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:38:26,442 INFO L87 Difference]: Start difference. First operand 21456 states and 64310 transitions. Second operand 7 states. [2019-12-26 21:38:27,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:27,876 INFO L93 Difference]: Finished difference Result 37445 states and 109818 transitions. [2019-12-26 21:38:27,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 21:38:27,877 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-26 21:38:27,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:27,932 INFO L225 Difference]: With dead ends: 37445 [2019-12-26 21:38:27,932 INFO L226 Difference]: Without dead ends: 37445 [2019-12-26 21:38:27,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-26 21:38:28,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37445 states. [2019-12-26 21:38:28,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37445 to 20079. [2019-12-26 21:38:28,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20079 states. [2019-12-26 21:38:28,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20079 states to 20079 states and 60210 transitions. [2019-12-26 21:38:28,501 INFO L78 Accepts]: Start accepts. Automaton has 20079 states and 60210 transitions. Word has length 34 [2019-12-26 21:38:28,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:28,501 INFO L462 AbstractCegarLoop]: Abstraction has 20079 states and 60210 transitions. [2019-12-26 21:38:28,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:38:28,501 INFO L276 IsEmpty]: Start isEmpty. Operand 20079 states and 60210 transitions. [2019-12-26 21:38:28,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 21:38:28,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:28,522 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] [2019-12-26 21:38:28,522 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:28,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:28,523 INFO L82 PathProgramCache]: Analyzing trace with hash 2107636055, now seen corresponding path program 2 times [2019-12-26 21:38:28,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:28,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591319133] [2019-12-26 21:38:28,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:28,659 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-26 21:38:28,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591319133] [2019-12-26 21:38:28,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:28,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:38:28,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769736091] [2019-12-26 21:38:28,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:38:28,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:28,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:38:28,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:38:28,662 INFO L87 Difference]: Start difference. First operand 20079 states and 60210 transitions. Second operand 9 states. [2019-12-26 21:38:30,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:30,457 INFO L93 Difference]: Finished difference Result 40512 states and 118430 transitions. [2019-12-26 21:38:30,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 21:38:30,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-26 21:38:30,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:30,535 INFO L225 Difference]: With dead ends: 40512 [2019-12-26 21:38:30,535 INFO L226 Difference]: Without dead ends: 40512 [2019-12-26 21:38:30,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-12-26 21:38:30,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40512 states. [2019-12-26 21:38:30,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40512 to 19854. [2019-12-26 21:38:30,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19854 states. [2019-12-26 21:38:31,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19854 states to 19854 states and 59564 transitions. [2019-12-26 21:38:31,007 INFO L78 Accepts]: Start accepts. Automaton has 19854 states and 59564 transitions. Word has length 34 [2019-12-26 21:38:31,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:31,007 INFO L462 AbstractCegarLoop]: Abstraction has 19854 states and 59564 transitions. [2019-12-26 21:38:31,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:38:31,007 INFO L276 IsEmpty]: Start isEmpty. Operand 19854 states and 59564 transitions. [2019-12-26 21:38:31,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-26 21:38:31,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:31,031 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:38:31,031 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:31,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:31,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1254078343, now seen corresponding path program 1 times [2019-12-26 21:38:31,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:31,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277757833] [2019-12-26 21:38:31,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:31,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:38:31,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277757833] [2019-12-26 21:38:31,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:31,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:38:31,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465681512] [2019-12-26 21:38:31,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:38:31,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:31,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:38:31,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:38:31,121 INFO L87 Difference]: Start difference. First operand 19854 states and 59564 transitions. Second operand 7 states. [2019-12-26 21:38:32,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:32,357 INFO L93 Difference]: Finished difference Result 48291 states and 141130 transitions. [2019-12-26 21:38:32,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 21:38:32,358 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-12-26 21:38:32,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:32,426 INFO L225 Difference]: With dead ends: 48291 [2019-12-26 21:38:32,426 INFO L226 Difference]: Without dead ends: 48291 [2019-12-26 21:38:32,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-26 21:38:32,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48291 states. [2019-12-26 21:38:33,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48291 to 19329. [2019-12-26 21:38:33,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19329 states. [2019-12-26 21:38:33,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19329 states to 19329 states and 58024 transitions. [2019-12-26 21:38:33,045 INFO L78 Accepts]: Start accepts. Automaton has 19329 states and 58024 transitions. Word has length 37 [2019-12-26 21:38:33,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:33,045 INFO L462 AbstractCegarLoop]: Abstraction has 19329 states and 58024 transitions. [2019-12-26 21:38:33,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:38:33,045 INFO L276 IsEmpty]: Start isEmpty. Operand 19329 states and 58024 transitions. [2019-12-26 21:38:33,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 21:38:33,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:33,062 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-26 21:38:33,063 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:33,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:33,063 INFO L82 PathProgramCache]: Analyzing trace with hash -887512480, now seen corresponding path program 1 times [2019-12-26 21:38:33,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:33,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312587803] [2019-12-26 21:38:33,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:33,121 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-26 21:38:33,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312587803] [2019-12-26 21:38:33,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:33,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:38:33,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929402015] [2019-12-26 21:38:33,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:38:33,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:33,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:38:33,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:38:33,123 INFO L87 Difference]: Start difference. First operand 19329 states and 58024 transitions. Second operand 4 states. [2019-12-26 21:38:33,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:33,232 INFO L93 Difference]: Finished difference Result 32567 states and 98044 transitions. [2019-12-26 21:38:33,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:38:33,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-26 21:38:33,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:33,255 INFO L225 Difference]: With dead ends: 32567 [2019-12-26 21:38:33,255 INFO L226 Difference]: Without dead ends: 16193 [2019-12-26 21:38:33,256 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-26 21:38:33,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16193 states. [2019-12-26 21:38:33,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16193 to 16091. [2019-12-26 21:38:33,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16091 states. [2019-12-26 21:38:33,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16091 states to 16091 states and 47354 transitions. [2019-12-26 21:38:33,486 INFO L78 Accepts]: Start accepts. Automaton has 16091 states and 47354 transitions. Word has length 39 [2019-12-26 21:38:33,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:33,486 INFO L462 AbstractCegarLoop]: Abstraction has 16091 states and 47354 transitions. [2019-12-26 21:38:33,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:38:33,486 INFO L276 IsEmpty]: Start isEmpty. Operand 16091 states and 47354 transitions. [2019-12-26 21:38:33,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 21:38:33,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:33,501 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-26 21:38:33,501 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:33,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:33,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1585510358, now seen corresponding path program 2 times [2019-12-26 21:38:33,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:33,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4872322] [2019-12-26 21:38:33,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:33,551 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-26 21:38:33,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4872322] [2019-12-26 21:38:33,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:33,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:38:33,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725349020] [2019-12-26 21:38:33,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:38:33,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:33,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:38:33,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:38:33,553 INFO L87 Difference]: Start difference. First operand 16091 states and 47354 transitions. Second operand 3 states. [2019-12-26 21:38:33,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:33,617 INFO L93 Difference]: Finished difference Result 16090 states and 47352 transitions. [2019-12-26 21:38:33,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:38:33,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 21:38:33,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:33,646 INFO L225 Difference]: With dead ends: 16090 [2019-12-26 21:38:33,647 INFO L226 Difference]: Without dead ends: 16090 [2019-12-26 21:38:33,647 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-26 21:38:33,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16090 states. [2019-12-26 21:38:33,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16090 to 16090. [2019-12-26 21:38:33,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16090 states. [2019-12-26 21:38:33,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16090 states to 16090 states and 47352 transitions. [2019-12-26 21:38:33,985 INFO L78 Accepts]: Start accepts. Automaton has 16090 states and 47352 transitions. Word has length 39 [2019-12-26 21:38:33,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:33,986 INFO L462 AbstractCegarLoop]: Abstraction has 16090 states and 47352 transitions. [2019-12-26 21:38:33,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:38:33,986 INFO L276 IsEmpty]: Start isEmpty. Operand 16090 states and 47352 transitions. [2019-12-26 21:38:34,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:38:34,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:34,007 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-26 21:38:34,007 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:34,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:34,007 INFO L82 PathProgramCache]: Analyzing trace with hash -408863373, now seen corresponding path program 1 times [2019-12-26 21:38:34,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:34,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233429246] [2019-12-26 21:38:34,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:34,049 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-26 21:38:34,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233429246] [2019-12-26 21:38:34,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:34,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:38:34,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356992825] [2019-12-26 21:38:34,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:38:34,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:34,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:38:34,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:38:34,051 INFO L87 Difference]: Start difference. First operand 16090 states and 47352 transitions. Second operand 4 states. [2019-12-26 21:38:34,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:34,164 INFO L93 Difference]: Finished difference Result 25321 states and 74822 transitions. [2019-12-26 21:38:34,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:38:34,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-26 21:38:34,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:34,184 INFO L225 Difference]: With dead ends: 25321 [2019-12-26 21:38:34,184 INFO L226 Difference]: Without dead ends: 11261 [2019-12-26 21:38:34,185 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-26 21:38:34,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11261 states. [2019-12-26 21:38:34,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11261 to 11196. [2019-12-26 21:38:34,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11196 states. [2019-12-26 21:38:34,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11196 states to 11196 states and 32042 transitions. [2019-12-26 21:38:34,369 INFO L78 Accepts]: Start accepts. Automaton has 11196 states and 32042 transitions. Word has length 40 [2019-12-26 21:38:34,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:34,369 INFO L462 AbstractCegarLoop]: Abstraction has 11196 states and 32042 transitions. [2019-12-26 21:38:34,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:38:34,369 INFO L276 IsEmpty]: Start isEmpty. Operand 11196 states and 32042 transitions. [2019-12-26 21:38:34,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 21:38:34,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:34,381 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-26 21:38:34,381 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:34,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:34,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1542545665, now seen corresponding path program 2 times [2019-12-26 21:38:34,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:34,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412228866] [2019-12-26 21:38:34,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:34,431 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-26 21:38:34,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412228866] [2019-12-26 21:38:34,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:34,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:38:34,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413421794] [2019-12-26 21:38:34,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:38:34,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:34,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:38:34,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:38:34,434 INFO L87 Difference]: Start difference. First operand 11196 states and 32042 transitions. Second operand 5 states. [2019-12-26 21:38:34,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:34,489 INFO L93 Difference]: Finished difference Result 10234 states and 29901 transitions. [2019-12-26 21:38:34,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:38:34,490 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 21:38:34,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:34,501 INFO L225 Difference]: With dead ends: 10234 [2019-12-26 21:38:34,502 INFO L226 Difference]: Without dead ends: 7230 [2019-12-26 21:38:34,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:38:34,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7230 states. [2019-12-26 21:38:34,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7230 to 7230. [2019-12-26 21:38:34,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7230 states. [2019-12-26 21:38:34,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7230 states to 7230 states and 23189 transitions. [2019-12-26 21:38:34,621 INFO L78 Accepts]: Start accepts. Automaton has 7230 states and 23189 transitions. Word has length 40 [2019-12-26 21:38:34,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:34,622 INFO L462 AbstractCegarLoop]: Abstraction has 7230 states and 23189 transitions. [2019-12-26 21:38:34,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:38:34,622 INFO L276 IsEmpty]: Start isEmpty. Operand 7230 states and 23189 transitions. [2019-12-26 21:38:34,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:38:34,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:34,631 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:38:34,631 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:34,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:34,631 INFO L82 PathProgramCache]: Analyzing trace with hash -101932291, now seen corresponding path program 1 times [2019-12-26 21:38:34,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:34,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926369312] [2019-12-26 21:38:34,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:34,709 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-26 21:38:34,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926369312] [2019-12-26 21:38:34,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:34,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:38:34,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270243266] [2019-12-26 21:38:34,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:38:34,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:34,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:38:34,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:38:34,712 INFO L87 Difference]: Start difference. First operand 7230 states and 23189 transitions. Second operand 7 states. [2019-12-26 21:38:34,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:34,968 INFO L93 Difference]: Finished difference Result 14425 states and 45327 transitions. [2019-12-26 21:38:34,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:38:34,968 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 21:38:34,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:34,985 INFO L225 Difference]: With dead ends: 14425 [2019-12-26 21:38:34,985 INFO L226 Difference]: Without dead ends: 10624 [2019-12-26 21:38:34,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 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-26 21:38:35,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10624 states. [2019-12-26 21:38:35,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10624 to 8673. [2019-12-26 21:38:35,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8673 states. [2019-12-26 21:38:35,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8673 states to 8673 states and 27719 transitions. [2019-12-26 21:38:35,147 INFO L78 Accepts]: Start accepts. Automaton has 8673 states and 27719 transitions. Word has length 64 [2019-12-26 21:38:35,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:35,147 INFO L462 AbstractCegarLoop]: Abstraction has 8673 states and 27719 transitions. [2019-12-26 21:38:35,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:38:35,147 INFO L276 IsEmpty]: Start isEmpty. Operand 8673 states and 27719 transitions. [2019-12-26 21:38:35,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:38:35,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:35,158 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:38:35,158 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:35,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:35,158 INFO L82 PathProgramCache]: Analyzing trace with hash -244237027, now seen corresponding path program 2 times [2019-12-26 21:38:35,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:35,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796696933] [2019-12-26 21:38:35,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:35,236 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-26 21:38:35,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796696933] [2019-12-26 21:38:35,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:35,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:38:35,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481714585] [2019-12-26 21:38:35,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:38:35,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:35,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:38:35,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:38:35,239 INFO L87 Difference]: Start difference. First operand 8673 states and 27719 transitions. Second operand 7 states. [2019-12-26 21:38:35,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:35,496 INFO L93 Difference]: Finished difference Result 16977 states and 52978 transitions. [2019-12-26 21:38:35,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:38:35,496 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 21:38:35,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:35,516 INFO L225 Difference]: With dead ends: 16977 [2019-12-26 21:38:35,516 INFO L226 Difference]: Without dead ends: 12608 [2019-12-26 21:38:35,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 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-26 21:38:35,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12608 states. [2019-12-26 21:38:35,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12608 to 10249. [2019-12-26 21:38:35,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10249 states. [2019-12-26 21:38:35,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10249 states to 10249 states and 32525 transitions. [2019-12-26 21:38:35,695 INFO L78 Accepts]: Start accepts. Automaton has 10249 states and 32525 transitions. Word has length 64 [2019-12-26 21:38:35,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:35,696 INFO L462 AbstractCegarLoop]: Abstraction has 10249 states and 32525 transitions. [2019-12-26 21:38:35,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:38:35,696 INFO L276 IsEmpty]: Start isEmpty. Operand 10249 states and 32525 transitions. [2019-12-26 21:38:35,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:38:35,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:35,707 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:38:35,708 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:35,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:35,708 INFO L82 PathProgramCache]: Analyzing trace with hash 407961531, now seen corresponding path program 3 times [2019-12-26 21:38:35,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:35,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101859306] [2019-12-26 21:38:35,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:35,821 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-26 21:38:35,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101859306] [2019-12-26 21:38:35,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:35,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:38:35,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618722035] [2019-12-26 21:38:35,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:38:35,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:35,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:38:35,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:38:35,824 INFO L87 Difference]: Start difference. First operand 10249 states and 32525 transitions. Second operand 9 states. [2019-12-26 21:38:36,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:36,975 INFO L93 Difference]: Finished difference Result 29742 states and 92736 transitions. [2019-12-26 21:38:36,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 21:38:36,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 21:38:36,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:37,015 INFO L225 Difference]: With dead ends: 29742 [2019-12-26 21:38:37,015 INFO L226 Difference]: Without dead ends: 27534 [2019-12-26 21:38:37,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-26 21:38:37,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27534 states. [2019-12-26 21:38:37,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27534 to 10384. [2019-12-26 21:38:37,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10384 states. [2019-12-26 21:38:37,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10384 states to 10384 states and 33017 transitions. [2019-12-26 21:38:37,292 INFO L78 Accepts]: Start accepts. Automaton has 10384 states and 33017 transitions. Word has length 64 [2019-12-26 21:38:37,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:37,292 INFO L462 AbstractCegarLoop]: Abstraction has 10384 states and 33017 transitions. [2019-12-26 21:38:37,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:38:37,292 INFO L276 IsEmpty]: Start isEmpty. Operand 10384 states and 33017 transitions. [2019-12-26 21:38:37,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:38:37,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:37,303 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:38:37,303 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:37,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:37,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1263766943, now seen corresponding path program 4 times [2019-12-26 21:38:37,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:37,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767773307] [2019-12-26 21:38:37,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:37,419 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-26 21:38:37,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767773307] [2019-12-26 21:38:37,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:37,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:38:37,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615911249] [2019-12-26 21:38:37,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:38:37,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:37,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:38:37,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:38:37,424 INFO L87 Difference]: Start difference. First operand 10384 states and 33017 transitions. Second operand 9 states. [2019-12-26 21:38:38,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:38,438 INFO L93 Difference]: Finished difference Result 23762 states and 74154 transitions. [2019-12-26 21:38:38,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-26 21:38:38,438 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 21:38:38,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:38,472 INFO L225 Difference]: With dead ends: 23762 [2019-12-26 21:38:38,473 INFO L226 Difference]: Without dead ends: 22008 [2019-12-26 21:38:38,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-26 21:38:38,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22008 states. [2019-12-26 21:38:38,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22008 to 10264. [2019-12-26 21:38:38,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10264 states. [2019-12-26 21:38:38,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10264 states to 10264 states and 32661 transitions. [2019-12-26 21:38:38,742 INFO L78 Accepts]: Start accepts. Automaton has 10264 states and 32661 transitions. Word has length 64 [2019-12-26 21:38:38,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:38,743 INFO L462 AbstractCegarLoop]: Abstraction has 10264 states and 32661 transitions. [2019-12-26 21:38:38,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:38:38,743 INFO L276 IsEmpty]: Start isEmpty. Operand 10264 states and 32661 transitions. [2019-12-26 21:38:38,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 21:38:38,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:38,756 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:38:38,756 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:38,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:38,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1739892295, now seen corresponding path program 5 times [2019-12-26 21:38:38,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:38,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724847026] [2019-12-26 21:38:38,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:38,817 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-26 21:38:38,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724847026] [2019-12-26 21:38:38,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:38,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:38:38,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522713015] [2019-12-26 21:38:38,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:38:38,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:38,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:38:38,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:38:38,818 INFO L87 Difference]: Start difference. First operand 10264 states and 32661 transitions. Second operand 3 states. [2019-12-26 21:38:38,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:38,906 INFO L93 Difference]: Finished difference Result 11837 states and 37523 transitions. [2019-12-26 21:38:38,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:38:38,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 21:38:38,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:38,923 INFO L225 Difference]: With dead ends: 11837 [2019-12-26 21:38:38,923 INFO L226 Difference]: Without dead ends: 11837 [2019-12-26 21:38:38,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-26 21:38:38,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11837 states. [2019-12-26 21:38:39,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11837 to 10693. [2019-12-26 21:38:39,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10693 states. [2019-12-26 21:38:39,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10693 states to 10693 states and 34091 transitions. [2019-12-26 21:38:39,093 INFO L78 Accepts]: Start accepts. Automaton has 10693 states and 34091 transitions. Word has length 64 [2019-12-26 21:38:39,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:39,094 INFO L462 AbstractCegarLoop]: Abstraction has 10693 states and 34091 transitions. [2019-12-26 21:38:39,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:38:39,094 INFO L276 IsEmpty]: Start isEmpty. Operand 10693 states and 34091 transitions. [2019-12-26 21:38:39,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:38:39,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:39,105 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:38:39,105 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:39,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:39,106 INFO L82 PathProgramCache]: Analyzing trace with hash -671653730, now seen corresponding path program 1 times [2019-12-26 21:38:39,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:39,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019830080] [2019-12-26 21:38:39,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:39,238 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-26 21:38:39,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019830080] [2019-12-26 21:38:39,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:39,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:38:39,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185643213] [2019-12-26 21:38:39,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:38:39,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:39,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:38:39,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:38:39,241 INFO L87 Difference]: Start difference. First operand 10693 states and 34091 transitions. Second operand 9 states. [2019-12-26 21:38:40,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:40,203 INFO L93 Difference]: Finished difference Result 25976 states and 80362 transitions. [2019-12-26 21:38:40,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 21:38:40,203 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 21:38:40,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:40,235 INFO L225 Difference]: With dead ends: 25976 [2019-12-26 21:38:40,235 INFO L226 Difference]: Without dead ends: 21905 [2019-12-26 21:38:40,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-12-26 21:38:40,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21905 states. [2019-12-26 21:38:40,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21905 to 10558. [2019-12-26 21:38:40,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10558 states. [2019-12-26 21:38:40,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10558 states to 10558 states and 33265 transitions. [2019-12-26 21:38:40,478 INFO L78 Accepts]: Start accepts. Automaton has 10558 states and 33265 transitions. Word has length 65 [2019-12-26 21:38:40,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:40,478 INFO L462 AbstractCegarLoop]: Abstraction has 10558 states and 33265 transitions. [2019-12-26 21:38:40,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:38:40,478 INFO L276 IsEmpty]: Start isEmpty. Operand 10558 states and 33265 transitions. [2019-12-26 21:38:40,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:38:40,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:40,491 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:38:40,491 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:40,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:40,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1962638562, now seen corresponding path program 2 times [2019-12-26 21:38:40,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:40,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807658671] [2019-12-26 21:38:40,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:40,620 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-26 21:38:40,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807658671] [2019-12-26 21:38:40,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:40,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:38:40,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674965572] [2019-12-26 21:38:40,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:38:40,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:40,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:38:40,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:38:40,622 INFO L87 Difference]: Start difference. First operand 10558 states and 33265 transitions. Second operand 9 states. [2019-12-26 21:38:41,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:41,514 INFO L93 Difference]: Finished difference Result 21151 states and 64928 transitions. [2019-12-26 21:38:41,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 21:38:41,515 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 21:38:41,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:41,542 INFO L225 Difference]: With dead ends: 21151 [2019-12-26 21:38:41,542 INFO L226 Difference]: Without dead ends: 19285 [2019-12-26 21:38:41,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-26 21:38:41,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19285 states. [2019-12-26 21:38:41,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19285 to 10198. [2019-12-26 21:38:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10198 states. [2019-12-26 21:38:41,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10198 states to 10198 states and 32203 transitions. [2019-12-26 21:38:41,753 INFO L78 Accepts]: Start accepts. Automaton has 10198 states and 32203 transitions. Word has length 65 [2019-12-26 21:38:41,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:41,753 INFO L462 AbstractCegarLoop]: Abstraction has 10198 states and 32203 transitions. [2019-12-26 21:38:41,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:38:41,753 INFO L276 IsEmpty]: Start isEmpty. Operand 10198 states and 32203 transitions. [2019-12-26 21:38:41,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:38:41,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:41,765 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:38:41,765 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:41,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:41,765 INFO L82 PathProgramCache]: Analyzing trace with hash -151344766, now seen corresponding path program 3 times [2019-12-26 21:38:41,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:41,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366526382] [2019-12-26 21:38:41,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:41,855 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-26 21:38:41,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366526382] [2019-12-26 21:38:41,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:41,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:38:41,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512060477] [2019-12-26 21:38:41,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:38:41,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:41,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:38:41,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:38:41,857 INFO L87 Difference]: Start difference. First operand 10198 states and 32203 transitions. Second operand 7 states. [2019-12-26 21:38:43,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:43,234 INFO L93 Difference]: Finished difference Result 23501 states and 70449 transitions. [2019-12-26 21:38:43,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 21:38:43,234 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 21:38:43,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:43,266 INFO L225 Difference]: With dead ends: 23501 [2019-12-26 21:38:43,266 INFO L226 Difference]: Without dead ends: 23333 [2019-12-26 21:38:43,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-12-26 21:38:43,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23333 states. [2019-12-26 21:38:43,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23333 to 15575. [2019-12-26 21:38:43,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15575 states. [2019-12-26 21:38:43,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15575 states to 15575 states and 47746 transitions. [2019-12-26 21:38:43,558 INFO L78 Accepts]: Start accepts. Automaton has 15575 states and 47746 transitions. Word has length 65 [2019-12-26 21:38:43,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:43,559 INFO L462 AbstractCegarLoop]: Abstraction has 15575 states and 47746 transitions. [2019-12-26 21:38:43,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:38:43,559 INFO L276 IsEmpty]: Start isEmpty. Operand 15575 states and 47746 transitions. [2019-12-26 21:38:43,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:38:43,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:43,575 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:38:43,576 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:43,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:43,576 INFO L82 PathProgramCache]: Analyzing trace with hash 266345566, now seen corresponding path program 1 times [2019-12-26 21:38:43,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:43,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233671479] [2019-12-26 21:38:43,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:43,641 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-26 21:38:43,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233671479] [2019-12-26 21:38:43,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:43,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:38:43,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574340178] [2019-12-26 21:38:43,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:38:43,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:43,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:38:43,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:38:43,643 INFO L87 Difference]: Start difference. First operand 15575 states and 47746 transitions. Second operand 4 states. [2019-12-26 21:38:43,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:43,752 INFO L93 Difference]: Finished difference Result 15387 states and 47001 transitions. [2019-12-26 21:38:43,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:38:43,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-26 21:38:43,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:43,772 INFO L225 Difference]: With dead ends: 15387 [2019-12-26 21:38:43,773 INFO L226 Difference]: Without dead ends: 15387 [2019-12-26 21:38:43,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:38:43,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15387 states. [2019-12-26 21:38:43,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15387 to 14373. [2019-12-26 21:38:43,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14373 states. [2019-12-26 21:38:44,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14373 states to 14373 states and 43885 transitions. [2019-12-26 21:38:44,003 INFO L78 Accepts]: Start accepts. Automaton has 14373 states and 43885 transitions. Word has length 65 [2019-12-26 21:38:44,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:44,003 INFO L462 AbstractCegarLoop]: Abstraction has 14373 states and 43885 transitions. [2019-12-26 21:38:44,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:38:44,003 INFO L276 IsEmpty]: Start isEmpty. Operand 14373 states and 43885 transitions. [2019-12-26 21:38:44,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:38:44,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:44,024 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:38:44,024 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:44,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:44,024 INFO L82 PathProgramCache]: Analyzing trace with hash -547409899, now seen corresponding path program 1 times [2019-12-26 21:38:44,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:44,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559703974] [2019-12-26 21:38:44,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:44,111 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-26 21:38:44,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559703974] [2019-12-26 21:38:44,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:44,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:38:44,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16892124] [2019-12-26 21:38:44,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:38:44,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:44,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:38:44,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:38:44,113 INFO L87 Difference]: Start difference. First operand 14373 states and 43885 transitions. Second operand 6 states. [2019-12-26 21:38:44,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:44,780 INFO L93 Difference]: Finished difference Result 19110 states and 56991 transitions. [2019-12-26 21:38:44,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 21:38:44,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-26 21:38:44,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:44,809 INFO L225 Difference]: With dead ends: 19110 [2019-12-26 21:38:44,809 INFO L226 Difference]: Without dead ends: 18870 [2019-12-26 21:38:44,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 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-26 21:38:44,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18870 states. [2019-12-26 21:38:45,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18870 to 16407. [2019-12-26 21:38:45,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16407 states. [2019-12-26 21:38:45,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16407 states to 16407 states and 49508 transitions. [2019-12-26 21:38:45,064 INFO L78 Accepts]: Start accepts. Automaton has 16407 states and 49508 transitions. Word has length 65 [2019-12-26 21:38:45,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:45,065 INFO L462 AbstractCegarLoop]: Abstraction has 16407 states and 49508 transitions. [2019-12-26 21:38:45,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:38:45,065 INFO L276 IsEmpty]: Start isEmpty. Operand 16407 states and 49508 transitions. [2019-12-26 21:38:45,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:38:45,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:45,082 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:38:45,082 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:45,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:45,082 INFO L82 PathProgramCache]: Analyzing trace with hash -236370469, now seen corresponding path program 2 times [2019-12-26 21:38:45,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:45,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292307101] [2019-12-26 21:38:45,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:45,209 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-26 21:38:45,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292307101] [2019-12-26 21:38:45,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:45,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:38:45,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36944070] [2019-12-26 21:38:45,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:38:45,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:45,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:38:45,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:38:45,211 INFO L87 Difference]: Start difference. First operand 16407 states and 49508 transitions. Second operand 8 states. [2019-12-26 21:38:46,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:46,887 INFO L93 Difference]: Finished difference Result 29779 states and 88436 transitions. [2019-12-26 21:38:46,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 21:38:46,888 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-26 21:38:46,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:46,924 INFO L225 Difference]: With dead ends: 29779 [2019-12-26 21:38:46,925 INFO L226 Difference]: Without dead ends: 29779 [2019-12-26 21:38:46,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2019-12-26 21:38:47,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29779 states. [2019-12-26 21:38:47,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29779 to 17991. [2019-12-26 21:38:47,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17991 states. [2019-12-26 21:38:47,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17991 states to 17991 states and 54002 transitions. [2019-12-26 21:38:47,256 INFO L78 Accepts]: Start accepts. Automaton has 17991 states and 54002 transitions. Word has length 65 [2019-12-26 21:38:47,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:47,256 INFO L462 AbstractCegarLoop]: Abstraction has 17991 states and 54002 transitions. [2019-12-26 21:38:47,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:38:47,256 INFO L276 IsEmpty]: Start isEmpty. Operand 17991 states and 54002 transitions. [2019-12-26 21:38:47,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 21:38:47,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:47,275 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:38:47,275 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:47,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:47,276 INFO L82 PathProgramCache]: Analyzing trace with hash 371994719, now seen corresponding path program 3 times [2019-12-26 21:38:47,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:47,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700326640] [2019-12-26 21:38:47,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:47,337 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-26 21:38:47,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700326640] [2019-12-26 21:38:47,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:47,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:38:47,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255656970] [2019-12-26 21:38:47,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:38:47,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:47,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:38:47,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:38:47,339 INFO L87 Difference]: Start difference. First operand 17991 states and 54002 transitions. Second operand 3 states. [2019-12-26 21:38:47,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:47,404 INFO L93 Difference]: Finished difference Result 15680 states and 46426 transitions. [2019-12-26 21:38:47,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:38:47,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 21:38:47,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:47,429 INFO L225 Difference]: With dead ends: 15680 [2019-12-26 21:38:47,430 INFO L226 Difference]: Without dead ends: 15680 [2019-12-26 21:38:47,430 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-26 21:38:47,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15680 states. [2019-12-26 21:38:47,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15680 to 15578. [2019-12-26 21:38:47,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15578 states. [2019-12-26 21:38:47,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15578 states to 15578 states and 46137 transitions. [2019-12-26 21:38:47,663 INFO L78 Accepts]: Start accepts. Automaton has 15578 states and 46137 transitions. Word has length 65 [2019-12-26 21:38:47,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:47,664 INFO L462 AbstractCegarLoop]: Abstraction has 15578 states and 46137 transitions. [2019-12-26 21:38:47,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:38:47,664 INFO L276 IsEmpty]: Start isEmpty. Operand 15578 states and 46137 transitions. [2019-12-26 21:38:47,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:38:47,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:47,680 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:38:47,681 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:47,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:47,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1846241215, now seen corresponding path program 1 times [2019-12-26 21:38:47,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:47,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234659787] [2019-12-26 21:38:47,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:47,862 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-26 21:38:47,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234659787] [2019-12-26 21:38:47,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:47,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:38:47,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642997876] [2019-12-26 21:38:47,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:38:47,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:47,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:38:47,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:38:47,864 INFO L87 Difference]: Start difference. First operand 15578 states and 46137 transitions. Second operand 10 states. [2019-12-26 21:38:50,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:50,562 INFO L93 Difference]: Finished difference Result 37025 states and 107657 transitions. [2019-12-26 21:38:50,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-26 21:38:50,563 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 21:38:50,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:50,614 INFO L225 Difference]: With dead ends: 37025 [2019-12-26 21:38:50,614 INFO L226 Difference]: Without dead ends: 37025 [2019-12-26 21:38:50,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2019-12-26 21:38:50,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37025 states. [2019-12-26 21:38:50,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37025 to 16070. [2019-12-26 21:38:50,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16070 states. [2019-12-26 21:38:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16070 states to 16070 states and 47624 transitions. [2019-12-26 21:38:50,987 INFO L78 Accepts]: Start accepts. Automaton has 16070 states and 47624 transitions. Word has length 66 [2019-12-26 21:38:50,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:50,988 INFO L462 AbstractCegarLoop]: Abstraction has 16070 states and 47624 transitions. [2019-12-26 21:38:50,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:38:50,988 INFO L276 IsEmpty]: Start isEmpty. Operand 16070 states and 47624 transitions. [2019-12-26 21:38:51,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:38:51,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:51,004 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:38:51,004 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:51,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:51,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1529321463, now seen corresponding path program 2 times [2019-12-26 21:38:51,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:51,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397163972] [2019-12-26 21:38:51,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:51,123 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-26 21:38:51,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397163972] [2019-12-26 21:38:51,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:51,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:38:51,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944072879] [2019-12-26 21:38:51,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:38:51,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:51,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:38:51,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:38:51,129 INFO L87 Difference]: Start difference. First operand 16070 states and 47624 transitions. Second operand 9 states. [2019-12-26 21:38:52,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:52,415 INFO L93 Difference]: Finished difference Result 31731 states and 92832 transitions. [2019-12-26 21:38:52,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 21:38:52,416 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-26 21:38:52,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:52,444 INFO L225 Difference]: With dead ends: 31731 [2019-12-26 21:38:52,445 INFO L226 Difference]: Without dead ends: 22372 [2019-12-26 21:38:52,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-26 21:38:52,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22372 states. [2019-12-26 21:38:52,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22372 to 16975. [2019-12-26 21:38:52,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16975 states. [2019-12-26 21:38:52,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16975 states to 16975 states and 49784 transitions. [2019-12-26 21:38:52,833 INFO L78 Accepts]: Start accepts. Automaton has 16975 states and 49784 transitions. Word has length 66 [2019-12-26 21:38:52,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:52,833 INFO L462 AbstractCegarLoop]: Abstraction has 16975 states and 49784 transitions. [2019-12-26 21:38:52,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:38:52,833 INFO L276 IsEmpty]: Start isEmpty. Operand 16975 states and 49784 transitions. [2019-12-26 21:38:52,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:38:52,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:52,850 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:38:52,850 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:52,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:52,851 INFO L82 PathProgramCache]: Analyzing trace with hash -603271737, now seen corresponding path program 3 times [2019-12-26 21:38:52,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:52,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596491090] [2019-12-26 21:38:52,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:52,983 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-26 21:38:52,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596491090] [2019-12-26 21:38:52,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:52,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:38:52,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650777982] [2019-12-26 21:38:52,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:38:52,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:52,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:38:52,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:38:52,984 INFO L87 Difference]: Start difference. First operand 16975 states and 49784 transitions. Second operand 10 states. [2019-12-26 21:38:53,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:53,642 INFO L93 Difference]: Finished difference Result 26335 states and 76529 transitions. [2019-12-26 21:38:53,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 21:38:53,642 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 21:38:53,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:53,673 INFO L225 Difference]: With dead ends: 26335 [2019-12-26 21:38:53,673 INFO L226 Difference]: Without dead ends: 24312 [2019-12-26 21:38:53,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2019-12-26 21:38:53,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24312 states. [2019-12-26 21:38:53,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24312 to 19487. [2019-12-26 21:38:53,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19487 states. [2019-12-26 21:38:53,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19487 states to 19487 states and 56903 transitions. [2019-12-26 21:38:53,992 INFO L78 Accepts]: Start accepts. Automaton has 19487 states and 56903 transitions. Word has length 66 [2019-12-26 21:38:53,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:53,992 INFO L462 AbstractCegarLoop]: Abstraction has 19487 states and 56903 transitions. [2019-12-26 21:38:53,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:38:53,992 INFO L276 IsEmpty]: Start isEmpty. Operand 19487 states and 56903 transitions. [2019-12-26 21:38:54,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:38:54,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:54,014 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:38:54,014 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:54,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:54,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1653595553, now seen corresponding path program 4 times [2019-12-26 21:38:54,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:54,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327807141] [2019-12-26 21:38:54,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:54,327 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-26 21:38:54,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327807141] [2019-12-26 21:38:54,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:54,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-26 21:38:54,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070324186] [2019-12-26 21:38:54,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 21:38:54,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:54,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 21:38:54,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:38:54,329 INFO L87 Difference]: Start difference. First operand 19487 states and 56903 transitions. Second operand 14 states. [2019-12-26 21:38:57,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:38:57,568 INFO L93 Difference]: Finished difference Result 38764 states and 111992 transitions. [2019-12-26 21:38:57,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-26 21:38:57,568 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-26 21:38:57,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:38:57,616 INFO L225 Difference]: With dead ends: 38764 [2019-12-26 21:38:57,617 INFO L226 Difference]: Without dead ends: 38764 [2019-12-26 21:38:57,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=257, Invalid=933, Unknown=0, NotChecked=0, Total=1190 [2019-12-26 21:38:57,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38764 states. [2019-12-26 21:38:57,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38764 to 21017. [2019-12-26 21:38:57,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21017 states. [2019-12-26 21:38:58,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21017 states to 21017 states and 61391 transitions. [2019-12-26 21:38:58,034 INFO L78 Accepts]: Start accepts. Automaton has 21017 states and 61391 transitions. Word has length 66 [2019-12-26 21:38:58,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:38:58,034 INFO L462 AbstractCegarLoop]: Abstraction has 21017 states and 61391 transitions. [2019-12-26 21:38:58,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 21:38:58,034 INFO L276 IsEmpty]: Start isEmpty. Operand 21017 states and 61391 transitions. [2019-12-26 21:38:58,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:38:58,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:38:58,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:38:58,058 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:38:58,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:38:58,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1779717717, now seen corresponding path program 5 times [2019-12-26 21:38:58,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:38:58,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050442004] [2019-12-26 21:38:58,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:38:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:38:58,237 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-26 21:38:58,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050442004] [2019-12-26 21:38:58,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:38:58,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 21:38:58,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052052348] [2019-12-26 21:38:58,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 21:38:58,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:38:58,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 21:38:58,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:38:58,239 INFO L87 Difference]: Start difference. First operand 21017 states and 61391 transitions. Second operand 12 states. [2019-12-26 21:39:02,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:39:02,558 INFO L93 Difference]: Finished difference Result 62272 states and 178576 transitions. [2019-12-26 21:39:02,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-26 21:39:02,559 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-26 21:39:02,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:39:02,640 INFO L225 Difference]: With dead ends: 62272 [2019-12-26 21:39:02,640 INFO L226 Difference]: Without dead ends: 62272 [2019-12-26 21:39:02,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=405, Invalid=2045, Unknown=0, NotChecked=0, Total=2450 [2019-12-26 21:39:02,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62272 states. [2019-12-26 21:39:03,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62272 to 23120. [2019-12-26 21:39:03,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23120 states. [2019-12-26 21:39:03,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23120 states to 23120 states and 67380 transitions. [2019-12-26 21:39:03,235 INFO L78 Accepts]: Start accepts. Automaton has 23120 states and 67380 transitions. Word has length 66 [2019-12-26 21:39:03,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:39:03,235 INFO L462 AbstractCegarLoop]: Abstraction has 23120 states and 67380 transitions. [2019-12-26 21:39:03,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 21:39:03,235 INFO L276 IsEmpty]: Start isEmpty. Operand 23120 states and 67380 transitions. [2019-12-26 21:39:03,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:39:03,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:39:03,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:39:03,258 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:39:03,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:39:03,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1466417963, now seen corresponding path program 6 times [2019-12-26 21:39:03,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:39:03,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460362803] [2019-12-26 21:39:03,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:39:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:39:03,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:39:03,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460362803] [2019-12-26 21:39:03,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:39:03,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 21:39:03,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668031480] [2019-12-26 21:39:03,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 21:39:03,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:39:03,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 21:39:03,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:39:03,450 INFO L87 Difference]: Start difference. First operand 23120 states and 67380 transitions. Second operand 12 states. [2019-12-26 21:39:07,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:39:07,343 INFO L93 Difference]: Finished difference Result 61287 states and 175772 transitions. [2019-12-26 21:39:07,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-26 21:39:07,343 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-26 21:39:07,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:39:07,429 INFO L225 Difference]: With dead ends: 61287 [2019-12-26 21:39:07,429 INFO L226 Difference]: Without dead ends: 61287 [2019-12-26 21:39:07,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=361, Invalid=1709, Unknown=0, NotChecked=0, Total=2070 [2019-12-26 21:39:07,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61287 states. [2019-12-26 21:39:08,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61287 to 23404. [2019-12-26 21:39:08,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23404 states. [2019-12-26 21:39:08,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23404 states to 23404 states and 68278 transitions. [2019-12-26 21:39:08,219 INFO L78 Accepts]: Start accepts. Automaton has 23404 states and 68278 transitions. Word has length 66 [2019-12-26 21:39:08,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:39:08,219 INFO L462 AbstractCegarLoop]: Abstraction has 23404 states and 68278 transitions. [2019-12-26 21:39:08,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 21:39:08,219 INFO L276 IsEmpty]: Start isEmpty. Operand 23404 states and 68278 transitions. [2019-12-26 21:39:08,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:39:08,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:39:08,242 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:39:08,242 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:39:08,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:39:08,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1985732535, now seen corresponding path program 7 times [2019-12-26 21:39:08,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:39:08,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195242264] [2019-12-26 21:39:08,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:39:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:39:08,377 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-26 21:39:08,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195242264] [2019-12-26 21:39:08,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:39:08,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:39:08,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879000630] [2019-12-26 21:39:08,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:39:08,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:39:08,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:39:08,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:39:08,379 INFO L87 Difference]: Start difference. First operand 23404 states and 68278 transitions. Second operand 10 states. [2019-12-26 21:39:09,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:39:09,020 INFO L93 Difference]: Finished difference Result 29056 states and 83730 transitions. [2019-12-26 21:39:09,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 21:39:09,021 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 21:39:09,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:39:09,056 INFO L225 Difference]: With dead ends: 29056 [2019-12-26 21:39:09,056 INFO L226 Difference]: Without dead ends: 24599 [2019-12-26 21:39:09,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-26 21:39:09,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24599 states. [2019-12-26 21:39:09,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24599 to 19355. [2019-12-26 21:39:09,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19355 states. [2019-12-26 21:39:09,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19355 states to 19355 states and 56797 transitions. [2019-12-26 21:39:09,401 INFO L78 Accepts]: Start accepts. Automaton has 19355 states and 56797 transitions. Word has length 66 [2019-12-26 21:39:09,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:39:09,401 INFO L462 AbstractCegarLoop]: Abstraction has 19355 states and 56797 transitions. [2019-12-26 21:39:09,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:39:09,401 INFO L276 IsEmpty]: Start isEmpty. Operand 19355 states and 56797 transitions. [2019-12-26 21:39:09,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:39:09,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:39:09,421 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:39:09,421 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:39:09,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:39:09,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1846393563, now seen corresponding path program 8 times [2019-12-26 21:39:09,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:39:09,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409251484] [2019-12-26 21:39:09,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:39:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:39:09,568 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-26 21:39:09,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409251484] [2019-12-26 21:39:09,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:39:09,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:39:09,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457870259] [2019-12-26 21:39:09,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:39:09,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:39:09,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:39:09,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:39:09,570 INFO L87 Difference]: Start difference. First operand 19355 states and 56797 transitions. Second operand 11 states. [2019-12-26 21:39:10,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:39:10,423 INFO L93 Difference]: Finished difference Result 32364 states and 94068 transitions. [2019-12-26 21:39:10,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 21:39:10,424 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 21:39:10,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:39:10,453 INFO L225 Difference]: With dead ends: 32364 [2019-12-26 21:39:10,453 INFO L226 Difference]: Without dead ends: 22760 [2019-12-26 21:39:10,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2019-12-26 21:39:10,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22760 states. [2019-12-26 21:39:10,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22760 to 18817. [2019-12-26 21:39:10,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18817 states. [2019-12-26 21:39:10,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18817 states to 18817 states and 55105 transitions. [2019-12-26 21:39:10,745 INFO L78 Accepts]: Start accepts. Automaton has 18817 states and 55105 transitions. Word has length 66 [2019-12-26 21:39:10,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:39:10,745 INFO L462 AbstractCegarLoop]: Abstraction has 18817 states and 55105 transitions. [2019-12-26 21:39:10,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:39:10,745 INFO L276 IsEmpty]: Start isEmpty. Operand 18817 states and 55105 transitions. [2019-12-26 21:39:10,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:39:10,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:39:10,762 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:39:10,762 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:39:10,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:39:10,763 INFO L82 PathProgramCache]: Analyzing trace with hash 702259789, now seen corresponding path program 9 times [2019-12-26 21:39:10,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:39:10,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626006282] [2019-12-26 21:39:10,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:39:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:39:10,930 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-26 21:39:10,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626006282] [2019-12-26 21:39:10,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:39:10,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:39:10,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369150069] [2019-12-26 21:39:10,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:39:10,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:39:10,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:39:10,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:39:10,932 INFO L87 Difference]: Start difference. First operand 18817 states and 55105 transitions. Second operand 10 states. [2019-12-26 21:39:12,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:39:12,016 INFO L93 Difference]: Finished difference Result 23520 states and 67396 transitions. [2019-12-26 21:39:12,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 21:39:12,016 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 21:39:12,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:39:12,044 INFO L225 Difference]: With dead ends: 23520 [2019-12-26 21:39:12,044 INFO L226 Difference]: Without dead ends: 22169 [2019-12-26 21:39:12,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-26 21:39:12,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22169 states. [2019-12-26 21:39:12,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22169 to 18233. [2019-12-26 21:39:12,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18233 states. [2019-12-26 21:39:12,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18233 states to 18233 states and 53466 transitions. [2019-12-26 21:39:12,333 INFO L78 Accepts]: Start accepts. Automaton has 18233 states and 53466 transitions. Word has length 66 [2019-12-26 21:39:12,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:39:12,333 INFO L462 AbstractCegarLoop]: Abstraction has 18233 states and 53466 transitions. [2019-12-26 21:39:12,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:39:12,334 INFO L276 IsEmpty]: Start isEmpty. Operand 18233 states and 53466 transitions. [2019-12-26 21:39:12,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:39:12,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:39:12,350 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:39:12,350 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:39:12,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:39:12,351 INFO L82 PathProgramCache]: Analyzing trace with hash -175921769, now seen corresponding path program 10 times [2019-12-26 21:39:12,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:39:12,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505843361] [2019-12-26 21:39:12,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:39:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:39:12,495 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-26 21:39:12,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505843361] [2019-12-26 21:39:12,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:39:12,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:39:12,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673891746] [2019-12-26 21:39:12,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:39:12,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:39:12,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:39:12,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:39:12,497 INFO L87 Difference]: Start difference. First operand 18233 states and 53466 transitions. Second operand 10 states. [2019-12-26 21:39:13,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:39:13,582 INFO L93 Difference]: Finished difference Result 22802 states and 65901 transitions. [2019-12-26 21:39:13,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 21:39:13,582 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 21:39:13,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:39:13,610 INFO L225 Difference]: With dead ends: 22802 [2019-12-26 21:39:13,610 INFO L226 Difference]: Without dead ends: 22430 [2019-12-26 21:39:13,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-26 21:39:13,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22430 states. [2019-12-26 21:39:13,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22430 to 18225. [2019-12-26 21:39:13,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18225 states. [2019-12-26 21:39:13,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18225 states to 18225 states and 53438 transitions. [2019-12-26 21:39:13,903 INFO L78 Accepts]: Start accepts. Automaton has 18225 states and 53438 transitions. Word has length 66 [2019-12-26 21:39:13,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:39:13,903 INFO L462 AbstractCegarLoop]: Abstraction has 18225 states and 53438 transitions. [2019-12-26 21:39:13,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:39:13,903 INFO L276 IsEmpty]: Start isEmpty. Operand 18225 states and 53438 transitions. [2019-12-26 21:39:13,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 21:39:13,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:39:13,920 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 21:39:13,921 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:39:13,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:39:13,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1456324081, now seen corresponding path program 11 times [2019-12-26 21:39:13,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:39:13,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760852536] [2019-12-26 21:39:13,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:39:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:39:13,974 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-26 21:39:13,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760852536] [2019-12-26 21:39:13,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:39:13,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:39:13,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047736616] [2019-12-26 21:39:13,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:39:13,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:39:13,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:39:13,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:39:13,975 INFO L87 Difference]: Start difference. First operand 18225 states and 53438 transitions. Second operand 3 states. [2019-12-26 21:39:14,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:39:14,056 INFO L93 Difference]: Finished difference Result 18224 states and 53436 transitions. [2019-12-26 21:39:14,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:39:14,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 21:39:14,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:39:14,081 INFO L225 Difference]: With dead ends: 18224 [2019-12-26 21:39:14,081 INFO L226 Difference]: Without dead ends: 18224 [2019-12-26 21:39:14,081 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-26 21:39:14,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18224 states. [2019-12-26 21:39:14,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18224 to 12065. [2019-12-26 21:39:14,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12065 states. [2019-12-26 21:39:14,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12065 states to 12065 states and 35765 transitions. [2019-12-26 21:39:14,304 INFO L78 Accepts]: Start accepts. Automaton has 12065 states and 35765 transitions. Word has length 66 [2019-12-26 21:39:14,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:39:14,305 INFO L462 AbstractCegarLoop]: Abstraction has 12065 states and 35765 transitions. [2019-12-26 21:39:14,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:39:14,305 INFO L276 IsEmpty]: Start isEmpty. Operand 12065 states and 35765 transitions. [2019-12-26 21:39:14,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:39:14,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:39:14,318 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:39:14,318 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:39:14,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:39:14,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1516551711, now seen corresponding path program 1 times [2019-12-26 21:39:14,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:39:14,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995293072] [2019-12-26 21:39:14,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:39:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:39:14,501 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-26 21:39:14,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995293072] [2019-12-26 21:39:14,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:39:14,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:39:14,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468297791] [2019-12-26 21:39:14,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 21:39:14,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:39:14,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 21:39:14,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:39:14,504 INFO L87 Difference]: Start difference. First operand 12065 states and 35765 transitions. Second operand 12 states. [2019-12-26 21:39:15,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:39:15,204 INFO L93 Difference]: Finished difference Result 14499 states and 42373 transitions. [2019-12-26 21:39:15,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:39:15,205 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-26 21:39:15,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:39:15,226 INFO L225 Difference]: With dead ends: 14499 [2019-12-26 21:39:15,226 INFO L226 Difference]: Without dead ends: 14086 [2019-12-26 21:39:15,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-26 21:39:15,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14086 states. [2019-12-26 21:39:15,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14086 to 11811. [2019-12-26 21:39:15,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11811 states. [2019-12-26 21:39:15,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11811 states to 11811 states and 35121 transitions. [2019-12-26 21:39:15,420 INFO L78 Accepts]: Start accepts. Automaton has 11811 states and 35121 transitions. Word has length 67 [2019-12-26 21:39:15,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:39:15,420 INFO L462 AbstractCegarLoop]: Abstraction has 11811 states and 35121 transitions. [2019-12-26 21:39:15,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 21:39:15,420 INFO L276 IsEmpty]: Start isEmpty. Operand 11811 states and 35121 transitions. [2019-12-26 21:39:15,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 21:39:15,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:39:15,433 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:39:15,433 INFO L410 AbstractCegarLoop]: === Iteration 45 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:39:15,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:39:15,433 INFO L82 PathProgramCache]: Analyzing trace with hash -494782975, now seen corresponding path program 2 times [2019-12-26 21:39:15,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:39:15,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419803917] [2019-12-26 21:39:15,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:39:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:39:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:39:15,545 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:39:15,545 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:39:15,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [904] [904] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~a$r_buff1_thd0~0_132 0) (= 0 v_~a$w_buff0_used~0_689) (= |v_ULTIMATE.start_main_~#t397~0.offset_22| 0) (= 0 v_~a$w_buff1_used~0_376) (= v_~a$r_buff0_thd3~0_328 0) (= |v_#NULL.offset_6| 0) (= v_~y~0_79 0) (= 0 v_~a$r_buff1_thd1~0_125) (= 0 v_~__unbuffered_p0_EAX~0_92) (= 0 v_~__unbuffered_p1_EAX~0_37) (= v_~x~0_69 0) (= 0 v_~a$r_buff1_thd2~0_129) (< 0 |v_#StackHeapBarrier_17|) (= v_~__unbuffered_p0_EBX~0_92 0) (= v_~a$flush_delayed~0_23 0) (= v_~a$r_buff1_thd3~0_224 0) (= v_~__unbuffered_p2_EBX~0_38 0) (= 0 v_~__unbuffered_cnt~0_98) (= v_~main$tmp_guard0~0_28 0) (= 0 v_~a$r_buff0_thd2~0_124) (= v_~a~0_181 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t397~0.base_29|) (= 0 |v_#NULL.base_6|) (= (select .cse0 |v_ULTIMATE.start_main_~#t397~0.base_29|) 0) (= 0 v_~__unbuffered_p2_EAX~0_33) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t397~0.base_29| 1)) (= 0 v_~a$r_buff0_thd1~0_195) (= v_~a$mem_tmp~0_12 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~a$w_buff1~0_172) (= v_~a$r_buff0_thd0~0_144 0) (= v_~a$w_buff0~0_228 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t397~0.base_29| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t397~0.base_29|) |v_ULTIMATE.start_main_~#t397~0.offset_22| 0)) |v_#memory_int_21|) (= v_~weak$$choice2~0_107 0) (= v_~z~0_20 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t397~0.base_29| 4)) (= 0 v_~a$read_delayed~0_6) (= v_~a$read_delayed_var~0.offset_6 0) (= 0 v_~a$read_delayed_var~0.base_6))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_129, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_51|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_281|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_144, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_31|, ~a~0=v_~a~0_181, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_67|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ULTIMATE.start_main_~#t398~0.base=|v_ULTIMATE.start_main_~#t398~0.base_29|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_~#t397~0.offset=|v_ULTIMATE.start_main_~#t397~0.offset_22|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_224, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_689, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_195, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ~a$w_buff0~0=v_~a$w_buff0~0_228, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_132, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~x~0=v_~x~0_69, ~a$read_delayed~0=v_~a$read_delayed~0_6, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_124, ULTIMATE.start_main_~#t397~0.base=|v_ULTIMATE.start_main_~#t397~0.base_29|, ULTIMATE.start_main_~#t398~0.offset=|v_ULTIMATE.start_main_~#t398~0.offset_22|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_55|, ~a$mem_tmp~0=v_~a$mem_tmp~0_12, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~a$w_buff1~0=v_~a$w_buff1~0_172, ~y~0=v_~y~0_79, ULTIMATE.start_main_~#t399~0.base=|v_ULTIMATE.start_main_~#t399~0.base_17|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ULTIMATE.start_main_~#t399~0.offset=|v_ULTIMATE.start_main_~#t399~0.offset_15|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_125, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_328, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, #NULL.base=|v_#NULL.base_6|, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_376, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t398~0.base, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t397~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ULTIMATE.start_main_~#t397~0.base, ULTIMATE.start_main_~#t398~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_~#t399~0.base, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t399~0.offset, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-26 21:39:15,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L837-1-->L839: Formula: (and (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t398~0.base_12| 1) |v_#valid_34|) (not (= |v_ULTIMATE.start_main_~#t398~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t398~0.offset_10| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t398~0.base_12|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t398~0.base_12| 4)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t398~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t398~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t398~0.base_12|) |v_ULTIMATE.start_main_~#t398~0.offset_10| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t398~0.base=|v_ULTIMATE.start_main_~#t398~0.base_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t398~0.offset=|v_ULTIMATE.start_main_~#t398~0.offset_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t398~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t398~0.offset, #length] because there is no mapped edge [2019-12-26 21:39:15,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L839-1-->L841: Formula: (and (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t399~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t399~0.base_13|)) (= |v_ULTIMATE.start_main_~#t399~0.offset_11| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t399~0.base_13|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t399~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t399~0.base_13|) |v_ULTIMATE.start_main_~#t399~0.offset_11| 2))) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t399~0.base_13| 4) |v_#length_15|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t399~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t399~0.base=|v_ULTIMATE.start_main_~#t399~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t399~0.offset=|v_ULTIMATE.start_main_~#t399~0.offset_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t399~0.base, ULTIMATE.start_main_~#t399~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-26 21:39:15,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L4-->L758: Formula: (and (= ~x~0_Out1790449666 ~__unbuffered_p0_EAX~0_Out1790449666) (= ~a$r_buff1_thd3~0_Out1790449666 ~a$r_buff0_thd3~0_In1790449666) (= ~a$r_buff1_thd0~0_Out1790449666 ~a$r_buff0_thd0~0_In1790449666) (= ~a$r_buff1_thd2~0_Out1790449666 ~a$r_buff0_thd2~0_In1790449666) (= ~a$r_buff0_thd1~0_In1790449666 ~a$r_buff1_thd1~0_Out1790449666) (= ~x~0_Out1790449666 1) (= ~y~0_In1790449666 ~__unbuffered_p0_EBX~0_Out1790449666) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1790449666 0)) (= ~a$r_buff0_thd1~0_Out1790449666 1)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1790449666, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1790449666, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1790449666, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1790449666, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1790449666, ~y~0=~y~0_In1790449666} OutVars{~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out1790449666, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out1790449666, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out1790449666, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out1790449666, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1790449666, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1790449666, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1790449666, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1790449666, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1790449666, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out1790449666, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1790449666, ~y~0=~y~0_In1790449666, ~x~0=~x~0_Out1790449666} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-26 21:39:15,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L759-->L759-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-351008764 256))) (.cse0 (= (mod ~a$r_buff0_thd1~0_In-351008764 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-351008764|) (not .cse1)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In-351008764 |P0Thread1of1ForFork1_#t~ite5_Out-351008764|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-351008764, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-351008764} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-351008764|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-351008764, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-351008764} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-26 21:39:15,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L760-->L760-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In355419650 256))) (.cse3 (= (mod ~a$r_buff0_thd1~0_In355419650 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In355419650 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd1~0_In355419650 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out355419650| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite6_Out355419650| ~a$w_buff1_used~0_In355419650)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In355419650, ~a$w_buff0_used~0=~a$w_buff0_used~0_In355419650, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In355419650, ~a$w_buff1_used~0=~a$w_buff1_used~0_In355419650} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out355419650|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In355419650, ~a$w_buff0_used~0=~a$w_buff0_used~0_In355419650, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In355419650, ~a$w_buff1_used~0=~a$w_buff1_used~0_In355419650} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 21:39:15,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L778-2-->L778-4: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-1533835550 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd2~0_In-1533835550 256) 0))) (or (and (or .cse0 .cse1) (= ~a~0_In-1533835550 |P1Thread1of1ForFork2_#t~ite9_Out-1533835550|)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-1533835550| ~a$w_buff1~0_In-1533835550) (not .cse1) (not .cse0)))) InVars {~a~0=~a~0_In-1533835550, ~a$w_buff1~0=~a$w_buff1~0_In-1533835550, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1533835550, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1533835550} OutVars{~a~0=~a~0_In-1533835550, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1533835550|, ~a$w_buff1~0=~a$w_buff1~0_In-1533835550, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1533835550, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1533835550} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-26 21:39:15,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L778-4-->L779: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_12| v_~a~0_28) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_12|} OutVars{~a~0=v_~a~0_28, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_11|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_15|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-26 21:39:15,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L761-->L762: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1806509783 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd1~0_In1806509783 256) 0))) (or (and (= ~a$r_buff0_thd1~0_In1806509783 ~a$r_buff0_thd1~0_Out1806509783) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out1806509783) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1806509783, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1806509783} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1806509783|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1806509783, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1806509783} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 21:39:15,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L762-->L762-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In1280283839 256))) (.cse0 (= (mod ~a$r_buff1_thd1~0_In1280283839 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In1280283839 256))) (.cse3 (= (mod ~a$r_buff0_thd1~0_In1280283839 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out1280283839| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork1_#t~ite8_Out1280283839| ~a$r_buff1_thd1~0_In1280283839) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1280283839, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1280283839, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1280283839, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1280283839} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1280283839|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1280283839, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1280283839, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1280283839, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1280283839} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 21:39:15,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L762-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork1_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_cnt~0_49 (+ v_~__unbuffered_cnt~0_50 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_35|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 21:39:15,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In2131296750 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In2131296750 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out2131296750|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out2131296750| ~a$w_buff0_used~0_In2131296750) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2131296750, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2131296750} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2131296750, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2131296750, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out2131296750|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 21:39:15,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L803-->L803-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In151474738 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite21_Out151474738| |P2Thread1of1ForFork0_#t~ite20_Out151474738|) (= |P2Thread1of1ForFork0_#t~ite20_Out151474738| ~a$w_buff0~0_In151474738) (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In151474738 256)))) (or (and (= 0 (mod ~a$r_buff1_thd3~0_In151474738 256)) .cse0) (and (= 0 (mod ~a$w_buff1_used~0_In151474738 256)) .cse0) (= (mod ~a$w_buff0_used~0_In151474738 256) 0))) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite21_Out151474738| ~a$w_buff0~0_In151474738) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite20_In151474738| |P2Thread1of1ForFork0_#t~ite20_Out151474738|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In151474738, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In151474738, ~a$w_buff0_used~0=~a$w_buff0_used~0_In151474738, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In151474738, ~a$w_buff1_used~0=~a$w_buff1_used~0_In151474738, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In151474738|, ~weak$$choice2~0=~weak$$choice2~0_In151474738} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out151474738|, ~a$w_buff0~0=~a$w_buff0~0_In151474738, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In151474738, ~a$w_buff0_used~0=~a$w_buff0_used~0_In151474738, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In151474738, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out151474738|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In151474738, ~weak$$choice2~0=~weak$$choice2~0_In151474738} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-26 21:39:15,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L804-->L804-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1975012105 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite23_In1975012105| |P2Thread1of1ForFork0_#t~ite23_Out1975012105|) (= ~a$w_buff1~0_In1975012105 |P2Thread1of1ForFork0_#t~ite24_Out1975012105|)) (and .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1975012105 256) 0))) (or (= 0 (mod ~a$w_buff0_used~0_In1975012105 256)) (and (= (mod ~a$r_buff1_thd3~0_In1975012105 256) 0) .cse1) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In1975012105 256))))) (= |P2Thread1of1ForFork0_#t~ite23_Out1975012105| |P2Thread1of1ForFork0_#t~ite24_Out1975012105|) (= |P2Thread1of1ForFork0_#t~ite23_Out1975012105| ~a$w_buff1~0_In1975012105)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In1975012105, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In1975012105|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1975012105, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1975012105, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1975012105, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1975012105, ~weak$$choice2~0=~weak$$choice2~0_In1975012105} OutVars{~a$w_buff1~0=~a$w_buff1~0_In1975012105, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out1975012105|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out1975012105|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1975012105, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1975012105, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1975012105, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1975012105, ~weak$$choice2~0=~weak$$choice2~0_In1975012105} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-26 21:39:15,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L805-->L805-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In638388135 256) 0))) (or (and (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In638388135 256) 0))) (or (and (= (mod ~a$r_buff1_thd3~0_In638388135 256) 0) .cse0) (= 0 (mod ~a$w_buff0_used~0_In638388135 256)) (and (= (mod ~a$w_buff1_used~0_In638388135 256) 0) .cse0))) .cse1 (= |P2Thread1of1ForFork0_#t~ite27_Out638388135| |P2Thread1of1ForFork0_#t~ite26_Out638388135|) (= ~a$w_buff0_used~0_In638388135 |P2Thread1of1ForFork0_#t~ite26_Out638388135|)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite26_In638388135| |P2Thread1of1ForFork0_#t~ite26_Out638388135|) (= ~a$w_buff0_used~0_In638388135 |P2Thread1of1ForFork0_#t~ite27_Out638388135|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In638388135|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In638388135, ~a$w_buff0_used~0=~a$w_buff0_used~0_In638388135, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In638388135, ~a$w_buff1_used~0=~a$w_buff1_used~0_In638388135, ~weak$$choice2~0=~weak$$choice2~0_In638388135} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out638388135|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out638388135|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In638388135, ~a$w_buff0_used~0=~a$w_buff0_used~0_In638388135, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In638388135, ~a$w_buff1_used~0=~a$w_buff1_used~0_In638388135, ~weak$$choice2~0=~weak$$choice2~0_In638388135} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-26 21:39:15,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-->L808: Formula: (and (= v_~a$r_buff0_thd3~0_53 v_~a$r_buff0_thd3~0_52) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_52, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 21:39:15,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L810-->L814: Formula: (and (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a~0_16 v_~a$mem_tmp~0_4) (= v_~a$flush_delayed~0_6 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_16, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-26 21:39:15,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L814-2-->L814-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-1150697445 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd3~0_In-1150697445 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-1150697445| ~a~0_In-1150697445)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-1150697445| ~a$w_buff1~0_In-1150697445)))) InVars {~a~0=~a~0_In-1150697445, ~a$w_buff1~0=~a$w_buff1~0_In-1150697445, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1150697445, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1150697445} OutVars{~a~0=~a~0_In-1150697445, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1150697445|, ~a$w_buff1~0=~a$w_buff1~0_In-1150697445, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1150697445, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1150697445} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 21:39:15,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L814-4-->L815: Formula: (= v_~a~0_36 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{~a~0=v_~a~0_36, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 21:39:15,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L815-->L815-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-352746290 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-352746290 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out-352746290| 0) (not .cse0) (not .cse1)) (and (= ~a$w_buff0_used~0_In-352746290 |P2Thread1of1ForFork0_#t~ite40_Out-352746290|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-352746290, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-352746290} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-352746290|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-352746290, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-352746290} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-26 21:39:15,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L816-->L816-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1671439504 256))) (.cse3 (= (mod ~a$r_buff0_thd3~0_In-1671439504 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1671439504 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1671439504 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1671439504|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out-1671439504| ~a$w_buff1_used~0_In-1671439504) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1671439504, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1671439504, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1671439504, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1671439504} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1671439504, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1671439504, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1671439504, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1671439504, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1671439504|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-26 21:39:15,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L817-->L817-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In115206925 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In115206925 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out115206925|)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd3~0_In115206925 |P2Thread1of1ForFork0_#t~ite42_Out115206925|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In115206925, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In115206925} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In115206925, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In115206925, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out115206925|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 21:39:15,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1135459090 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1135459090 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In-1135459090 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1135459090 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1135459090|)) (and (= ~a$r_buff1_thd3~0_In-1135459090 |P2Thread1of1ForFork0_#t~ite43_Out-1135459090|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1135459090, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1135459090, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1135459090, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1135459090} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1135459090|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1135459090, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1135459090, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1135459090, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1135459090} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-26 21:39:15,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L780-->L780-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In11051844 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In11051844 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In11051844 256))) (.cse0 (= (mod ~a$r_buff0_thd2~0_In11051844 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out11051844| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite12_Out11051844| ~a$w_buff1_used~0_In11051844)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In11051844, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In11051844, ~a$w_buff0_used~0=~a$w_buff0_used~0_In11051844, ~a$w_buff1_used~0=~a$w_buff1_used~0_In11051844} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In11051844, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In11051844, ~a$w_buff0_used~0=~a$w_buff0_used~0_In11051844, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out11051844|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In11051844} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-26 21:39:15,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1061365988 256))) (.cse1 (= (mod ~a$r_buff0_thd2~0_In1061365988 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1061365988|) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd2~0_In1061365988 |P1Thread1of1ForFork2_#t~ite13_Out1061365988|) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1061365988, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1061365988} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1061365988, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1061365988, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1061365988|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-26 21:39:15,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L782-->L782-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1922791236 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In-1922791236 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1922791236 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-1922791236 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1922791236|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork2_#t~ite14_Out-1922791236| ~a$r_buff1_thd2~0_In-1922791236) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1922791236, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1922791236, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1922791236, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1922791236} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1922791236, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1922791236, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1922791236, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1922791236, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1922791236|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 21:39:15,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L818-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= v_~a$r_buff1_thd3~0_123 |v_P2Thread1of1ForFork0_#t~ite43_34|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_123, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-26 21:39:15,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L782-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_44| v_~a$r_buff1_thd2~0_99) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_44|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_99, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_43|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-26 21:39:15,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L841-1-->L847: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 3 v_~__unbuffered_cnt~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 21:39:15,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L847-2-->L847-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-1676007999 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-1676007999 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-1676007999| ~a~0_In-1676007999)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-1676007999| ~a$w_buff1~0_In-1676007999) (not .cse1)))) InVars {~a~0=~a~0_In-1676007999, ~a$w_buff1~0=~a$w_buff1~0_In-1676007999, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1676007999, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1676007999} OutVars{~a~0=~a~0_In-1676007999, ~a$w_buff1~0=~a$w_buff1~0_In-1676007999, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1676007999|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1676007999, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1676007999} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-26 21:39:15,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L847-4-->L848: Formula: (= v_~a~0_44 |v_ULTIMATE.start_main_#t~ite47_19|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_19|} OutVars{~a~0=v_~a~0_44, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_18|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 21:39:15,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L848-->L848-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-76504278 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-76504278 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-76504278 |ULTIMATE.start_main_#t~ite49_Out-76504278|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-76504278|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-76504278, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-76504278} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-76504278, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-76504278|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-76504278} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 21:39:15,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L849-->L849-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd0~0_In2137933962 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In2137933962 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In2137933962 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd0~0_In2137933962 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In2137933962 |ULTIMATE.start_main_#t~ite50_Out2137933962|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite50_Out2137933962| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2137933962, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2137933962, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2137933962, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2137933962} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out2137933962|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2137933962, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2137933962, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2137933962, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2137933962} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 21:39:15,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L850-->L850-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In1569008224 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1569008224 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out1569008224|) (not .cse1)) (and (= ~a$r_buff0_thd0~0_In1569008224 |ULTIMATE.start_main_#t~ite51_Out1569008224|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1569008224, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1569008224} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1569008224|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1569008224, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1569008224} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 21:39:15,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L851-->L851-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In416555523 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In416555523 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In416555523 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In416555523 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd0~0_In416555523 |ULTIMATE.start_main_#t~ite52_Out416555523|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out416555523|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In416555523, ~a$w_buff0_used~0=~a$w_buff0_used~0_In416555523, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In416555523, ~a$w_buff1_used~0=~a$w_buff1_used~0_In416555523} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out416555523|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In416555523, ~a$w_buff0_used~0=~a$w_buff0_used~0_In416555523, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In416555523, ~a$w_buff1_used~0=~a$w_buff1_used~0_In416555523} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 21:39:15,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~a$r_buff1_thd0~0_125 |v_ULTIMATE.start_main_#t~ite52_55|) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~__unbuffered_p2_EBX~0_29 0) (= 0 v_~__unbuffered_p1_EAX~0_28) (= 1 v_~__unbuffered_p2_EAX~0_26) (= v_~__unbuffered_p0_EBX~0_85 0) (= v_~main$tmp_guard1~0_29 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 0) (= 1 v_~__unbuffered_p0_EAX~0_85)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_55|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_85, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_54|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_22, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_85, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_125, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:39:15,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:39:15 BasicIcfg [2019-12-26 21:39:15,681 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:39:15,683 INFO L168 Benchmark]: Toolchain (without parser) took 126495.97 ms. Allocated memory was 146.8 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 103.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-26 21:39:15,684 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 21:39:15,684 INFO L168 Benchmark]: CACSL2BoogieTranslator took 971.27 ms. Allocated memory was 146.8 MB in the beginning and 205.5 MB in the end (delta: 58.7 MB). Free memory was 102.7 MB in the beginning and 157.0 MB in the end (delta: -54.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-26 21:39:15,689 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.22 ms. Allocated memory is still 205.5 MB. Free memory was 157.0 MB in the beginning and 154.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 21:39:15,690 INFO L168 Benchmark]: Boogie Preprocessor took 42.54 ms. Allocated memory is still 205.5 MB. Free memory was 154.3 MB in the beginning and 152.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 21:39:15,690 INFO L168 Benchmark]: RCFGBuilder took 845.11 ms. Allocated memory is still 205.5 MB. Free memory was 151.7 MB in the beginning and 101.4 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-26 21:39:15,691 INFO L168 Benchmark]: TraceAbstraction took 124564.12 ms. Allocated memory was 205.5 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 100.7 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-26 21:39:15,696 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.52 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 971.27 ms. Allocated memory was 146.8 MB in the beginning and 205.5 MB in the end (delta: 58.7 MB). Free memory was 102.7 MB in the beginning and 157.0 MB in the end (delta: -54.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.22 ms. Allocated memory is still 205.5 MB. Free memory was 157.0 MB in the beginning and 154.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.54 ms. Allocated memory is still 205.5 MB. Free memory was 154.3 MB in the beginning and 152.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 845.11 ms. Allocated memory is still 205.5 MB. Free memory was 151.7 MB in the beginning and 101.4 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 124564.12 ms. Allocated memory was 205.5 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 100.7 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 179 ProgramPointsBefore, 94 ProgramPointsAfterwards, 216 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 33 ChoiceCompositions, 7151 VarBasedMoverChecksPositive, 221 VarBasedMoverChecksNegative, 29 SemBasedMoverChecksPositive, 258 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 80759 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t397, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t398, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L841] FCALL, FORK 0 pthread_create(&t399, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$w_buff1 = a$w_buff0 [L738] 1 a$w_buff0 = 1 [L739] 1 a$w_buff1_used = a$w_buff0_used [L740] 1 a$w_buff0_used = (_Bool)1 [L758] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L772] 2 y = 1 [L775] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L778] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 a$flush_delayed = weak$$choice2 [L801] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=1, y=1, z=1] [L802] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=1, y=1, z=1] [L758] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L759] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L760] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L802] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L805] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L806] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L808] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=1, y=1, z=1] [L814] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=1, y=1, z=1] [L815] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L779] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L847] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=1, y=1, z=1] [L848] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L849] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L850] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 124.2s, OverallIterations: 45, TraceHistogramMax: 1, AutomataDifference: 50.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10848 SDtfs, 18030 SDslu, 39176 SDs, 0 SdLazy, 26613 SolverSat, 1133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 777 GetRequests, 128 SyntacticMatches, 37 SemanticMatches, 612 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3651 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156295occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 40.8s AutomataMinimizationTime, 44 MinimizatonAttempts, 424289 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 2196 NumberOfCodeBlocks, 2196 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 2085 ConstructedInterpolants, 0 QuantifiedInterpolants, 473569 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 44 InterpolantComputations, 44 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...