./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_463ce498-9f17-429d-a3a4-008cc3478d2c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_463ce498-9f17-429d-a3a4-008cc3478d2c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_463ce498-9f17-429d-a3a4-008cc3478d2c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_463ce498-9f17-429d-a3a4-008cc3478d2c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_463ce498-9f17-429d-a3a4-008cc3478d2c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_463ce498-9f17-429d-a3a4-008cc3478d2c/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ca871fcb394143f3e78707b860cbdb77f0f565b ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 13:09:45,952 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:09:45,954 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:09:45,961 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:09:45,961 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:09:45,962 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:09:45,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:09:45,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:09:45,966 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:09:45,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:09:45,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:09:45,967 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:09:45,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:09:45,968 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:09:45,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:09:45,970 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:09:45,970 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:09:45,971 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:09:45,972 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:09:45,974 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:09:45,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:09:45,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:09:45,976 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:09:45,977 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:09:45,978 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:09:45,978 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:09:45,979 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:09:45,979 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:09:45,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:09:45,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:09:45,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:09:45,980 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:09:45,981 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:09:45,981 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:09:45,982 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:09:45,982 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:09:45,982 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:09:45,983 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:09:45,983 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:09:45,983 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:09:45,984 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:09:45,984 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_463ce498-9f17-429d-a3a4-008cc3478d2c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 13:09:45,994 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:09:45,994 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:09:45,995 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:09:45,995 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:09:45,995 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:09:45,995 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:09:45,995 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:09:45,995 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:09:45,996 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:09:45,996 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:09:45,996 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:09:45,996 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:09:45,996 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:09:45,996 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:09:45,996 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:09:45,997 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:09:45,997 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:09:45,997 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:09:45,997 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:09:45,997 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:09:45,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:09:45,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:09:45,998 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:09:45,998 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:09:45,998 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:09:45,998 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:09:45,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:09:45,998 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:09:45,998 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:09:45,998 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_463ce498-9f17-429d-a3a4-008cc3478d2c/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ca871fcb394143f3e78707b860cbdb77f0f565b [2019-12-07 13:09:46,097 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:09:46,106 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:09:46,108 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:09:46,109 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:09:46,109 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:09:46,110 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_463ce498-9f17-429d-a3a4-008cc3478d2c/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix031_pso.oepc.i [2019-12-07 13:09:46,148 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_463ce498-9f17-429d-a3a4-008cc3478d2c/bin/uautomizer/data/c4e3be69a/2f8f5330f3a5441aa0247e5507e81a19/FLAG0e1e929da [2019-12-07 13:09:46,612 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:09:46,612 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_463ce498-9f17-429d-a3a4-008cc3478d2c/sv-benchmarks/c/pthread-wmm/mix031_pso.oepc.i [2019-12-07 13:09:46,623 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_463ce498-9f17-429d-a3a4-008cc3478d2c/bin/uautomizer/data/c4e3be69a/2f8f5330f3a5441aa0247e5507e81a19/FLAG0e1e929da [2019-12-07 13:09:47,128 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_463ce498-9f17-429d-a3a4-008cc3478d2c/bin/uautomizer/data/c4e3be69a/2f8f5330f3a5441aa0247e5507e81a19 [2019-12-07 13:09:47,130 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:09:47,131 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:09:47,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:09:47,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:09:47,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:09:47,134 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:09:47" (1/1) ... [2019-12-07 13:09:47,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a7eda1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:09:47, skipping insertion in model container [2019-12-07 13:09:47,136 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:09:47" (1/1) ... [2019-12-07 13:09:47,141 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:09:47,171 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:09:47,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:09:47,417 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:09:47,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:09:47,506 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:09:47,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:09:47 WrapperNode [2019-12-07 13:09:47,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:09:47,507 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:09:47,507 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:09:47,507 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:09:47,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:09:47" (1/1) ... [2019-12-07 13:09:47,525 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:09:47" (1/1) ... [2019-12-07 13:09:47,545 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:09:47,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:09:47,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:09:47,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:09:47,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:09:47" (1/1) ... [2019-12-07 13:09:47,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:09:47" (1/1) ... [2019-12-07 13:09:47,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:09:47" (1/1) ... [2019-12-07 13:09:47,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:09:47" (1/1) ... [2019-12-07 13:09:47,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:09:47" (1/1) ... [2019-12-07 13:09:47,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:09:47" (1/1) ... [2019-12-07 13:09:47,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:09:47" (1/1) ... [2019-12-07 13:09:47,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:09:47,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:09:47,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:09:47,572 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:09:47,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:09:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_463ce498-9f17-429d-a3a4-008cc3478d2c/bin/uautomizer/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-07 13:09:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:09:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:09:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:09:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:09:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:09:47,614 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:09:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:09:47,614 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:09:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:09:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:09:47,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:09:47,616 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 13:09:47,946 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:09:47,946 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:09:47,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:09:47 BoogieIcfgContainer [2019-12-07 13:09:47,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:09:47,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:09:47,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:09:47,949 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:09:47,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:09:47" (1/3) ... [2019-12-07 13:09:47,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d37ed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:09:47, skipping insertion in model container [2019-12-07 13:09:47,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:09:47" (2/3) ... [2019-12-07 13:09:47,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d37ed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:09:47, skipping insertion in model container [2019-12-07 13:09:47,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:09:47" (3/3) ... [2019-12-07 13:09:47,951 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_pso.oepc.i [2019-12-07 13:09:47,957 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:09:47,957 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:09:47,962 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:09:47,963 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:09:47,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,985 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,985 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,985 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,986 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,986 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,990 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,990 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:47,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:48,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:48,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:48,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:48,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:48,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:48,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:48,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:48,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:48,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:48,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:48,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:48,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:48,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:48,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:48,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:48,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:48,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:48,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:48,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:48,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:48,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:48,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:48,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:48,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:48,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:48,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:48,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:48,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:09:48,012 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 13:09:48,024 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:09:48,024 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:09:48,025 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:09:48,025 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:09:48,025 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:09:48,025 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:09:48,025 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:09:48,025 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:09:48,035 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 185 transitions [2019-12-07 13:09:48,036 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-07 13:09:48,085 INFO L134 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-07 13:09:48,085 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:09:48,094 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 575 event pairs. 6/146 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 13:09:48,105 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-07 13:09:48,131 INFO L134 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-07 13:09:48,131 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:09:48,135 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 575 event pairs. 6/146 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 13:09:48,145 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 13:09:48,146 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:09:51,051 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-07 13:09:51,140 INFO L206 etLargeBlockEncoding]: Checked pairs total: 55357 [2019-12-07 13:09:51,140 INFO L214 etLargeBlockEncoding]: Total number of compositions: 107 [2019-12-07 13:09:51,142 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 89 transitions [2019-12-07 13:09:51,457 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-07 13:09:51,459 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-07 13:09:51,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 13:09:51,463 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:51,463 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 13:09:51,463 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:51,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:51,467 INFO L82 PathProgramCache]: Analyzing trace with hash 801135, now seen corresponding path program 1 times [2019-12-07 13:09:51,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:09:51,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587280943] [2019-12-07 13:09:51,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:51,604 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-07 13:09:51,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587280943] [2019-12-07 13:09:51,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:51,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:09:51,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82970637] [2019-12-07 13:09:51,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:09:51,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:09:51,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:09:51,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:09:51,619 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-07 13:09:51,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:51,792 INFO L93 Difference]: Finished difference Result 8472 states and 28002 transitions. [2019-12-07 13:09:51,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:09:51,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 13:09:51,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:51,855 INFO L225 Difference]: With dead ends: 8472 [2019-12-07 13:09:51,855 INFO L226 Difference]: Without dead ends: 7980 [2019-12-07 13:09:51,856 INFO L630 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-07 13:09:51,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7980 states. [2019-12-07 13:09:52,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7980 to 7980. [2019-12-07 13:09:52,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7980 states. [2019-12-07 13:09:52,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7980 states to 7980 states and 26329 transitions. [2019-12-07 13:09:52,127 INFO L78 Accepts]: Start accepts. Automaton has 7980 states and 26329 transitions. Word has length 3 [2019-12-07 13:09:52,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:52,128 INFO L462 AbstractCegarLoop]: Abstraction has 7980 states and 26329 transitions. [2019-12-07 13:09:52,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:09:52,128 INFO L276 IsEmpty]: Start isEmpty. Operand 7980 states and 26329 transitions. [2019-12-07 13:09:52,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 13:09:52,130 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:52,130 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:09:52,130 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:52,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:52,131 INFO L82 PathProgramCache]: Analyzing trace with hash -337363797, now seen corresponding path program 1 times [2019-12-07 13:09:52,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:09:52,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754666273] [2019-12-07 13:09:52,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:52,177 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-07 13:09:52,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754666273] [2019-12-07 13:09:52,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:52,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:09:52,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858080301] [2019-12-07 13:09:52,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:09:52,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:09:52,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:09:52,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:09:52,180 INFO L87 Difference]: Start difference. First operand 7980 states and 26329 transitions. Second operand 3 states. [2019-12-07 13:09:52,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:52,199 INFO L93 Difference]: Finished difference Result 1284 states and 2972 transitions. [2019-12-07 13:09:52,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:09:52,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 13:09:52,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:52,205 INFO L225 Difference]: With dead ends: 1284 [2019-12-07 13:09:52,206 INFO L226 Difference]: Without dead ends: 1284 [2019-12-07 13:09:52,206 INFO L630 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-07 13:09:52,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2019-12-07 13:09:52,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1284. [2019-12-07 13:09:52,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2019-12-07 13:09:52,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 2972 transitions. [2019-12-07 13:09:52,228 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 2972 transitions. Word has length 11 [2019-12-07 13:09:52,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:52,228 INFO L462 AbstractCegarLoop]: Abstraction has 1284 states and 2972 transitions. [2019-12-07 13:09:52,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:09:52,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 2972 transitions. [2019-12-07 13:09:52,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 13:09:52,229 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:52,230 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:09:52,230 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:52,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:52,230 INFO L82 PathProgramCache]: Analyzing trace with hash 254708639, now seen corresponding path program 1 times [2019-12-07 13:09:52,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:09:52,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673238399] [2019-12-07 13:09:52,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:52,269 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-07 13:09:52,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673238399] [2019-12-07 13:09:52,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:52,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:09:52,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89045042] [2019-12-07 13:09:52,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:09:52,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:09:52,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:09:52,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:09:52,270 INFO L87 Difference]: Start difference. First operand 1284 states and 2972 transitions. Second operand 3 states. [2019-12-07 13:09:52,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:52,321 INFO L93 Difference]: Finished difference Result 1993 states and 4593 transitions. [2019-12-07 13:09:52,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:09:52,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 13:09:52,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:52,330 INFO L225 Difference]: With dead ends: 1993 [2019-12-07 13:09:52,330 INFO L226 Difference]: Without dead ends: 1993 [2019-12-07 13:09:52,330 INFO L630 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-07 13:09:52,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2019-12-07 13:09:52,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1444. [2019-12-07 13:09:52,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1444 states. [2019-12-07 13:09:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 3429 transitions. [2019-12-07 13:09:52,360 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 3429 transitions. Word has length 14 [2019-12-07 13:09:52,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:52,360 INFO L462 AbstractCegarLoop]: Abstraction has 1444 states and 3429 transitions. [2019-12-07 13:09:52,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:09:52,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 3429 transitions. [2019-12-07 13:09:52,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 13:09:52,361 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:52,361 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:09:52,361 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:52,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:52,362 INFO L82 PathProgramCache]: Analyzing trace with hash 254810970, now seen corresponding path program 1 times [2019-12-07 13:09:52,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:09:52,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619619706] [2019-12-07 13:09:52,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:52,444 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-07 13:09:52,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619619706] [2019-12-07 13:09:52,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:52,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:09:52,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281640214] [2019-12-07 13:09:52,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:09:52,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:09:52,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:09:52,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:09:52,446 INFO L87 Difference]: Start difference. First operand 1444 states and 3429 transitions. Second operand 4 states. [2019-12-07 13:09:52,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:52,589 INFO L93 Difference]: Finished difference Result 1803 states and 4159 transitions. [2019-12-07 13:09:52,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:09:52,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 13:09:52,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:52,601 INFO L225 Difference]: With dead ends: 1803 [2019-12-07 13:09:52,601 INFO L226 Difference]: Without dead ends: 1803 [2019-12-07 13:09:52,602 INFO L630 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-07 13:09:52,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2019-12-07 13:09:52,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1739. [2019-12-07 13:09:52,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1739 states. [2019-12-07 13:09:52,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 4035 transitions. [2019-12-07 13:09:52,634 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 4035 transitions. Word has length 14 [2019-12-07 13:09:52,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:52,634 INFO L462 AbstractCegarLoop]: Abstraction has 1739 states and 4035 transitions. [2019-12-07 13:09:52,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:09:52,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 4035 transitions. [2019-12-07 13:09:52,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 13:09:52,635 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:52,635 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:09:52,635 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:52,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:52,636 INFO L82 PathProgramCache]: Analyzing trace with hash 32652836, now seen corresponding path program 1 times [2019-12-07 13:09:52,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:09:52,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678448675] [2019-12-07 13:09:52,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:52,672 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-07 13:09:52,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678448675] [2019-12-07 13:09:52,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:52,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:09:52,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618136873] [2019-12-07 13:09:52,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:09:52,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:09:52,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:09:52,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:09:52,673 INFO L87 Difference]: Start difference. First operand 1739 states and 4035 transitions. Second operand 4 states. [2019-12-07 13:09:52,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:52,797 INFO L93 Difference]: Finished difference Result 2116 states and 4835 transitions. [2019-12-07 13:09:52,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:09:52,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 13:09:52,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:52,808 INFO L225 Difference]: With dead ends: 2116 [2019-12-07 13:09:52,808 INFO L226 Difference]: Without dead ends: 2116 [2019-12-07 13:09:52,809 INFO L630 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-07 13:09:52,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2019-12-07 13:09:52,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 1856. [2019-12-07 13:09:52,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1856 states. [2019-12-07 13:09:52,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 4299 transitions. [2019-12-07 13:09:52,848 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 4299 transitions. Word has length 14 [2019-12-07 13:09:52,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:52,848 INFO L462 AbstractCegarLoop]: Abstraction has 1856 states and 4299 transitions. [2019-12-07 13:09:52,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:09:52,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 4299 transitions. [2019-12-07 13:09:52,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 13:09:52,850 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:52,850 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:09:52,850 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:52,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:52,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1595600556, now seen corresponding path program 1 times [2019-12-07 13:09:52,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:09:52,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724680577] [2019-12-07 13:09:52,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:52,923 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-07 13:09:52,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724680577] [2019-12-07 13:09:52,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:52,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:09:52,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608951279] [2019-12-07 13:09:52,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:09:52,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:09:52,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:09:52,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:09:52,924 INFO L87 Difference]: Start difference. First operand 1856 states and 4299 transitions. Second operand 5 states. [2019-12-07 13:09:53,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:53,079 INFO L93 Difference]: Finished difference Result 2383 states and 5349 transitions. [2019-12-07 13:09:53,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:09:53,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 13:09:53,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:53,089 INFO L225 Difference]: With dead ends: 2383 [2019-12-07 13:09:53,089 INFO L226 Difference]: Without dead ends: 2383 [2019-12-07 13:09:53,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:09:53,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2019-12-07 13:09:53,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2127. [2019-12-07 13:09:53,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2127 states. [2019-12-07 13:09:53,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 4855 transitions. [2019-12-07 13:09:53,120 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 4855 transitions. Word has length 25 [2019-12-07 13:09:53,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:53,120 INFO L462 AbstractCegarLoop]: Abstraction has 2127 states and 4855 transitions. [2019-12-07 13:09:53,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:09:53,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 4855 transitions. [2019-12-07 13:09:53,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 13:09:53,122 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:53,122 INFO L410 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-07 13:09:53,122 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:53,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:53,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1878239565, now seen corresponding path program 1 times [2019-12-07 13:09:53,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:09:53,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525052621] [2019-12-07 13:09:53,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:53,172 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-07 13:09:53,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525052621] [2019-12-07 13:09:53,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:53,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:09:53,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050205520] [2019-12-07 13:09:53,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:09:53,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:09:53,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:09:53,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:09:53,174 INFO L87 Difference]: Start difference. First operand 2127 states and 4855 transitions. Second operand 5 states. [2019-12-07 13:09:53,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:53,481 INFO L93 Difference]: Finished difference Result 3026 states and 6768 transitions. [2019-12-07 13:09:53,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:09:53,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 13:09:53,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:53,486 INFO L225 Difference]: With dead ends: 3026 [2019-12-07 13:09:53,486 INFO L226 Difference]: Without dead ends: 3026 [2019-12-07 13:09:53,486 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:09:53,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3026 states. [2019-12-07 13:09:53,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3026 to 2608. [2019-12-07 13:09:53,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2608 states. [2019-12-07 13:09:53,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2608 states and 5926 transitions. [2019-12-07 13:09:53,521 INFO L78 Accepts]: Start accepts. Automaton has 2608 states and 5926 transitions. Word has length 26 [2019-12-07 13:09:53,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:53,521 INFO L462 AbstractCegarLoop]: Abstraction has 2608 states and 5926 transitions. [2019-12-07 13:09:53,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:09:53,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 5926 transitions. [2019-12-07 13:09:53,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 13:09:53,523 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:53,523 INFO L410 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-07 13:09:53,524 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:53,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:53,524 INFO L82 PathProgramCache]: Analyzing trace with hash 532711466, now seen corresponding path program 1 times [2019-12-07 13:09:53,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:09:53,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708820631] [2019-12-07 13:09:53,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:53,573 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-07 13:09:53,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708820631] [2019-12-07 13:09:53,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:53,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:09:53,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795048420] [2019-12-07 13:09:53,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:09:53,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:09:53,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:09:53,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:09:53,574 INFO L87 Difference]: Start difference. First operand 2608 states and 5926 transitions. Second operand 5 states. [2019-12-07 13:09:53,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:53,722 INFO L93 Difference]: Finished difference Result 3110 states and 6917 transitions. [2019-12-07 13:09:53,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:09:53,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 13:09:53,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:53,727 INFO L225 Difference]: With dead ends: 3110 [2019-12-07 13:09:53,727 INFO L226 Difference]: Without dead ends: 3110 [2019-12-07 13:09:53,727 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:09:53,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2019-12-07 13:09:53,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 2543. [2019-12-07 13:09:53,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2543 states. [2019-12-07 13:09:53,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2543 states and 5786 transitions. [2019-12-07 13:09:53,762 INFO L78 Accepts]: Start accepts. Automaton has 2543 states and 5786 transitions. Word has length 26 [2019-12-07 13:09:53,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:53,762 INFO L462 AbstractCegarLoop]: Abstraction has 2543 states and 5786 transitions. [2019-12-07 13:09:53,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:09:53,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 5786 transitions. [2019-12-07 13:09:53,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 13:09:53,765 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:53,765 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:09:53,765 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:53,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:53,766 INFO L82 PathProgramCache]: Analyzing trace with hash 898927989, now seen corresponding path program 1 times [2019-12-07 13:09:53,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:09:53,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073154710] [2019-12-07 13:09:53,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:53,803 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-07 13:09:53,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073154710] [2019-12-07 13:09:53,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:53,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:09:53,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306726425] [2019-12-07 13:09:53,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:09:53,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:09:53,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:09:53,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:09:53,804 INFO L87 Difference]: Start difference. First operand 2543 states and 5786 transitions. Second operand 4 states. [2019-12-07 13:09:53,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:53,817 INFO L93 Difference]: Finished difference Result 1421 states and 3096 transitions. [2019-12-07 13:09:53,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:09:53,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 13:09:53,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:53,821 INFO L225 Difference]: With dead ends: 1421 [2019-12-07 13:09:53,821 INFO L226 Difference]: Without dead ends: 1421 [2019-12-07 13:09:53,821 INFO L630 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-07 13:09:53,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2019-12-07 13:09:53,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1326. [2019-12-07 13:09:53,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1326 states. [2019-12-07 13:09:53,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 2921 transitions. [2019-12-07 13:09:53,841 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 2921 transitions. Word has length 27 [2019-12-07 13:09:53,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:53,841 INFO L462 AbstractCegarLoop]: Abstraction has 1326 states and 2921 transitions. [2019-12-07 13:09:53,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:09:53,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 2921 transitions. [2019-12-07 13:09:53,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 13:09:53,844 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:53,844 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:09:53,844 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:53,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:53,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1928456464, now seen corresponding path program 1 times [2019-12-07 13:09:53,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:09:53,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416466879] [2019-12-07 13:09:53,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:53,915 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-07 13:09:53,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416466879] [2019-12-07 13:09:53,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:53,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:09:53,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303364556] [2019-12-07 13:09:53,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:09:53,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:09:53,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:09:53,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:09:53,917 INFO L87 Difference]: Start difference. First operand 1326 states and 2921 transitions. Second operand 6 states. [2019-12-07 13:09:54,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:54,289 INFO L93 Difference]: Finished difference Result 1733 states and 3717 transitions. [2019-12-07 13:09:54,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:09:54,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-07 13:09:54,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:54,292 INFO L225 Difference]: With dead ends: 1733 [2019-12-07 13:09:54,292 INFO L226 Difference]: Without dead ends: 1733 [2019-12-07 13:09:54,292 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:09:54,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2019-12-07 13:09:54,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1380. [2019-12-07 13:09:54,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1380 states. [2019-12-07 13:09:54,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 3033 transitions. [2019-12-07 13:09:54,312 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 3033 transitions. Word has length 51 [2019-12-07 13:09:54,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:54,313 INFO L462 AbstractCegarLoop]: Abstraction has 1380 states and 3033 transitions. [2019-12-07 13:09:54,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:09:54,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 3033 transitions. [2019-12-07 13:09:54,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 13:09:54,316 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:54,317 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:09:54,317 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:54,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:54,317 INFO L82 PathProgramCache]: Analyzing trace with hash -429236970, now seen corresponding path program 2 times [2019-12-07 13:09:54,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:09:54,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690699682] [2019-12-07 13:09:54,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:54,387 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-07 13:09:54,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690699682] [2019-12-07 13:09:54,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:54,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:09:54,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879586417] [2019-12-07 13:09:54,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:09:54,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:09:54,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:09:54,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:09:54,389 INFO L87 Difference]: Start difference. First operand 1380 states and 3033 transitions. Second operand 5 states. [2019-12-07 13:09:54,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:54,528 INFO L93 Difference]: Finished difference Result 1527 states and 3302 transitions. [2019-12-07 13:09:54,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:09:54,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-07 13:09:54,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:54,530 INFO L225 Difference]: With dead ends: 1527 [2019-12-07 13:09:54,530 INFO L226 Difference]: Without dead ends: 1527 [2019-12-07 13:09:54,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:09:54,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2019-12-07 13:09:54,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1384. [2019-12-07 13:09:54,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1384 states. [2019-12-07 13:09:54,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 3043 transitions. [2019-12-07 13:09:54,546 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 3043 transitions. Word has length 51 [2019-12-07 13:09:54,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:54,547 INFO L462 AbstractCegarLoop]: Abstraction has 1384 states and 3043 transitions. [2019-12-07 13:09:54,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:09:54,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 3043 transitions. [2019-12-07 13:09:54,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 13:09:54,549 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:54,549 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:09:54,549 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:54,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:54,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1980585546, now seen corresponding path program 3 times [2019-12-07 13:09:54,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:09:54,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726437393] [2019-12-07 13:09:54,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:54,623 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-07 13:09:54,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726437393] [2019-12-07 13:09:54,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:54,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:09:54,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698766963] [2019-12-07 13:09:54,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:09:54,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:09:54,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:09:54,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:09:54,624 INFO L87 Difference]: Start difference. First operand 1384 states and 3043 transitions. Second operand 3 states. [2019-12-07 13:09:54,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:54,635 INFO L93 Difference]: Finished difference Result 1383 states and 3041 transitions. [2019-12-07 13:09:54,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:09:54,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 13:09:54,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:54,638 INFO L225 Difference]: With dead ends: 1383 [2019-12-07 13:09:54,639 INFO L226 Difference]: Without dead ends: 1383 [2019-12-07 13:09:54,639 INFO L630 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-07 13:09:54,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2019-12-07 13:09:54,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1153. [2019-12-07 13:09:54,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2019-12-07 13:09:54,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 2598 transitions. [2019-12-07 13:09:54,657 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 2598 transitions. Word has length 51 [2019-12-07 13:09:54,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:54,657 INFO L462 AbstractCegarLoop]: Abstraction has 1153 states and 2598 transitions. [2019-12-07 13:09:54,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:09:54,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 2598 transitions. [2019-12-07 13:09:54,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 13:09:54,658 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:54,659 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:09:54,659 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:54,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:54,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1913367860, now seen corresponding path program 1 times [2019-12-07 13:09:54,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:09:54,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698298458] [2019-12-07 13:09:54,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:54,734 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-07 13:09:54,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698298458] [2019-12-07 13:09:54,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:54,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:09:54,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248847116] [2019-12-07 13:09:54,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:09:54,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:09:54,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:09:54,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:09:54,735 INFO L87 Difference]: Start difference. First operand 1153 states and 2598 transitions. Second operand 5 states. [2019-12-07 13:09:54,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:54,756 INFO L93 Difference]: Finished difference Result 1983 states and 4507 transitions. [2019-12-07 13:09:54,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:09:54,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-07 13:09:54,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:54,758 INFO L225 Difference]: With dead ends: 1983 [2019-12-07 13:09:54,758 INFO L226 Difference]: Without dead ends: 899 [2019-12-07 13:09:54,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:09:54,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-12-07 13:09:54,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 899. [2019-12-07 13:09:54,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2019-12-07 13:09:54,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 2039 transitions. [2019-12-07 13:09:54,769 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 2039 transitions. Word has length 52 [2019-12-07 13:09:54,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:54,770 INFO L462 AbstractCegarLoop]: Abstraction has 899 states and 2039 transitions. [2019-12-07 13:09:54,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:09:54,770 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 2039 transitions. [2019-12-07 13:09:54,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 13:09:54,771 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:54,771 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:09:54,771 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:54,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:54,771 INFO L82 PathProgramCache]: Analyzing trace with hash -511128040, now seen corresponding path program 2 times [2019-12-07 13:09:54,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:09:54,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324067282] [2019-12-07 13:09:54,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:54,856 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-07 13:09:54,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324067282] [2019-12-07 13:09:54,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:54,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:09:54,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112685693] [2019-12-07 13:09:54,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:09:54,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:09:54,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:09:54,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:09:54,857 INFO L87 Difference]: Start difference. First operand 899 states and 2039 transitions. Second operand 7 states. [2019-12-07 13:09:55,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:55,054 INFO L93 Difference]: Finished difference Result 2481 states and 5320 transitions. [2019-12-07 13:09:55,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 13:09:55,054 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 13:09:55,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:55,056 INFO L225 Difference]: With dead ends: 2481 [2019-12-07 13:09:55,056 INFO L226 Difference]: Without dead ends: 1665 [2019-12-07 13:09:55,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:09:55,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2019-12-07 13:09:55,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 937. [2019-12-07 13:09:55,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2019-12-07 13:09:55,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 2098 transitions. [2019-12-07 13:09:55,071 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 2098 transitions. Word has length 52 [2019-12-07 13:09:55,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:55,071 INFO L462 AbstractCegarLoop]: Abstraction has 937 states and 2098 transitions. [2019-12-07 13:09:55,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:09:55,071 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 2098 transitions. [2019-12-07 13:09:55,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 13:09:55,072 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:55,072 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:09:55,073 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:55,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:55,073 INFO L82 PathProgramCache]: Analyzing trace with hash 505389010, now seen corresponding path program 3 times [2019-12-07 13:09:55,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:09:55,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338146253] [2019-12-07 13:09:55,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:55,217 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-07 13:09:55,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338146253] [2019-12-07 13:09:55,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:55,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 13:09:55,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812785335] [2019-12-07 13:09:55,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:09:55,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:09:55,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:09:55,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:09:55,219 INFO L87 Difference]: Start difference. First operand 937 states and 2098 transitions. Second operand 10 states. [2019-12-07 13:09:55,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:55,587 INFO L93 Difference]: Finished difference Result 1244 states and 2616 transitions. [2019-12-07 13:09:55,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:09:55,587 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-12-07 13:09:55,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:55,588 INFO L225 Difference]: With dead ends: 1244 [2019-12-07 13:09:55,588 INFO L226 Difference]: Without dead ends: 1244 [2019-12-07 13:09:55,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-12-07 13:09:55,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2019-12-07 13:09:55,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 742. [2019-12-07 13:09:55,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2019-12-07 13:09:55,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1594 transitions. [2019-12-07 13:09:55,597 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1594 transitions. Word has length 52 [2019-12-07 13:09:55,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:55,597 INFO L462 AbstractCegarLoop]: Abstraction has 742 states and 1594 transitions. [2019-12-07 13:09:55,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:09:55,597 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1594 transitions. [2019-12-07 13:09:55,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 13:09:55,598 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:55,599 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:09:55,599 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:55,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:55,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1643675972, now seen corresponding path program 4 times [2019-12-07 13:09:55,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:09:55,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492944983] [2019-12-07 13:09:55,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:55,655 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-07 13:09:55,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492944983] [2019-12-07 13:09:55,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:55,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:09:55,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884313011] [2019-12-07 13:09:55,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:09:55,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:09:55,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:09:55,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:09:55,657 INFO L87 Difference]: Start difference. First operand 742 states and 1594 transitions. Second operand 4 states. [2019-12-07 13:09:55,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:55,697 INFO L93 Difference]: Finished difference Result 906 states and 1922 transitions. [2019-12-07 13:09:55,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:09:55,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-07 13:09:55,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:55,698 INFO L225 Difference]: With dead ends: 906 [2019-12-07 13:09:55,698 INFO L226 Difference]: Without dead ends: 906 [2019-12-07 13:09:55,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:09:55,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2019-12-07 13:09:55,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 756. [2019-12-07 13:09:55,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2019-12-07 13:09:55,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1625 transitions. [2019-12-07 13:09:55,707 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1625 transitions. Word has length 52 [2019-12-07 13:09:55,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:55,707 INFO L462 AbstractCegarLoop]: Abstraction has 756 states and 1625 transitions. [2019-12-07 13:09:55,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:09:55,707 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1625 transitions. [2019-12-07 13:09:55,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 13:09:55,708 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:55,708 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:09:55,708 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:55,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:55,708 INFO L82 PathProgramCache]: Analyzing trace with hash -122108504, now seen corresponding path program 1 times [2019-12-07 13:09:55,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:09:55,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818284585] [2019-12-07 13:09:55,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:55,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-07 13:09:55,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818284585] [2019-12-07 13:09:55,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:55,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:09:55,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157489571] [2019-12-07 13:09:55,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:09:55,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:09:55,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:09:55,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:09:55,736 INFO L87 Difference]: Start difference. First operand 756 states and 1625 transitions. Second operand 4 states. [2019-12-07 13:09:55,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:55,853 INFO L93 Difference]: Finished difference Result 1229 states and 2639 transitions. [2019-12-07 13:09:55,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:09:55,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-07 13:09:55,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:55,855 INFO L225 Difference]: With dead ends: 1229 [2019-12-07 13:09:55,855 INFO L226 Difference]: Without dead ends: 1229 [2019-12-07 13:09:55,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-07 13:09:55,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2019-12-07 13:09:55,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 831. [2019-12-07 13:09:55,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-12-07 13:09:55,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1810 transitions. [2019-12-07 13:09:55,864 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1810 transitions. Word has length 53 [2019-12-07 13:09:55,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:55,864 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1810 transitions. [2019-12-07 13:09:55,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:09:55,864 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1810 transitions. [2019-12-07 13:09:55,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 13:09:55,865 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:55,866 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:09:55,866 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:55,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:55,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1190562228, now seen corresponding path program 1 times [2019-12-07 13:09:55,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:09:55,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449572126] [2019-12-07 13:09:55,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:55,965 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-07 13:09:55,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449572126] [2019-12-07 13:09:55,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:55,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:09:55,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310236622] [2019-12-07 13:09:55,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:09:55,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:09:55,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:09:55,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:09:55,966 INFO L87 Difference]: Start difference. First operand 831 states and 1810 transitions. Second operand 5 states. [2019-12-07 13:09:56,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:56,136 INFO L93 Difference]: Finished difference Result 929 states and 1983 transitions. [2019-12-07 13:09:56,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:09:56,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-07 13:09:56,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:56,137 INFO L225 Difference]: With dead ends: 929 [2019-12-07 13:09:56,137 INFO L226 Difference]: Without dead ends: 929 [2019-12-07 13:09:56,138 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:09:56,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-12-07 13:09:56,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 741. [2019-12-07 13:09:56,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2019-12-07 13:09:56,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1582 transitions. [2019-12-07 13:09:56,145 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1582 transitions. Word has length 53 [2019-12-07 13:09:56,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:56,145 INFO L462 AbstractCegarLoop]: Abstraction has 741 states and 1582 transitions. [2019-12-07 13:09:56,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:09:56,145 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1582 transitions. [2019-12-07 13:09:56,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 13:09:56,146 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:56,146 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:09:56,146 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:56,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:56,146 INFO L82 PathProgramCache]: Analyzing trace with hash 821991690, now seen corresponding path program 1 times [2019-12-07 13:09:56,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:09:56,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673970283] [2019-12-07 13:09:56,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:56,219 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-07 13:09:56,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673970283] [2019-12-07 13:09:56,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:56,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:09:56,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77303859] [2019-12-07 13:09:56,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:09:56,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:09:56,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:09:56,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:09:56,220 INFO L87 Difference]: Start difference. First operand 741 states and 1582 transitions. Second operand 7 states. [2019-12-07 13:09:56,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:56,357 INFO L93 Difference]: Finished difference Result 1884 states and 3885 transitions. [2019-12-07 13:09:56,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 13:09:56,357 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-07 13:09:56,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:56,358 INFO L225 Difference]: With dead ends: 1884 [2019-12-07 13:09:56,358 INFO L226 Difference]: Without dead ends: 1534 [2019-12-07 13:09:56,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:09:56,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2019-12-07 13:09:56,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 709. [2019-12-07 13:09:56,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2019-12-07 13:09:56,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1500 transitions. [2019-12-07 13:09:56,368 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1500 transitions. Word has length 53 [2019-12-07 13:09:56,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:56,368 INFO L462 AbstractCegarLoop]: Abstraction has 709 states and 1500 transitions. [2019-12-07 13:09:56,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:09:56,368 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1500 transitions. [2019-12-07 13:09:56,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 13:09:56,369 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:56,369 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:09:56,369 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:56,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:56,369 INFO L82 PathProgramCache]: Analyzing trace with hash 813658986, now seen corresponding path program 2 times [2019-12-07 13:09:56,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:09:56,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631120858] [2019-12-07 13:09:56,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:56,436 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-07 13:09:56,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631120858] [2019-12-07 13:09:56,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:56,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:09:56,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274682106] [2019-12-07 13:09:56,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:09:56,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:09:56,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:09:56,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:09:56,438 INFO L87 Difference]: Start difference. First operand 709 states and 1500 transitions. Second operand 5 states. [2019-12-07 13:09:56,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:56,478 INFO L93 Difference]: Finished difference Result 696 states and 1457 transitions. [2019-12-07 13:09:56,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:09:56,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-07 13:09:56,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:56,479 INFO L225 Difference]: With dead ends: 696 [2019-12-07 13:09:56,479 INFO L226 Difference]: Without dead ends: 696 [2019-12-07 13:09:56,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:09:56,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2019-12-07 13:09:56,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 571. [2019-12-07 13:09:56,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-12-07 13:09:56,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 1188 transitions. [2019-12-07 13:09:56,486 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 1188 transitions. Word has length 53 [2019-12-07 13:09:56,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:56,486 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 1188 transitions. [2019-12-07 13:09:56,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:09:56,486 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1188 transitions. [2019-12-07 13:09:56,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 13:09:56,487 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:56,487 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:09:56,487 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:56,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:56,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1691396374, now seen corresponding path program 1 times [2019-12-07 13:09:56,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:09:56,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996483807] [2019-12-07 13:09:56,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:09:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:09:56,571 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:09:56,571 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:09:56,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= (store .cse0 |v_ULTIMATE.start_main_~#t837~0.base_35| 1) |v_#valid_63|) (= 0 v_~a$w_buff1~0_316) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t837~0.base_35| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t837~0.base_35|) |v_ULTIMATE.start_main_~#t837~0.offset_23| 0))) (= 0 v_~a$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_cnt~0_62) (= v_~z~0_11 0) (= 0 v_~a$read_delayed~0_7) (= 0 |v_ULTIMATE.start_main_~#t837~0.offset_23|) (= v_~y~0_90 0) (= 0 v_~a$r_buff1_thd2~0_271) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t837~0.base_35|)) (= v_~__unbuffered_p1_EBX~0_60 0) (= v_~a$flush_delayed~0_23 0) (= v_~main$tmp_guard1~0_43 0) (< 0 |v_#StackHeapBarrier_15|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t837~0.base_35| 4)) (= 0 v_~a$w_buff0_used~0_830) (= 0 v_~a$w_buff1_used~0_501) (= 0 |v_#NULL.base_4|) (= v_~x~0_85 0) (= 0 v_~a$r_buff1_thd1~0_132) (= 0 v_~weak$$choice0~0_11) (= 0 v_~a$r_buff0_thd1~0_236) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t837~0.base_35|) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~a$r_buff0_thd2~0_373) (= |v_#NULL.offset_4| 0) (= v_~__unbuffered_p0_EBX~0_115 0) (= v_~a$mem_tmp~0_14 0) (= v_~weak$$choice2~0_107 0) (= v_~a~0_150 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~a$r_buff1_thd0~0_178 0) (= v_~a$r_buff0_thd0~0_163 0) (= v_~a$w_buff0~0_518 0) (= 0 v_~__unbuffered_p1_EAX~0_46) (= 0 v_~__unbuffered_p0_EAX~0_117))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_271, ULTIMATE.start_main_~#t838~0.offset=|v_ULTIMATE.start_main_~#t838~0.offset_16|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_373, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ULTIMATE.start_main_~#t838~0.base=|v_ULTIMATE.start_main_~#t838~0.base_27|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_163, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_63|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_37|, ULTIMATE.start_main_~#t837~0.base=|v_ULTIMATE.start_main_~#t837~0.base_35|, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~a~0=v_~a~0_150, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_117, ~a$w_buff1~0=v_~a$w_buff1~0_316, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_90, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_60, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_115, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_132, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_830, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_236, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_95|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_87|, ~a$w_buff0~0=v_~a$w_buff0~0_518, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_178, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_~#t837~0.offset=|v_ULTIMATE.start_main_~#t837~0.offset_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_11, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_501, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~x~0=v_~x~0_85, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[~a$read_delayed~0, ~a$r_buff1_thd2~0, ULTIMATE.start_main_~#t838~0.offset, ~a$r_buff0_thd2~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t838~0.base, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t837~0.base, ~a$mem_tmp~0, ~a~0, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite40, ~a$w_buff0~0, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t837~0.offset, ULTIMATE.start_main_#t~nondet39, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~x~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-07 13:09:56,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] P0ENTRY-->L4-3: Formula: (and (= 1 ~a$w_buff0_used~0_Out-1219085959) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1219085959| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1219085959) (= ~a$w_buff0~0_Out-1219085959 1) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1219085959 0)) (= ~a$w_buff1~0_Out-1219085959 ~a$w_buff0~0_In-1219085959) (= |P0Thread1of1ForFork0_#in~arg.offset_In-1219085959| P0Thread1of1ForFork0_~arg.offset_Out-1219085959) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1219085959| (ite (not (and (not (= 0 (mod ~a$w_buff1_used~0_Out-1219085959 256))) (not (= (mod ~a$w_buff0_used~0_Out-1219085959 256) 0)))) 1 0)) (= ~a$w_buff1_used~0_Out-1219085959 ~a$w_buff0_used~0_In-1219085959) (= |P0Thread1of1ForFork0_#in~arg.base_In-1219085959| P0Thread1of1ForFork0_~arg.base_Out-1219085959)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1219085959|, ~a$w_buff0~0=~a$w_buff0~0_In-1219085959, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1219085959|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1219085959} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1219085959|, ~a$w_buff1~0=~a$w_buff1~0_Out-1219085959, ~a$w_buff0~0=~a$w_buff0~0_Out-1219085959, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1219085959, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1219085959|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-1219085959, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-1219085959, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-1219085959, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1219085959|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-1219085959} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~a$w_buff0_used~0, ~a$w_buff1_used~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 13:09:56,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L814-1-->L816: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t838~0.base_10| 4)) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t838~0.base_10|) 0) (not (= |v_ULTIMATE.start_main_~#t838~0.base_10| 0)) (= 0 |v_ULTIMATE.start_main_~#t838~0.offset_9|) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t838~0.base_10| 1)) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t838~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t838~0.base_10|) |v_ULTIMATE.start_main_~#t838~0.offset_9| 1)) |v_#memory_int_7|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t838~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t838~0.offset=|v_ULTIMATE.start_main_~#t838~0.offset_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t838~0.base=|v_ULTIMATE.start_main_~#t838~0.base_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t838~0.offset, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t838~0.base] because there is no mapped edge [2019-12-07 13:09:56,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L783-->L783-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-689521726 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite23_Out-689521726| ~a$w_buff1_used~0_In-689521726) (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In-689521726 256) 0))) (or (and (= (mod ~a$r_buff1_thd2~0_In-689521726 256) 0) .cse1) (and (= (mod ~a$w_buff1_used~0_In-689521726 256) 0) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-689521726 256)))) (= |P1Thread1of1ForFork1_#t~ite23_Out-689521726| |P1Thread1of1ForFork1_#t~ite24_Out-689521726|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_In-689521726| |P1Thread1of1ForFork1_#t~ite23_Out-689521726|) (= |P1Thread1of1ForFork1_#t~ite24_Out-689521726| ~a$w_buff1_used~0_In-689521726)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-689521726, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-689521726, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-689521726|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-689521726, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-689521726, ~weak$$choice2~0=~weak$$choice2~0_In-689521726} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-689521726, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-689521726|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-689521726, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-689521726|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-689521726, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-689521726, ~weak$$choice2~0=~weak$$choice2~0_In-689521726} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-07 13:09:56,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L784-->L785: Formula: (and (not (= (mod v_~weak$$choice2~0_38 256) 0)) (= v_~a$r_buff0_thd2~0_146 v_~a$r_buff0_thd2~0_147)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_147, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_6|, ~weak$$choice2~0=v_~weak$$choice2~0_38, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[~a$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 13:09:56,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L753-->L753-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In-238584564 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-238584564 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-238584564|)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-238584564| ~a$w_buff0_used~0_In-238584564) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-238584564, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-238584564} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-238584564|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-238584564, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-238584564} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 13:09:56,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L754-->L754-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-886454025 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-886454025 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-886454025 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd1~0_In-886454025 256) 0))) (or (and (= ~a$w_buff1_used~0_In-886454025 |P0Thread1of1ForFork0_#t~ite6_Out-886454025|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite6_Out-886454025| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-886454025, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-886454025, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-886454025, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-886454025} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-886454025|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-886454025, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-886454025, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-886454025, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-886454025} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 13:09:56,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L755-->L756: Formula: (let ((.cse0 (= ~a$r_buff0_thd1~0_Out729737347 ~a$r_buff0_thd1~0_In729737347)) (.cse2 (= (mod ~a$r_buff0_thd1~0_In729737347 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In729737347 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= ~a$r_buff0_thd1~0_Out729737347 0) (not .cse2) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In729737347, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In729737347} OutVars{P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out729737347|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In729737347, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out729737347} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:09:56,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L756-->L756-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In178416524 256))) (.cse0 (= (mod ~a$r_buff1_thd1~0_In178416524 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In178416524 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In178416524 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out178416524| ~a$r_buff1_thd1~0_In178416524)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out178416524|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In178416524, ~a$w_buff0_used~0=~a$w_buff0_used~0_In178416524, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In178416524, ~a$w_buff1_used~0=~a$w_buff1_used~0_In178416524} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In178416524, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out178416524|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In178416524, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In178416524, ~a$w_buff1_used~0=~a$w_buff1_used~0_In178416524} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 13:09:56,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L756-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~a$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:09:56,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L787-->L791: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_14 256))) (= v_~a~0_48 v_~a$mem_tmp~0_7) (= v_~a$flush_delayed~0_13 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_14} OutVars{~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_11|} AuxVars[] AssignedVars[~a~0, ~a$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 13:09:56,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L791-2-->L791-5: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-1862131944 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-1862131944 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out-1862131944| |P1Thread1of1ForFork1_#t~ite32_Out-1862131944|))) (or (and (or .cse0 .cse1) (= ~a~0_In-1862131944 |P1Thread1of1ForFork1_#t~ite32_Out-1862131944|) .cse2) (and (= ~a$w_buff1~0_In-1862131944 |P1Thread1of1ForFork1_#t~ite32_Out-1862131944|) (not .cse0) (not .cse1) .cse2))) InVars {~a~0=~a~0_In-1862131944, ~a$w_buff1~0=~a$w_buff1~0_In-1862131944, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1862131944, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1862131944} OutVars{~a~0=~a~0_In-1862131944, ~a$w_buff1~0=~a$w_buff1~0_In-1862131944, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1862131944, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1862131944|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-1862131944|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1862131944} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 13:09:56,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L792-->L792-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1543772730 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1543772730 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1543772730| 0)) (and (= ~a$w_buff0_used~0_In-1543772730 |P1Thread1of1ForFork1_#t~ite34_Out-1543772730|) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1543772730, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1543772730} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1543772730|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1543772730, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1543772730} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 13:09:56,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L793-->L793-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In1802656403 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1802656403 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1802656403 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In1802656403 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In1802656403 |P1Thread1of1ForFork1_#t~ite35_Out1802656403|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1802656403|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1802656403, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1802656403, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1802656403, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1802656403} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1802656403, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1802656403, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1802656403, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1802656403|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1802656403} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 13:09:56,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L794-->L794-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1698882912 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1698882912 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In-1698882912 |P1Thread1of1ForFork1_#t~ite36_Out-1698882912|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1698882912|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1698882912, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1698882912} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1698882912, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1698882912, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1698882912|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 13:09:56,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L795-->L795-2: Formula: (let ((.cse2 (= (mod ~a$w_buff0_used~0_In-2083209011 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In-2083209011 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-2083209011 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-2083209011 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-2083209011|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~a$r_buff1_thd2~0_In-2083209011 |P1Thread1of1ForFork1_#t~ite37_Out-2083209011|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2083209011, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2083209011, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2083209011, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2083209011} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2083209011, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2083209011, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2083209011, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2083209011, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-2083209011|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 13:09:56,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L795-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite37_22| v_~a$r_buff1_thd2~0_110) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 13:09:56,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L816-1-->L822: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 13:09:56,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L822-2-->L822-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-1484282542 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1484282542 256)))) (or (and (= ~a$w_buff1~0_In-1484282542 |ULTIMATE.start_main_#t~ite40_Out-1484282542|) (not .cse0) (not .cse1)) (and (= ~a~0_In-1484282542 |ULTIMATE.start_main_#t~ite40_Out-1484282542|) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In-1484282542, ~a$w_buff1~0=~a$w_buff1~0_In-1484282542, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1484282542, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1484282542} OutVars{~a~0=~a~0_In-1484282542, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1484282542|, ~a$w_buff1~0=~a$w_buff1~0_In-1484282542, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1484282542, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1484282542} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:09:56,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L822-4-->L823: Formula: (= v_~a~0_26 |v_ULTIMATE.start_main_#t~ite40_17|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_17|} OutVars{~a~0=v_~a~0_26, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:09:56,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In-2116561450 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-2116561450 256)))) (or (and (= ~a$w_buff0_used~0_In-2116561450 |ULTIMATE.start_main_#t~ite42_Out-2116561450|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-2116561450| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2116561450, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2116561450} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-2116561450, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2116561450, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-2116561450|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 13:09:56,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L824-->L824-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1542209142 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-1542209142 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1542209142 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-1542209142 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-1542209142 |ULTIMATE.start_main_#t~ite43_Out-1542209142|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-1542209142|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1542209142, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1542209142, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1542209142, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1542209142} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1542209142, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1542209142, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1542209142, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1542209142, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1542209142|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 13:09:56,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L825-->L825-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1465733583 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1465733583 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out1465733583| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In1465733583 |ULTIMATE.start_main_#t~ite44_Out1465733583|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1465733583, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1465733583} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1465733583, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1465733583, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1465733583|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 13:09:56,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L826-->L826-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In1311471073 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In1311471073 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1311471073 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In1311471073 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out1311471073| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1311471073| ~a$r_buff1_thd0~0_In1311471073)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1311471073, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1311471073, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1311471073, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1311471073} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1311471073, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1311471073, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1311471073, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1311471073, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1311471073|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 13:09:56,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L826-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~a$r_buff1_thd0~0_147 |v_ULTIMATE.start_main_#t~ite45_39|) (= v_~main$tmp_guard1~0_18 (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_86 0) (= 1 v_~__unbuffered_p1_EAX~0_18) (= 1 v_~__unbuffered_p0_EAX~0_88))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_147, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:09:56,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:09:56 BasicIcfg [2019-12-07 13:09:56,644 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:09:56,644 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:09:56,644 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:09:56,644 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:09:56,645 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:09:47" (3/4) ... [2019-12-07 13:09:56,647 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:09:56,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= (store .cse0 |v_ULTIMATE.start_main_~#t837~0.base_35| 1) |v_#valid_63|) (= 0 v_~a$w_buff1~0_316) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t837~0.base_35| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t837~0.base_35|) |v_ULTIMATE.start_main_~#t837~0.offset_23| 0))) (= 0 v_~a$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_cnt~0_62) (= v_~z~0_11 0) (= 0 v_~a$read_delayed~0_7) (= 0 |v_ULTIMATE.start_main_~#t837~0.offset_23|) (= v_~y~0_90 0) (= 0 v_~a$r_buff1_thd2~0_271) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t837~0.base_35|)) (= v_~__unbuffered_p1_EBX~0_60 0) (= v_~a$flush_delayed~0_23 0) (= v_~main$tmp_guard1~0_43 0) (< 0 |v_#StackHeapBarrier_15|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t837~0.base_35| 4)) (= 0 v_~a$w_buff0_used~0_830) (= 0 v_~a$w_buff1_used~0_501) (= 0 |v_#NULL.base_4|) (= v_~x~0_85 0) (= 0 v_~a$r_buff1_thd1~0_132) (= 0 v_~weak$$choice0~0_11) (= 0 v_~a$r_buff0_thd1~0_236) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t837~0.base_35|) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~a$r_buff0_thd2~0_373) (= |v_#NULL.offset_4| 0) (= v_~__unbuffered_p0_EBX~0_115 0) (= v_~a$mem_tmp~0_14 0) (= v_~weak$$choice2~0_107 0) (= v_~a~0_150 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~a$r_buff1_thd0~0_178 0) (= v_~a$r_buff0_thd0~0_163 0) (= v_~a$w_buff0~0_518 0) (= 0 v_~__unbuffered_p1_EAX~0_46) (= 0 v_~__unbuffered_p0_EAX~0_117))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_271, ULTIMATE.start_main_~#t838~0.offset=|v_ULTIMATE.start_main_~#t838~0.offset_16|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_373, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ULTIMATE.start_main_~#t838~0.base=|v_ULTIMATE.start_main_~#t838~0.base_27|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_163, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_63|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_37|, ULTIMATE.start_main_~#t837~0.base=|v_ULTIMATE.start_main_~#t837~0.base_35|, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~a~0=v_~a~0_150, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_117, ~a$w_buff1~0=v_~a$w_buff1~0_316, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_90, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_60, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_115, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_132, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_830, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_236, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_95|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_87|, ~a$w_buff0~0=v_~a$w_buff0~0_518, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_178, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_~#t837~0.offset=|v_ULTIMATE.start_main_~#t837~0.offset_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_11, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_501, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~x~0=v_~x~0_85, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[~a$read_delayed~0, ~a$r_buff1_thd2~0, ULTIMATE.start_main_~#t838~0.offset, ~a$r_buff0_thd2~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t838~0.base, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t837~0.base, ~a$mem_tmp~0, ~a~0, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite40, ~a$w_buff0~0, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t837~0.offset, ULTIMATE.start_main_#t~nondet39, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~x~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-07 13:09:56,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] P0ENTRY-->L4-3: Formula: (and (= 1 ~a$w_buff0_used~0_Out-1219085959) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1219085959| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1219085959) (= ~a$w_buff0~0_Out-1219085959 1) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1219085959 0)) (= ~a$w_buff1~0_Out-1219085959 ~a$w_buff0~0_In-1219085959) (= |P0Thread1of1ForFork0_#in~arg.offset_In-1219085959| P0Thread1of1ForFork0_~arg.offset_Out-1219085959) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1219085959| (ite (not (and (not (= 0 (mod ~a$w_buff1_used~0_Out-1219085959 256))) (not (= (mod ~a$w_buff0_used~0_Out-1219085959 256) 0)))) 1 0)) (= ~a$w_buff1_used~0_Out-1219085959 ~a$w_buff0_used~0_In-1219085959) (= |P0Thread1of1ForFork0_#in~arg.base_In-1219085959| P0Thread1of1ForFork0_~arg.base_Out-1219085959)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1219085959|, ~a$w_buff0~0=~a$w_buff0~0_In-1219085959, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1219085959|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1219085959} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1219085959|, ~a$w_buff1~0=~a$w_buff1~0_Out-1219085959, ~a$w_buff0~0=~a$w_buff0~0_Out-1219085959, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1219085959, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1219085959|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-1219085959, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-1219085959, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-1219085959, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1219085959|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-1219085959} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~a$w_buff0_used~0, ~a$w_buff1_used~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 13:09:56,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L814-1-->L816: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t838~0.base_10| 4)) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t838~0.base_10|) 0) (not (= |v_ULTIMATE.start_main_~#t838~0.base_10| 0)) (= 0 |v_ULTIMATE.start_main_~#t838~0.offset_9|) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t838~0.base_10| 1)) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t838~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t838~0.base_10|) |v_ULTIMATE.start_main_~#t838~0.offset_9| 1)) |v_#memory_int_7|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t838~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t838~0.offset=|v_ULTIMATE.start_main_~#t838~0.offset_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t838~0.base=|v_ULTIMATE.start_main_~#t838~0.base_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t838~0.offset, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t838~0.base] because there is no mapped edge [2019-12-07 13:09:56,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L783-->L783-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-689521726 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite23_Out-689521726| ~a$w_buff1_used~0_In-689521726) (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In-689521726 256) 0))) (or (and (= (mod ~a$r_buff1_thd2~0_In-689521726 256) 0) .cse1) (and (= (mod ~a$w_buff1_used~0_In-689521726 256) 0) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-689521726 256)))) (= |P1Thread1of1ForFork1_#t~ite23_Out-689521726| |P1Thread1of1ForFork1_#t~ite24_Out-689521726|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_In-689521726| |P1Thread1of1ForFork1_#t~ite23_Out-689521726|) (= |P1Thread1of1ForFork1_#t~ite24_Out-689521726| ~a$w_buff1_used~0_In-689521726)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-689521726, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-689521726, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-689521726|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-689521726, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-689521726, ~weak$$choice2~0=~weak$$choice2~0_In-689521726} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-689521726, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-689521726|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-689521726, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-689521726|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-689521726, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-689521726, ~weak$$choice2~0=~weak$$choice2~0_In-689521726} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-07 13:09:56,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L784-->L785: Formula: (and (not (= (mod v_~weak$$choice2~0_38 256) 0)) (= v_~a$r_buff0_thd2~0_146 v_~a$r_buff0_thd2~0_147)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_147, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_6|, ~weak$$choice2~0=v_~weak$$choice2~0_38, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[~a$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 13:09:56,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L753-->L753-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In-238584564 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-238584564 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-238584564|)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-238584564| ~a$w_buff0_used~0_In-238584564) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-238584564, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-238584564} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-238584564|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-238584564, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-238584564} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 13:09:56,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L754-->L754-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-886454025 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-886454025 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-886454025 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd1~0_In-886454025 256) 0))) (or (and (= ~a$w_buff1_used~0_In-886454025 |P0Thread1of1ForFork0_#t~ite6_Out-886454025|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite6_Out-886454025| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-886454025, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-886454025, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-886454025, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-886454025} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-886454025|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-886454025, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-886454025, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-886454025, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-886454025} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 13:09:56,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L755-->L756: Formula: (let ((.cse0 (= ~a$r_buff0_thd1~0_Out729737347 ~a$r_buff0_thd1~0_In729737347)) (.cse2 (= (mod ~a$r_buff0_thd1~0_In729737347 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In729737347 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= ~a$r_buff0_thd1~0_Out729737347 0) (not .cse2) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In729737347, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In729737347} OutVars{P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out729737347|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In729737347, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out729737347} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:09:56,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L756-->L756-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In178416524 256))) (.cse0 (= (mod ~a$r_buff1_thd1~0_In178416524 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In178416524 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In178416524 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out178416524| ~a$r_buff1_thd1~0_In178416524)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out178416524|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In178416524, ~a$w_buff0_used~0=~a$w_buff0_used~0_In178416524, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In178416524, ~a$w_buff1_used~0=~a$w_buff1_used~0_In178416524} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In178416524, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out178416524|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In178416524, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In178416524, ~a$w_buff1_used~0=~a$w_buff1_used~0_In178416524} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 13:09:56,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L756-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~a$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:09:56,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L787-->L791: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_14 256))) (= v_~a~0_48 v_~a$mem_tmp~0_7) (= v_~a$flush_delayed~0_13 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_14} OutVars{~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_11|} AuxVars[] AssignedVars[~a~0, ~a$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 13:09:56,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L791-2-->L791-5: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-1862131944 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-1862131944 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out-1862131944| |P1Thread1of1ForFork1_#t~ite32_Out-1862131944|))) (or (and (or .cse0 .cse1) (= ~a~0_In-1862131944 |P1Thread1of1ForFork1_#t~ite32_Out-1862131944|) .cse2) (and (= ~a$w_buff1~0_In-1862131944 |P1Thread1of1ForFork1_#t~ite32_Out-1862131944|) (not .cse0) (not .cse1) .cse2))) InVars {~a~0=~a~0_In-1862131944, ~a$w_buff1~0=~a$w_buff1~0_In-1862131944, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1862131944, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1862131944} OutVars{~a~0=~a~0_In-1862131944, ~a$w_buff1~0=~a$w_buff1~0_In-1862131944, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1862131944, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1862131944|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-1862131944|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1862131944} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 13:09:56,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L792-->L792-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1543772730 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1543772730 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1543772730| 0)) (and (= ~a$w_buff0_used~0_In-1543772730 |P1Thread1of1ForFork1_#t~ite34_Out-1543772730|) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1543772730, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1543772730} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1543772730|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1543772730, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1543772730} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 13:09:56,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L793-->L793-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In1802656403 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1802656403 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1802656403 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In1802656403 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In1802656403 |P1Thread1of1ForFork1_#t~ite35_Out1802656403|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1802656403|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1802656403, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1802656403, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1802656403, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1802656403} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1802656403, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1802656403, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1802656403, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1802656403|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1802656403} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 13:09:56,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L794-->L794-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1698882912 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1698882912 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In-1698882912 |P1Thread1of1ForFork1_#t~ite36_Out-1698882912|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1698882912|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1698882912, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1698882912} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1698882912, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1698882912, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1698882912|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 13:09:56,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L795-->L795-2: Formula: (let ((.cse2 (= (mod ~a$w_buff0_used~0_In-2083209011 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In-2083209011 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-2083209011 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-2083209011 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-2083209011|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~a$r_buff1_thd2~0_In-2083209011 |P1Thread1of1ForFork1_#t~ite37_Out-2083209011|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2083209011, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2083209011, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2083209011, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2083209011} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2083209011, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2083209011, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2083209011, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2083209011, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-2083209011|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 13:09:56,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L795-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite37_22| v_~a$r_buff1_thd2~0_110) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 13:09:56,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L816-1-->L822: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 13:09:56,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L822-2-->L822-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-1484282542 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1484282542 256)))) (or (and (= ~a$w_buff1~0_In-1484282542 |ULTIMATE.start_main_#t~ite40_Out-1484282542|) (not .cse0) (not .cse1)) (and (= ~a~0_In-1484282542 |ULTIMATE.start_main_#t~ite40_Out-1484282542|) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In-1484282542, ~a$w_buff1~0=~a$w_buff1~0_In-1484282542, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1484282542, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1484282542} OutVars{~a~0=~a~0_In-1484282542, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1484282542|, ~a$w_buff1~0=~a$w_buff1~0_In-1484282542, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1484282542, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1484282542} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:09:56,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L822-4-->L823: Formula: (= v_~a~0_26 |v_ULTIMATE.start_main_#t~ite40_17|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_17|} OutVars{~a~0=v_~a~0_26, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:09:56,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In-2116561450 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-2116561450 256)))) (or (and (= ~a$w_buff0_used~0_In-2116561450 |ULTIMATE.start_main_#t~ite42_Out-2116561450|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-2116561450| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2116561450, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2116561450} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-2116561450, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2116561450, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-2116561450|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 13:09:56,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L824-->L824-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1542209142 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-1542209142 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1542209142 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-1542209142 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-1542209142 |ULTIMATE.start_main_#t~ite43_Out-1542209142|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-1542209142|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1542209142, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1542209142, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1542209142, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1542209142} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1542209142, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1542209142, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1542209142, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1542209142, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1542209142|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 13:09:56,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L825-->L825-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1465733583 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1465733583 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out1465733583| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In1465733583 |ULTIMATE.start_main_#t~ite44_Out1465733583|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1465733583, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1465733583} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1465733583, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1465733583, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1465733583|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 13:09:56,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L826-->L826-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In1311471073 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In1311471073 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1311471073 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In1311471073 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out1311471073| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1311471073| ~a$r_buff1_thd0~0_In1311471073)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1311471073, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1311471073, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1311471073, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1311471073} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1311471073, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1311471073, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1311471073, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1311471073, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1311471073|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 13:09:56,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L826-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~a$r_buff1_thd0~0_147 |v_ULTIMATE.start_main_#t~ite45_39|) (= v_~main$tmp_guard1~0_18 (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_86 0) (= 1 v_~__unbuffered_p1_EAX~0_18) (= 1 v_~__unbuffered_p0_EAX~0_88))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_147, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:09:56,718 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_463ce498-9f17-429d-a3a4-008cc3478d2c/bin/uautomizer/witness.graphml [2019-12-07 13:09:56,718 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:09:56,719 INFO L168 Benchmark]: Toolchain (without parser) took 9587.87 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 353.9 MB). Free memory was 940.9 MB in the beginning and 956.2 MB in the end (delta: -15.3 MB). Peak memory consumption was 338.6 MB. Max. memory is 11.5 GB. [2019-12-07 13:09:56,719 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:09:56,720 INFO L168 Benchmark]: CACSL2BoogieTranslator took 375.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -141.4 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:09:56,720 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:09:56,720 INFO L168 Benchmark]: Boogie Preprocessor took 26.05 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:09:56,721 INFO L168 Benchmark]: RCFGBuilder took 375.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:09:56,721 INFO L168 Benchmark]: TraceAbstraction took 8696.56 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 238.0 MB). Free memory was 1.0 GB in the beginning and 970.0 MB in the end (delta: 58.2 MB). Peak memory consumption was 296.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:09:56,721 INFO L168 Benchmark]: Witness Printer took 73.61 ms. Allocated memory is still 1.4 GB. Free memory was 970.0 MB in the beginning and 956.2 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:09:56,723 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 375.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -141.4 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.05 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 375.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8696.56 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 238.0 MB). Free memory was 1.0 GB in the beginning and 970.0 MB in the end (delta: 58.2 MB). Peak memory consumption was 296.2 MB. Max. memory is 11.5 GB. * Witness Printer took 73.61 ms. Allocated memory is still 1.4 GB. Free memory was 970.0 MB in the beginning and 956.2 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.1s, 151 ProgramPointsBefore, 77 ProgramPointsAfterwards, 185 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 25 ChoiceCompositions, 5174 VarBasedMoverChecksPositive, 220 VarBasedMoverChecksNegative, 43 SemBasedMoverChecksPositive, 239 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 55357 CheckedPairsTotal, 107 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t837, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t838, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L738] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L739] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L740] 1 a$r_buff0_thd1 = (_Bool)1 [L743] 1 x = 1 [L746] 1 __unbuffered_p0_EAX = x [L749] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 2 y = 1 [L769] 2 z = 1 [L772] 2 __unbuffered_p1_EAX = z [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 a$flush_delayed = weak$$choice2 [L778] 2 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] EXPR 2 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L780] EXPR 2 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L780] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L781] EXPR 2 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L781] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L782] EXPR 2 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=1, x=1, y=1, z=1] [L782] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L783] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L785] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L822] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L823] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L824] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L825] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.5s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2472 SDtfs, 2584 SDslu, 4797 SDs, 0 SdLazy, 2888 SolverSat, 131 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 32 SyntacticMatches, 16 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 5851 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 786 NumberOfCodeBlocks, 786 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 713 ConstructedInterpolants, 0 QuantifiedInterpolants, 195601 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...