/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe033_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 08:10:25,097 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 08:10:25,099 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 08:10:25,117 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 08:10:25,117 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 08:10:25,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 08:10:25,121 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 08:10:25,131 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 08:10:25,134 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 08:10:25,138 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 08:10:25,141 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 08:10:25,142 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 08:10:25,143 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 08:10:25,144 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 08:10:25,147 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 08:10:25,148 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 08:10:25,150 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 08:10:25,150 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 08:10:25,152 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 08:10:25,157 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 08:10:25,161 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 08:10:25,165 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 08:10:25,166 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 08:10:25,167 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 08:10:25,169 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 08:10:25,169 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 08:10:25,169 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 08:10:25,171 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 08:10:25,172 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 08:10:25,174 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 08:10:25,174 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 08:10:25,175 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 08:10:25,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 08:10:25,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 08:10:25,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 08:10:25,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 08:10:25,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 08:10:25,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 08:10:25,179 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 08:10:25,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 08:10:25,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 08:10:25,182 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 08:10:25,216 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 08:10:25,217 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 08:10:25,220 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 08:10:25,220 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 08:10:25,221 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 08:10:25,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 08:10:25,221 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 08:10:25,221 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 08:10:25,221 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 08:10:25,222 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 08:10:25,222 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 08:10:25,222 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 08:10:25,222 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 08:10:25,222 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 08:10:25,223 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 08:10:25,223 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 08:10:25,223 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 08:10:25,223 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 08:10:25,223 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 08:10:25,223 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 08:10:25,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 08:10:25,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:10:25,225 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 08:10:25,225 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 08:10:25,226 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 08:10:25,226 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 08:10:25,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 08:10:25,226 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 08:10:25,226 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 08:10:25,226 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 08:10:25,515 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 08:10:25,537 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 08:10:25,541 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 08:10:25,542 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 08:10:25,543 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 08:10:25,544 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_rmo.oepc.i [2019-12-27 08:10:25,619 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec03654e3/8ba7da6e22284f3c8e6d12447dd76c13/FLAG4761f786f [2019-12-27 08:10:26,203 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 08:10:26,204 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_rmo.oepc.i [2019-12-27 08:10:26,227 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec03654e3/8ba7da6e22284f3c8e6d12447dd76c13/FLAG4761f786f [2019-12-27 08:10:26,516 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec03654e3/8ba7da6e22284f3c8e6d12447dd76c13 [2019-12-27 08:10:26,524 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 08:10:26,526 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 08:10:26,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 08:10:26,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 08:10:26,531 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 08:10:26,533 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:10:26" (1/1) ... [2019-12-27 08:10:26,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60f84663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:26, skipping insertion in model container [2019-12-27 08:10:26,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:10:26" (1/1) ... [2019-12-27 08:10:26,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 08:10:26,599 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 08:10:27,128 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:10:27,148 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 08:10:27,226 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:10:27,304 INFO L208 MainTranslator]: Completed translation [2019-12-27 08:10:27,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:27 WrapperNode [2019-12-27 08:10:27,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 08:10:27,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 08:10:27,305 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 08:10:27,305 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 08:10:27,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:27" (1/1) ... [2019-12-27 08:10:27,338 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:27" (1/1) ... [2019-12-27 08:10:27,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 08:10:27,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 08:10:27,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 08:10:27,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 08:10:27,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:27" (1/1) ... [2019-12-27 08:10:27,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:27" (1/1) ... [2019-12-27 08:10:27,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:27" (1/1) ... [2019-12-27 08:10:27,400 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:27" (1/1) ... [2019-12-27 08:10:27,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:27" (1/1) ... [2019-12-27 08:10:27,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:27" (1/1) ... [2019-12-27 08:10:27,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:27" (1/1) ... [2019-12-27 08:10:27,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 08:10:27,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 08:10:27,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 08:10:27,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 08:10:27,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:10:27,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 08:10:27,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 08:10:27,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 08:10:27,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 08:10:27,494 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 08:10:27,495 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 08:10:27,495 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 08:10:27,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 08:10:27,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 08:10:27,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 08:10:27,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 08:10:27,499 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 08:10:28,196 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 08:10:28,197 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 08:10:28,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:10:28 BoogieIcfgContainer [2019-12-27 08:10:28,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 08:10:28,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 08:10:28,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 08:10:28,202 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 08:10:28,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:10:26" (1/3) ... [2019-12-27 08:10:28,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37674438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:10:28, skipping insertion in model container [2019-12-27 08:10:28,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:10:27" (2/3) ... [2019-12-27 08:10:28,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37674438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:10:28, skipping insertion in model container [2019-12-27 08:10:28,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:10:28" (3/3) ... [2019-12-27 08:10:28,206 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_rmo.oepc.i [2019-12-27 08:10:28,217 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 08:10:28,218 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 08:10:28,226 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 08:10:28,227 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 08:10:28,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,264 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,265 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,294 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,295 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,295 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,296 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,296 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,317 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,317 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,317 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,330 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,331 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:10:28,352 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 08:10:28,376 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:10:28,377 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:10:28,377 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:10:28,377 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:10:28,377 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:10:28,377 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:10:28,378 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:10:28,378 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:10:28,416 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 162 transitions [2019-12-27 08:10:28,418 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-27 08:10:28,518 INFO L132 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-27 08:10:28,519 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 08:10:28,535 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 343 event pairs. 0/123 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 08:10:28,547 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-27 08:10:28,622 INFO L132 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-27 08:10:28,622 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 08:10:28,630 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 343 event pairs. 0/123 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 08:10:28,643 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-27 08:10:28,644 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 08:10:31,219 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-12-27 08:10:31,642 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 08:10:31,822 INFO L206 etLargeBlockEncoding]: Checked pairs total: 42110 [2019-12-27 08:10:31,822 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 08:10:31,825 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 79 transitions [2019-12-27 08:10:32,178 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6782 states. [2019-12-27 08:10:32,181 INFO L276 IsEmpty]: Start isEmpty. Operand 6782 states. [2019-12-27 08:10:32,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 08:10:32,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:32,188 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 08:10:32,190 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:32,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:32,198 INFO L82 PathProgramCache]: Analyzing trace with hash 670284731, now seen corresponding path program 1 times [2019-12-27 08:10:32,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:32,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624425125] [2019-12-27 08:10:32,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:32,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:10:32,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624425125] [2019-12-27 08:10:32,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:32,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 08:10:32,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728209639] [2019-12-27 08:10:32,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:10:32,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:32,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:10:32,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:10:32,481 INFO L87 Difference]: Start difference. First operand 6782 states. Second operand 3 states. [2019-12-27 08:10:32,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:32,739 INFO L93 Difference]: Finished difference Result 6240 states and 21110 transitions. [2019-12-27 08:10:32,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:10:32,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 08:10:32,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:32,824 INFO L225 Difference]: With dead ends: 6240 [2019-12-27 08:10:32,824 INFO L226 Difference]: Without dead ends: 5850 [2019-12-27 08:10:32,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:10:32,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5850 states. [2019-12-27 08:10:33,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5850 to 5850. [2019-12-27 08:10:33,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5850 states. [2019-12-27 08:10:33,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 19754 transitions. [2019-12-27 08:10:33,256 INFO L78 Accepts]: Start accepts. Automaton has 5850 states and 19754 transitions. Word has length 5 [2019-12-27 08:10:33,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:10:33,257 INFO L462 AbstractCegarLoop]: Abstraction has 5850 states and 19754 transitions. [2019-12-27 08:10:33,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:10:33,258 INFO L276 IsEmpty]: Start isEmpty. Operand 5850 states and 19754 transitions. [2019-12-27 08:10:33,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 08:10:33,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:33,266 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:10:33,267 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:33,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:33,271 INFO L82 PathProgramCache]: Analyzing trace with hash 509733655, now seen corresponding path program 1 times [2019-12-27 08:10:33,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:33,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237058033] [2019-12-27 08:10:33,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:33,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:10:33,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237058033] [2019-12-27 08:10:33,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:33,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:10:33,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959109358] [2019-12-27 08:10:33,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:10:33,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:33,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:10:33,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:10:33,382 INFO L87 Difference]: Start difference. First operand 5850 states and 19754 transitions. Second operand 3 states. [2019-12-27 08:10:33,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:33,423 INFO L93 Difference]: Finished difference Result 1185 states and 2948 transitions. [2019-12-27 08:10:33,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:10:33,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 08:10:33,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:33,431 INFO L225 Difference]: With dead ends: 1185 [2019-12-27 08:10:33,431 INFO L226 Difference]: Without dead ends: 1185 [2019-12-27 08:10:33,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:10:33,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-12-27 08:10:33,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1185. [2019-12-27 08:10:33,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-12-27 08:10:33,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 2948 transitions. [2019-12-27 08:10:33,464 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 2948 transitions. Word has length 11 [2019-12-27 08:10:33,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:10:33,465 INFO L462 AbstractCegarLoop]: Abstraction has 1185 states and 2948 transitions. [2019-12-27 08:10:33,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:10:33,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 2948 transitions. [2019-12-27 08:10:33,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 08:10:33,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:33,471 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:10:33,471 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:33,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:33,472 INFO L82 PathProgramCache]: Analyzing trace with hash 310188947, now seen corresponding path program 1 times [2019-12-27 08:10:33,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:33,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584253494] [2019-12-27 08:10:33,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:10:33,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584253494] [2019-12-27 08:10:33,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:33,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:10:33,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589211570] [2019-12-27 08:10:33,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:10:33,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:33,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:10:33,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:10:33,615 INFO L87 Difference]: Start difference. First operand 1185 states and 2948 transitions. Second operand 3 states. [2019-12-27 08:10:33,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:33,717 INFO L93 Difference]: Finished difference Result 1756 states and 4318 transitions. [2019-12-27 08:10:33,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:10:33,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 08:10:33,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:33,728 INFO L225 Difference]: With dead ends: 1756 [2019-12-27 08:10:33,728 INFO L226 Difference]: Without dead ends: 1756 [2019-12-27 08:10:33,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:10:33,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2019-12-27 08:10:33,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1300. [2019-12-27 08:10:33,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2019-12-27 08:10:33,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 3182 transitions. [2019-12-27 08:10:33,779 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 3182 transitions. Word has length 14 [2019-12-27 08:10:33,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:10:33,779 INFO L462 AbstractCegarLoop]: Abstraction has 1300 states and 3182 transitions. [2019-12-27 08:10:33,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:10:33,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 3182 transitions. [2019-12-27 08:10:33,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 08:10:33,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:33,781 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:10:33,781 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:33,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:33,782 INFO L82 PathProgramCache]: Analyzing trace with hash 306457384, now seen corresponding path program 1 times [2019-12-27 08:10:33,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:33,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809349310] [2019-12-27 08:10:33,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:33,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:10:33,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809349310] [2019-12-27 08:10:33,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:33,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:10:33,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010423374] [2019-12-27 08:10:33,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:10:33,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:33,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:10:33,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:10:33,879 INFO L87 Difference]: Start difference. First operand 1300 states and 3182 transitions. Second operand 4 states. [2019-12-27 08:10:34,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:34,042 INFO L93 Difference]: Finished difference Result 1703 states and 4071 transitions. [2019-12-27 08:10:34,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:10:34,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 08:10:34,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:34,054 INFO L225 Difference]: With dead ends: 1703 [2019-12-27 08:10:34,054 INFO L226 Difference]: Without dead ends: 1703 [2019-12-27 08:10:34,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:10:34,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-12-27 08:10:34,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1513. [2019-12-27 08:10:34,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2019-12-27 08:10:34,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 3661 transitions. [2019-12-27 08:10:34,100 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 3661 transitions. Word has length 14 [2019-12-27 08:10:34,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:10:34,100 INFO L462 AbstractCegarLoop]: Abstraction has 1513 states and 3661 transitions. [2019-12-27 08:10:34,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:10:34,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 3661 transitions. [2019-12-27 08:10:34,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 08:10:34,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:34,102 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:10:34,102 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:34,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:34,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1161574652, now seen corresponding path program 1 times [2019-12-27 08:10:34,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:34,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878095826] [2019-12-27 08:10:34,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:34,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:10:34,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878095826] [2019-12-27 08:10:34,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:34,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:10:34,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234102164] [2019-12-27 08:10:34,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:10:34,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:34,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:10:34,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:10:34,211 INFO L87 Difference]: Start difference. First operand 1513 states and 3661 transitions. Second operand 4 states. [2019-12-27 08:10:34,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:34,437 INFO L93 Difference]: Finished difference Result 1972 states and 4699 transitions. [2019-12-27 08:10:34,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:10:34,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 08:10:34,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:34,449 INFO L225 Difference]: With dead ends: 1972 [2019-12-27 08:10:34,449 INFO L226 Difference]: Without dead ends: 1972 [2019-12-27 08:10:34,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:10:34,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2019-12-27 08:10:34,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1607. [2019-12-27 08:10:34,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2019-12-27 08:10:34,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 3887 transitions. [2019-12-27 08:10:34,491 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 3887 transitions. Word has length 14 [2019-12-27 08:10:34,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:10:34,492 INFO L462 AbstractCegarLoop]: Abstraction has 1607 states and 3887 transitions. [2019-12-27 08:10:34,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:10:34,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 3887 transitions. [2019-12-27 08:10:34,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 08:10:34,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:34,495 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:10:34,495 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:34,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:34,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1039744201, now seen corresponding path program 1 times [2019-12-27 08:10:34,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:34,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826811445] [2019-12-27 08:10:34,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:34,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:10:34,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826811445] [2019-12-27 08:10:34,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:34,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:10:34,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31381766] [2019-12-27 08:10:34,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:10:34,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:34,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:10:34,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:10:34,538 INFO L87 Difference]: Start difference. First operand 1607 states and 3887 transitions. Second operand 4 states. [2019-12-27 08:10:34,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:34,558 INFO L93 Difference]: Finished difference Result 772 states and 1728 transitions. [2019-12-27 08:10:34,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 08:10:34,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-27 08:10:34,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:34,563 INFO L225 Difference]: With dead ends: 772 [2019-12-27 08:10:34,563 INFO L226 Difference]: Without dead ends: 772 [2019-12-27 08:10:34,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:10:34,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-12-27 08:10:34,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 722. [2019-12-27 08:10:34,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-12-27 08:10:34,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1628 transitions. [2019-12-27 08:10:34,580 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1628 transitions. Word has length 26 [2019-12-27 08:10:34,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:10:34,580 INFO L462 AbstractCegarLoop]: Abstraction has 722 states and 1628 transitions. [2019-12-27 08:10:34,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:10:34,581 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1628 transitions. [2019-12-27 08:10:34,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 08:10:34,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:34,583 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:10:34,583 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:34,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:34,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1200421068, now seen corresponding path program 1 times [2019-12-27 08:10:34,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:34,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709984698] [2019-12-27 08:10:34,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:34,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:10:34,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709984698] [2019-12-27 08:10:34,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:34,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:10:34,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519273600] [2019-12-27 08:10:34,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:10:34,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:34,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:10:34,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:10:34,673 INFO L87 Difference]: Start difference. First operand 722 states and 1628 transitions. Second operand 3 states. [2019-12-27 08:10:34,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:34,689 INFO L93 Difference]: Finished difference Result 1140 states and 2599 transitions. [2019-12-27 08:10:34,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:10:34,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 08:10:34,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:34,695 INFO L225 Difference]: With dead ends: 1140 [2019-12-27 08:10:34,695 INFO L226 Difference]: Without dead ends: 438 [2019-12-27 08:10:34,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:10:34,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-12-27 08:10:34,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2019-12-27 08:10:34,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-12-27 08:10:34,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1004 transitions. [2019-12-27 08:10:34,710 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1004 transitions. Word has length 41 [2019-12-27 08:10:34,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:10:34,710 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 1004 transitions. [2019-12-27 08:10:34,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:10:34,711 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1004 transitions. [2019-12-27 08:10:34,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 08:10:34,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:34,715 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:10:34,715 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:34,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:34,715 INFO L82 PathProgramCache]: Analyzing trace with hash -647816914, now seen corresponding path program 2 times [2019-12-27 08:10:34,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:34,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53822637] [2019-12-27 08:10:34,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:34,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:10:34,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53822637] [2019-12-27 08:10:34,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:34,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:10:34,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138068782] [2019-12-27 08:10:34,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:10:34,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:34,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:10:34,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:10:34,830 INFO L87 Difference]: Start difference. First operand 438 states and 1004 transitions. Second operand 6 states. [2019-12-27 08:10:34,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:34,976 INFO L93 Difference]: Finished difference Result 797 states and 1782 transitions. [2019-12-27 08:10:34,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 08:10:34,977 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 08:10:34,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:34,980 INFO L225 Difference]: With dead ends: 797 [2019-12-27 08:10:34,980 INFO L226 Difference]: Without dead ends: 535 [2019-12-27 08:10:34,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:10:34,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-12-27 08:10:34,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 461. [2019-12-27 08:10:34,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-12-27 08:10:34,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1034 transitions. [2019-12-27 08:10:34,992 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 1034 transitions. Word has length 41 [2019-12-27 08:10:34,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:10:34,994 INFO L462 AbstractCegarLoop]: Abstraction has 461 states and 1034 transitions. [2019-12-27 08:10:34,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:10:34,994 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 1034 transitions. [2019-12-27 08:10:34,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 08:10:34,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:34,996 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:10:34,996 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:34,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:34,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1820287444, now seen corresponding path program 3 times [2019-12-27 08:10:34,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:34,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669114766] [2019-12-27 08:10:34,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:35,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:10:35,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669114766] [2019-12-27 08:10:35,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:35,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 08:10:35,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41731468] [2019-12-27 08:10:35,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 08:10:35,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:35,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 08:10:35,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:10:35,144 INFO L87 Difference]: Start difference. First operand 461 states and 1034 transitions. Second operand 7 states. [2019-12-27 08:10:35,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:35,596 INFO L93 Difference]: Finished difference Result 705 states and 1447 transitions. [2019-12-27 08:10:35,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 08:10:35,597 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 08:10:35,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:35,601 INFO L225 Difference]: With dead ends: 705 [2019-12-27 08:10:35,602 INFO L226 Difference]: Without dead ends: 705 [2019-12-27 08:10:35,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-27 08:10:35,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-12-27 08:10:35,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 582. [2019-12-27 08:10:35,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-12-27 08:10:35,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 1226 transitions. [2019-12-27 08:10:35,618 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 1226 transitions. Word has length 41 [2019-12-27 08:10:35,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:10:35,618 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 1226 transitions. [2019-12-27 08:10:35,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 08:10:35,618 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 1226 transitions. [2019-12-27 08:10:35,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 08:10:35,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:35,620 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:10:35,620 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:35,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:35,621 INFO L82 PathProgramCache]: Analyzing trace with hash 670576248, now seen corresponding path program 1 times [2019-12-27 08:10:35,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:35,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399057050] [2019-12-27 08:10:35,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:35,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:10:35,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399057050] [2019-12-27 08:10:35,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:35,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:10:35,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121084543] [2019-12-27 08:10:35,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:10:35,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:35,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:10:35,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:10:35,670 INFO L87 Difference]: Start difference. First operand 582 states and 1226 transitions. Second operand 3 states. [2019-12-27 08:10:35,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:35,709 INFO L93 Difference]: Finished difference Result 653 states and 1281 transitions. [2019-12-27 08:10:35,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:10:35,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 08:10:35,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:35,714 INFO L225 Difference]: With dead ends: 653 [2019-12-27 08:10:35,714 INFO L226 Difference]: Without dead ends: 653 [2019-12-27 08:10:35,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:10:35,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-12-27 08:10:35,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 575. [2019-12-27 08:10:35,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-12-27 08:10:35,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1142 transitions. [2019-12-27 08:10:35,758 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1142 transitions. Word has length 41 [2019-12-27 08:10:35,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:10:35,758 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1142 transitions. [2019-12-27 08:10:35,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:10:35,758 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1142 transitions. [2019-12-27 08:10:35,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 08:10:35,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:35,760 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:10:35,760 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:35,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:35,761 INFO L82 PathProgramCache]: Analyzing trace with hash -560460464, now seen corresponding path program 4 times [2019-12-27 08:10:35,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:35,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065495915] [2019-12-27 08:10:35,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:35,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:10:35,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065495915] [2019-12-27 08:10:35,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:35,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 08:10:35,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101512169] [2019-12-27 08:10:35,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 08:10:35,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:35,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 08:10:35,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 08:10:35,884 INFO L87 Difference]: Start difference. First operand 575 states and 1142 transitions. Second operand 9 states. [2019-12-27 08:10:36,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:36,629 INFO L93 Difference]: Finished difference Result 1278 states and 2500 transitions. [2019-12-27 08:10:36,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 08:10:36,630 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-12-27 08:10:36,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:36,636 INFO L225 Difference]: With dead ends: 1278 [2019-12-27 08:10:36,636 INFO L226 Difference]: Without dead ends: 1042 [2019-12-27 08:10:36,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-27 08:10:36,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2019-12-27 08:10:36,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 575. [2019-12-27 08:10:36,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-12-27 08:10:36,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1135 transitions. [2019-12-27 08:10:36,653 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1135 transitions. Word has length 41 [2019-12-27 08:10:36,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:10:36,654 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1135 transitions. [2019-12-27 08:10:36,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 08:10:36,654 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1135 transitions. [2019-12-27 08:10:36,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 08:10:36,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:36,656 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:10:36,656 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:36,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:36,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1278508734, now seen corresponding path program 5 times [2019-12-27 08:10:36,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:36,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629513735] [2019-12-27 08:10:36,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:10:36,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629513735] [2019-12-27 08:10:36,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:36,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 08:10:36,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695575537] [2019-12-27 08:10:36,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:10:36,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:36,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:10:36,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:10:36,738 INFO L87 Difference]: Start difference. First operand 575 states and 1135 transitions. Second operand 6 states. [2019-12-27 08:10:37,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:37,178 INFO L93 Difference]: Finished difference Result 822 states and 1604 transitions. [2019-12-27 08:10:37,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 08:10:37,178 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 08:10:37,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:37,183 INFO L225 Difference]: With dead ends: 822 [2019-12-27 08:10:37,184 INFO L226 Difference]: Without dead ends: 822 [2019-12-27 08:10:37,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 08:10:37,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2019-12-27 08:10:37,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 599. [2019-12-27 08:10:37,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-12-27 08:10:37,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1188 transitions. [2019-12-27 08:10:37,198 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1188 transitions. Word has length 41 [2019-12-27 08:10:37,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:10:37,198 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 1188 transitions. [2019-12-27 08:10:37,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:10:37,198 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1188 transitions. [2019-12-27 08:10:37,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 08:10:37,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:37,200 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:10:37,200 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:37,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:37,201 INFO L82 PathProgramCache]: Analyzing trace with hash 297826318, now seen corresponding path program 6 times [2019-12-27 08:10:37,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:37,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993483364] [2019-12-27 08:10:37,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:10:37,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:10:37,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993483364] [2019-12-27 08:10:37,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:10:37,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:10:37,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237475931] [2019-12-27 08:10:37,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:10:37,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:10:37,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:10:37,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:10:37,259 INFO L87 Difference]: Start difference. First operand 599 states and 1188 transitions. Second operand 3 states. [2019-12-27 08:10:37,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:10:37,288 INFO L93 Difference]: Finished difference Result 599 states and 1186 transitions. [2019-12-27 08:10:37,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:10:37,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 08:10:37,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:10:37,291 INFO L225 Difference]: With dead ends: 599 [2019-12-27 08:10:37,291 INFO L226 Difference]: Without dead ends: 599 [2019-12-27 08:10:37,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:10:37,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-12-27 08:10:37,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 507. [2019-12-27 08:10:37,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-12-27 08:10:37,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 1013 transitions. [2019-12-27 08:10:37,307 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 1013 transitions. Word has length 41 [2019-12-27 08:10:37,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:10:37,307 INFO L462 AbstractCegarLoop]: Abstraction has 507 states and 1013 transitions. [2019-12-27 08:10:37,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:10:37,308 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 1013 transitions. [2019-12-27 08:10:37,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 08:10:37,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:10:37,309 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:10:37,310 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:10:37,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:10:37,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1362148945, now seen corresponding path program 1 times [2019-12-27 08:10:37,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:10:37,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722168556] [2019-12-27 08:10:37,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:10:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:10:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:10:37,433 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 08:10:37,433 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 08:10:37,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] ULTIMATE.startENTRY-->L790: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~x$w_buff0_used~0_94) (= 0 v_~x$w_buff1~0_24) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= v_~x$r_buff1_thd2~0_17 0) (= 0 v_~x$r_buff0_thd2~0_24) (= 0 v_~__unbuffered_p0_EAX~0_15) (= |v_#NULL.offset_6| 0) (= v_~x$r_buff1_thd0~0_22 0) (= 0 v_~x$w_buff0~0_24) (= (select .cse0 |v_ULTIMATE.start_main_~#t2569~0.base_20|) 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2569~0.base_20| 4)) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~y~0_16 0) (= v_~x$r_buff1_thd1~0_39 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2569~0.base_20| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2569~0.base_20|) |v_ULTIMATE.start_main_~#t2569~0.offset_16| 0)) |v_#memory_int_11|) (= v_~x$w_buff1_used~0_56 0) (= 0 v_~x$r_buff0_thd0~0_18) (= v_~x$mem_tmp~0_8 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~x$read_delayed~0_7) (= v_~x$flush_delayed~0_12 0) (= v_~x~0_20 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2569~0.base_20|) (= 0 v_~x$r_buff0_thd1~0_66) (= v_~main$tmp_guard1~0_14 0) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t2569~0.base_20| 1)) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_cnt~0_16) (< 0 |v_#StackHeapBarrier_13|) (= 0 |v_ULTIMATE.start_main_~#t2569~0.offset_16|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_24, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_66, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_39, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~x$mem_tmp~0=v_~x$mem_tmp~0_8, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, #length=|v_#length_15|, ~y~0=v_~y~0_16, ULTIMATE.start_main_~#t2569~0.offset=|v_ULTIMATE.start_main_~#t2569~0.offset_16|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_18, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_19|, ~x$w_buff1~0=v_~x$w_buff1~0_24, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_9|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_56, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_9|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_9|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_22, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ULTIMATE.start_main_~#t2570~0.offset=|v_ULTIMATE.start_main_~#t2570~0.offset_16|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t2569~0.base=|v_ULTIMATE.start_main_~#t2569~0.base_20|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x~0=v_~x~0_20, ULTIMATE.start_main_~#t2570~0.base=|v_ULTIMATE.start_main_~#t2570~0.base_21|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t2569~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2570~0.offset, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2569~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t2570~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 08:10:37,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L790-1-->L792: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2570~0.base_11| 4) |v_#length_9|) (not (= |v_ULTIMATE.start_main_~#t2570~0.base_11| 0)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2570~0.base_11|)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2570~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t2570~0.offset_9| 0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2570~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2570~0.base_11|) |v_ULTIMATE.start_main_~#t2570~0.offset_9| 1))) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2570~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2570~0.offset=|v_ULTIMATE.start_main_~#t2570~0.offset_9|, ULTIMATE.start_main_~#t2570~0.base=|v_ULTIMATE.start_main_~#t2570~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2570~0.offset, ULTIMATE.start_main_~#t2570~0.base] because there is no mapped edge [2019-12-27 08:10:37,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [571] [571] L5-->L767: Formula: (and (= v_~x$r_buff1_thd0~0_10 v_~x$r_buff0_thd0~0_14) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_6) (= 1 v_~x$r_buff0_thd2~0_15) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8)) (= v_~x$r_buff1_thd1~0_19 v_~x$r_buff0_thd1~0_35)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 08:10:37,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L733-->L733-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1638187275 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite8_In-1638187275| |P0Thread1of1ForFork1_#t~ite8_Out-1638187275|) (= |P0Thread1of1ForFork1_#t~ite9_Out-1638187275| ~x$w_buff0~0_In-1638187275)) (and (= |P0Thread1of1ForFork1_#t~ite9_Out-1638187275| |P0Thread1of1ForFork1_#t~ite8_Out-1638187275|) (= ~x$w_buff0~0_In-1638187275 |P0Thread1of1ForFork1_#t~ite8_Out-1638187275|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1638187275 256) 0))) (or (and (= (mod ~x$r_buff1_thd1~0_In-1638187275 256) 0) .cse1) (and .cse1 (= (mod ~x$w_buff1_used~0_In-1638187275 256) 0)) (= (mod ~x$w_buff0_used~0_In-1638187275 256) 0))) .cse0))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1638187275, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1638187275, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_In-1638187275|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1638187275, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1638187275, ~weak$$choice2~0=~weak$$choice2~0_In-1638187275, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1638187275} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1638187275, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1638187275, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1638187275|, P0Thread1of1ForFork1_#t~ite9=|P0Thread1of1ForFork1_#t~ite9_Out-1638187275|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1638187275, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1638187275, ~weak$$choice2~0=~weak$$choice2~0_In-1638187275, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1638187275} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 08:10:37,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L737-->L738: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_50)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_10|, ~weak$$choice2~0=v_~weak$$choice2~0_25} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 08:10:37,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L740-->L748: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_4 v_~x~0_14) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 08:10:37,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [626] [626] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In551370270 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In551370270 256)))) (or (and (= ~x$w_buff0_used~0_In551370270 |P1Thread1of1ForFork0_#t~ite28_Out551370270|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out551370270|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In551370270, ~x$w_buff0_used~0=~x$w_buff0_used~0_In551370270} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In551370270, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out551370270|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In551370270} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 08:10:37,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1520243903 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1520243903 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1520243903 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1520243903 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out-1520243903| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1520243903 |P1Thread1of1ForFork0_#t~ite29_Out-1520243903|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1520243903, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1520243903, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1520243903, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1520243903} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1520243903, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1520243903, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1520243903, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1520243903|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1520243903} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 08:10:37,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L770-->L771: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-201550851 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-201550851 256) 0))) (or (and (= 0 ~x$r_buff0_thd2~0_Out-201550851) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-201550851 ~x$r_buff0_thd2~0_Out-201550851)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-201550851, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-201550851} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-201550851|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-201550851, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-201550851} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 08:10:37,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L771-->L771-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-1923640996 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1923640996 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1923640996 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1923640996 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1923640996|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-1923640996 |P1Thread1of1ForFork0_#t~ite31_Out-1923640996|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1923640996, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1923640996, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1923640996, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1923640996} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1923640996|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1923640996, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1923640996, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1923640996, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1923640996} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 08:10:37,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L771-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 08:10:37,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [573] [573] L792-1-->L798: Formula: (and (= v_~main$tmp_guard0~0_4 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 08:10:37,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L798-2-->L798-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite35_Out-908826891| |ULTIMATE.start_main_#t~ite34_Out-908826891|)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-908826891 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-908826891 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= ~x$w_buff1~0_In-908826891 |ULTIMATE.start_main_#t~ite34_Out-908826891|)) (and .cse1 (or .cse2 .cse0) (= ~x~0_In-908826891 |ULTIMATE.start_main_#t~ite34_Out-908826891|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-908826891, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-908826891, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-908826891, ~x~0=~x~0_In-908826891} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-908826891, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-908826891|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-908826891, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-908826891, ~x~0=~x~0_In-908826891, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-908826891|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 08:10:37,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1483584297 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1483584297 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite36_Out1483584297|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite36_Out1483584297| ~x$w_buff0_used~0_In1483584297) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1483584297, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1483584297} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1483584297, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1483584297|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1483584297} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 08:10:37,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In921010314 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In921010314 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In921010314 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In921010314 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In921010314 |ULTIMATE.start_main_#t~ite37_Out921010314|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite37_Out921010314|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In921010314, ~x$w_buff1_used~0=~x$w_buff1_used~0_In921010314, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In921010314, ~x$w_buff0_used~0=~x$w_buff0_used~0_In921010314} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In921010314, ~x$w_buff1_used~0=~x$w_buff1_used~0_In921010314, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out921010314|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In921010314, ~x$w_buff0_used~0=~x$w_buff0_used~0_In921010314} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 08:10:37,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [632] [632] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In550106027 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In550106027 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out550106027| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out550106027| ~x$r_buff0_thd0~0_In550106027) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In550106027, ~x$w_buff0_used~0=~x$w_buff0_used~0_In550106027} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In550106027, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out550106027|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In550106027} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 08:10:37,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L802-->L802-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-2044882319 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-2044882319 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-2044882319 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-2044882319 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-2044882319| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-2044882319 |ULTIMATE.start_main_#t~ite39_Out-2044882319|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2044882319, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2044882319, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2044882319, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2044882319} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2044882319, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-2044882319|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2044882319, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2044882319, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2044882319} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 08:10:37,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L802-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_~__unbuffered_p0_EAX~0_9 0) (= v_~y~0_10 2) (= v_~main$tmp_guard1~0_8 0) (= v_~x$r_buff1_thd0~0_16 |v_ULTIMATE.start_main_#t~ite39_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ~y~0=v_~y~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 08:10:37,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:10:37 BasicIcfg [2019-12-27 08:10:37,533 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 08:10:37,537 INFO L168 Benchmark]: Toolchain (without parser) took 11008.54 ms. Allocated memory was 144.7 MB in the beginning and 389.0 MB in the end (delta: 244.3 MB). Free memory was 100.4 MB in the beginning and 305.4 MB in the end (delta: -205.0 MB). Peak memory consumption was 39.3 MB. Max. memory is 7.1 GB. [2019-12-27 08:10:37,538 INFO L168 Benchmark]: CDTParser took 1.71 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 08:10:37,538 INFO L168 Benchmark]: CACSL2BoogieTranslator took 777.87 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.2 MB in the beginning and 155.2 MB in the end (delta: -55.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-27 08:10:37,539 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.30 ms. Allocated memory is still 202.4 MB. Free memory was 155.2 MB in the beginning and 152.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 08:10:37,539 INFO L168 Benchmark]: Boogie Preprocessor took 34.09 ms. Allocated memory is still 202.4 MB. Free memory was 152.4 MB in the beginning and 150.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 08:10:37,543 INFO L168 Benchmark]: RCFGBuilder took 776.34 ms. Allocated memory is still 202.4 MB. Free memory was 150.4 MB in the beginning and 110.1 MB in the end (delta: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2019-12-27 08:10:37,544 INFO L168 Benchmark]: TraceAbstraction took 9333.27 ms. Allocated memory was 202.4 MB in the beginning and 389.0 MB in the end (delta: 186.6 MB). Free memory was 109.4 MB in the beginning and 305.4 MB in the end (delta: -196.0 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 08:10:37,553 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.71 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 777.87 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.2 MB in the beginning and 155.2 MB in the end (delta: -55.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 82.30 ms. Allocated memory is still 202.4 MB. Free memory was 155.2 MB in the beginning and 152.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.09 ms. Allocated memory is still 202.4 MB. Free memory was 152.4 MB in the beginning and 150.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 776.34 ms. Allocated memory is still 202.4 MB. Free memory was 150.4 MB in the beginning and 110.1 MB in the end (delta: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9333.27 ms. Allocated memory was 202.4 MB in the beginning and 389.0 MB in the end (delta: 186.6 MB). Free memory was 109.4 MB in the beginning and 305.4 MB in the end (delta: -196.0 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 134 ProgramPointsBefore, 67 ProgramPointsAfterwards, 162 TransitionsBefore, 79 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 19 ChoiceCompositions, 4002 VarBasedMoverChecksPositive, 149 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 42110 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L790] FCALL, FORK 0 pthread_create(&t2569, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] FCALL, FORK 0 pthread_create(&t2570, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)=5, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L734] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L735] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L738] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 128 locations, 2 error locations. Result: UNSAFE, OverallTime: 9.0s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1356 SDtfs, 1427 SDslu, 2251 SDs, 0 SdLazy, 1381 SolverSat, 116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6782occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 2118 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 358 ConstructedInterpolants, 0 QuantifiedInterpolants, 37528 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...