./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f642aa2c8450a6773cb633057d1c74c446cbd236 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.2.1-dev-20ed64e [2021-08-26 14:44:13,649 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 14:44:13,652 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 14:44:13,691 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 14:44:13,691 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 14:44:13,694 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 14:44:13,695 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 14:44:13,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 14:44:13,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 14:44:13,705 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 14:44:13,705 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 14:44:13,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 14:44:13,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 14:44:13,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 14:44:13,712 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 14:44:13,716 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 14:44:13,716 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 14:44:13,717 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 14:44:13,719 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 14:44:13,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 14:44:13,723 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 14:44:13,724 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 14:44:13,725 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 14:44:13,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 14:44:13,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 14:44:13,733 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 14:44:13,733 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 14:44:13,734 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 14:44:13,735 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 14:44:13,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 14:44:13,736 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 14:44:13,736 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 14:44:13,737 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 14:44:13,739 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 14:44:13,740 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 14:44:13,740 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 14:44:13,741 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 14:44:13,741 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 14:44:13,741 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 14:44:13,743 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 14:44:13,743 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 14:44:13,744 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 14:44:13,768 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 14:44:13,768 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 14:44:13,769 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 14:44:13,769 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 14:44:13,771 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 14:44:13,771 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 14:44:13,772 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 14:44:13,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 14:44:13,772 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 14:44:13,772 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 14:44:13,773 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 14:44:13,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 14:44:13,773 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 14:44:13,773 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 14:44:13,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 14:44:13,774 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 14:44:13,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 14:44:13,774 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 14:44:13,774 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 14:44:13,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 14:44:13,775 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 14:44:13,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 14:44:13,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 14:44:13,775 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 14:44:13,775 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 14:44:13,775 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 14:44:13,775 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 14:44:13,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 14:44:13,776 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 14:44:13,776 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 14:44:13,776 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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(reach_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 -> f642aa2c8450a6773cb633057d1c74c446cbd236 [2021-08-26 14:44:14,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 14:44:14,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 14:44:14,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 14:44:14,052 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 14:44:14,052 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 14:44:14,053 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2021-08-26 14:44:14,127 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df7a79f6f/f096351f063040238d3780f5e0b7488a/FLAG98a2bd820 [2021-08-26 14:44:14,519 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 14:44:14,520 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2021-08-26 14:44:14,533 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df7a79f6f/f096351f063040238d3780f5e0b7488a/FLAG98a2bd820 [2021-08-26 14:44:14,542 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df7a79f6f/f096351f063040238d3780f5e0b7488a [2021-08-26 14:44:14,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 14:44:14,545 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 14:44:14,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 14:44:14,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 14:44:14,548 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 14:44:14,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:44:14" (1/1) ... [2021-08-26 14:44:14,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@774934e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:44:14, skipping insertion in model container [2021-08-26 14:44:14,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:44:14" (1/1) ... [2021-08-26 14:44:14,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 14:44:14,581 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 14:44:14,663 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-08-26 14:44:14,980 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i[75009,75022] [2021-08-26 14:44:15,006 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 14:44:15,011 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 14:44:15,018 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-08-26 14:44:15,037 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i[75009,75022] [2021-08-26 14:44:15,044 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 14:44:15,133 INFO L208 MainTranslator]: Completed translation [2021-08-26 14:44:15,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:44:15 WrapperNode [2021-08-26 14:44:15,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 14:44:15,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 14:44:15,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 14:44:15,136 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 14:44:15,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:44:15" (1/1) ... [2021-08-26 14:44:15,185 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:44:15" (1/1) ... [2021-08-26 14:44:15,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 14:44:15,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 14:44:15,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 14:44:15,214 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 14:44:15,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:44:15" (1/1) ... [2021-08-26 14:44:15,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:44:15" (1/1) ... [2021-08-26 14:44:15,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:44:15" (1/1) ... [2021-08-26 14:44:15,242 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:44:15" (1/1) ... [2021-08-26 14:44:15,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:44:15" (1/1) ... [2021-08-26 14:44:15,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:44:15" (1/1) ... [2021-08-26 14:44:15,254 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:44:15" (1/1) ... [2021-08-26 14:44:15,258 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 14:44:15,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 14:44:15,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 14:44:15,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 14:44:15,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:44:15" (1/1) ... [2021-08-26 14:44:15,265 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 14:44:15,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 14:44:15,289 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 14:44:15,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 14:44:15,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-26 14:44:15,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-26 14:44:15,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-26 14:44:15,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-26 14:44:15,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-26 14:44:15,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 14:44:15,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 14:44:15,325 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2021-08-26 14:44:15,325 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2021-08-26 14:44:15,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 14:44:15,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-26 14:44:15,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 14:44:15,327 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-26 14:44:15,848 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 14:44:15,848 INFO L299 CfgBuilder]: Removed 24 assume(true) statements. [2021-08-26 14:44:15,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:44:15 BoogieIcfgContainer [2021-08-26 14:44:15,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 14:44:15,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 14:44:15,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 14:44:15,852 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 14:44:15,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 02:44:14" (1/3) ... [2021-08-26 14:44:15,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c9b298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:44:15, skipping insertion in model container [2021-08-26 14:44:15,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:44:15" (2/3) ... [2021-08-26 14:44:15,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c9b298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:44:15, skipping insertion in model container [2021-08-26 14:44:15,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:44:15" (3/3) ... [2021-08-26 14:44:15,854 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2021-08-26 14:44:15,857 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-26 14:44:15,857 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 14:44:15,857 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-08-26 14:44:15,857 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-26 14:44:15,877 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,877 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,877 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,877 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,877 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,877 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,878 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,878 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,878 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,878 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,878 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,878 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,878 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,878 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,878 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,878 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,878 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,878 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,879 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,879 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,879 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,879 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,879 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,879 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,879 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,879 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,879 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,879 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,880 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,880 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,880 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,880 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,880 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,880 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,880 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,880 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,880 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,880 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,880 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,880 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,881 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,881 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,881 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,881 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,881 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,881 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,881 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,881 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,881 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,881 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,881 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,882 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,882 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,882 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,882 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,882 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,882 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,882 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,882 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,882 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,882 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,882 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,882 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,882 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,883 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,883 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,883 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,883 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,883 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,883 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,883 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,883 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,883 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,883 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,883 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,883 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,884 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,884 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,884 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,884 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,884 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,884 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,884 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,884 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,884 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,884 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,884 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,884 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,885 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,885 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,885 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,885 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,886 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,887 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,887 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,887 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,887 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,887 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,887 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,887 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,887 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,887 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,889 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,889 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,889 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,889 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,889 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,889 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,889 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,889 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,889 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,890 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:44:15,893 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-08-26 14:44:15,918 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 14:44:15,921 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 14:44:15,921 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-08-26 14:44:15,931 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-08-26 14:44:15,936 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 160 transitions, 336 flow [2021-08-26 14:44:15,938 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 160 transitions, 336 flow [2021-08-26 14:44:15,939 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 158 places, 160 transitions, 336 flow [2021-08-26 14:44:15,996 INFO L129 PetriNetUnfolder]: 10/196 cut-off events. [2021-08-26 14:44:15,996 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-08-26 14:44:16,002 INFO L84 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 196 events. 10/196 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 299 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 116. Up to 4 conditions per place. [2021-08-26 14:44:16,004 INFO L116 LiptonReduction]: Number of co-enabled transitions 1836 [2021-08-26 14:45:12,481 INFO L131 LiptonReduction]: Checked pairs total: 3822 [2021-08-26 14:45:12,481 INFO L133 LiptonReduction]: Total number of compositions: 198 [2021-08-26 14:45:12,488 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 31 transitions, 78 flow [2021-08-26 14:45:12,528 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 178 states, 168 states have (on average 2.3452380952380953) internal successors, (394), 177 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:12,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 178 states, 168 states have (on average 2.3452380952380953) internal successors, (394), 177 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:12,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2021-08-26 14:45:12,536 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:12,536 INFO L512 BasicCegarLoop]: trace histogram [1] [2021-08-26 14:45:12,537 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:12,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:12,542 INFO L82 PathProgramCache]: Analyzing trace with hash 607, now seen corresponding path program 1 times [2021-08-26 14:45:12,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:12,551 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980118435] [2021-08-26 14:45:12,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:12,552 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:12,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:45:12,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:12,752 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980118435] [2021-08-26 14:45:12,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980118435] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:12,753 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:12,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2021-08-26 14:45:12,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314113655] [2021-08-26 14:45:12,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-26 14:45:12,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:12,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-26 14:45:12,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 14:45:12,777 INFO L87 Difference]: Start difference. First operand has 178 states, 168 states have (on average 2.3452380952380953) internal successors, (394), 177 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:12,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:12,798 INFO L93 Difference]: Finished difference Result 176 states and 392 transitions. [2021-08-26 14:45:12,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-26 14:45:12,798 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2021-08-26 14:45:12,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:12,807 INFO L225 Difference]: With dead ends: 176 [2021-08-26 14:45:12,808 INFO L226 Difference]: Without dead ends: 159 [2021-08-26 14:45:12,809 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 14:45:12,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-08-26 14:45:12,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2021-08-26 14:45:12,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 153 states have (on average 2.2941176470588234) internal successors, (351), 158 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:12,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 351 transitions. [2021-08-26 14:45:12,852 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 351 transitions. Word has length 1 [2021-08-26 14:45:12,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:12,853 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 351 transitions. [2021-08-26 14:45:12,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:12,853 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 351 transitions. [2021-08-26 14:45:12,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-08-26 14:45:12,853 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:12,854 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-08-26 14:45:12,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 14:45:12,854 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:12,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:12,855 INFO L82 PathProgramCache]: Analyzing trace with hash 576323437, now seen corresponding path program 1 times [2021-08-26 14:45:12,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:12,855 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274186220] [2021-08-26 14:45:12,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:12,855 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:13,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:45:13,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:13,007 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274186220] [2021-08-26 14:45:13,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274186220] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:13,007 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:13,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 14:45:13,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906358640] [2021-08-26 14:45:13,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 14:45:13,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:13,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 14:45:13,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 14:45:13,010 INFO L87 Difference]: Start difference. First operand 159 states and 351 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:13,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:13,121 INFO L93 Difference]: Finished difference Result 232 states and 517 transitions. [2021-08-26 14:45:13,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 14:45:13,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-08-26 14:45:13,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:13,125 INFO L225 Difference]: With dead ends: 232 [2021-08-26 14:45:13,125 INFO L226 Difference]: Without dead ends: 232 [2021-08-26 14:45:13,126 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:45:13,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-08-26 14:45:13,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 202. [2021-08-26 14:45:13,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 197 states have (on average 2.3248730964467006) internal successors, (458), 201 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:13,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 458 transitions. [2021-08-26 14:45:13,144 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 458 transitions. Word has length 5 [2021-08-26 14:45:13,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:13,145 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 458 transitions. [2021-08-26 14:45:13,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:13,145 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 458 transitions. [2021-08-26 14:45:13,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-08-26 14:45:13,145 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:13,145 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-08-26 14:45:13,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 14:45:13,147 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:13,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:13,148 INFO L82 PathProgramCache]: Analyzing trace with hash 576323474, now seen corresponding path program 1 times [2021-08-26 14:45:13,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:13,149 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009566695] [2021-08-26 14:45:13,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:13,150 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:13,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:45:13,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:13,217 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009566695] [2021-08-26 14:45:13,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009566695] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:13,222 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:13,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 14:45:13,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905665197] [2021-08-26 14:45:13,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 14:45:13,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:13,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 14:45:13,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:45:13,226 INFO L87 Difference]: Start difference. First operand 202 states and 458 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:13,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:13,283 INFO L93 Difference]: Finished difference Result 260 states and 572 transitions. [2021-08-26 14:45:13,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 14:45:13,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-08-26 14:45:13,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:13,285 INFO L225 Difference]: With dead ends: 260 [2021-08-26 14:45:13,285 INFO L226 Difference]: Without dead ends: 253 [2021-08-26 14:45:13,286 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:45:13,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-08-26 14:45:13,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 238. [2021-08-26 14:45:13,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 234 states have (on average 2.3162393162393164) internal successors, (542), 237 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:13,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 542 transitions. [2021-08-26 14:45:13,294 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 542 transitions. Word has length 5 [2021-08-26 14:45:13,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:13,294 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 542 transitions. [2021-08-26 14:45:13,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:13,294 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 542 transitions. [2021-08-26 14:45:13,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-26 14:45:13,296 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:13,296 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:45:13,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 14:45:13,297 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:13,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:13,298 INFO L82 PathProgramCache]: Analyzing trace with hash 510614164, now seen corresponding path program 1 times [2021-08-26 14:45:13,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:13,298 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110852250] [2021-08-26 14:45:13,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:13,299 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:13,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:45:13,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:13,362 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110852250] [2021-08-26 14:45:13,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110852250] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:13,363 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:13,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 14:45:13,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676797009] [2021-08-26 14:45:13,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 14:45:13,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:13,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 14:45:13,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:45:13,365 INFO L87 Difference]: Start difference. First operand 238 states and 542 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:13,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:13,377 INFO L93 Difference]: Finished difference Result 73 states and 144 transitions. [2021-08-26 14:45:13,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 14:45:13,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-08-26 14:45:13,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:13,378 INFO L225 Difference]: With dead ends: 73 [2021-08-26 14:45:13,378 INFO L226 Difference]: Without dead ends: 73 [2021-08-26 14:45:13,379 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:45:13,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-08-26 14:45:13,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-08-26 14:45:13,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 71 states have (on average 2.028169014084507) internal successors, (144), 72 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:13,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 144 transitions. [2021-08-26 14:45:13,381 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 144 transitions. Word has length 10 [2021-08-26 14:45:13,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:13,381 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 144 transitions. [2021-08-26 14:45:13,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:13,382 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 144 transitions. [2021-08-26 14:45:13,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-26 14:45:13,384 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:13,384 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:45:13,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 14:45:13,384 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:13,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:13,385 INFO L82 PathProgramCache]: Analyzing trace with hash -92004590, now seen corresponding path program 1 times [2021-08-26 14:45:13,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:13,385 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673133436] [2021-08-26 14:45:13,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:13,385 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:13,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:45:13,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:13,985 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673133436] [2021-08-26 14:45:13,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673133436] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:13,985 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:13,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-26 14:45:13,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134555959] [2021-08-26 14:45:13,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 14:45:13,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:13,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 14:45:13,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-08-26 14:45:13,987 INFO L87 Difference]: Start difference. First operand 73 states and 144 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:14,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:14,507 INFO L93 Difference]: Finished difference Result 120 states and 207 transitions. [2021-08-26 14:45:14,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-26 14:45:14,508 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-26 14:45:14,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:14,508 INFO L225 Difference]: With dead ends: 120 [2021-08-26 14:45:14,508 INFO L226 Difference]: Without dead ends: 120 [2021-08-26 14:45:14,509 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 389.4ms TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2021-08-26 14:45:14,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-08-26 14:45:14,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 90. [2021-08-26 14:45:14,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 88 states have (on average 1.9318181818181819) internal successors, (170), 89 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 170 transitions. [2021-08-26 14:45:14,511 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 170 transitions. Word has length 17 [2021-08-26 14:45:14,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:14,511 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 170 transitions. [2021-08-26 14:45:14,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 170 transitions. [2021-08-26 14:45:14,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-26 14:45:14,512 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:14,512 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:45:14,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 14:45:14,513 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:14,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:14,513 INFO L82 PathProgramCache]: Analyzing trace with hash -92004612, now seen corresponding path program 1 times [2021-08-26 14:45:14,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:14,513 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438128660] [2021-08-26 14:45:14,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:14,513 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:14,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:45:14,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:14,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438128660] [2021-08-26 14:45:14,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438128660] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:14,868 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:14,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-26 14:45:14,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832281198] [2021-08-26 14:45:14,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 14:45:14,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:14,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 14:45:14,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-08-26 14:45:14,870 INFO L87 Difference]: Start difference. First operand 90 states and 170 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:15,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:15,183 INFO L93 Difference]: Finished difference Result 151 states and 262 transitions. [2021-08-26 14:45:15,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 14:45:15,183 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-26 14:45:15,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:15,184 INFO L225 Difference]: With dead ends: 151 [2021-08-26 14:45:15,184 INFO L226 Difference]: Without dead ends: 134 [2021-08-26 14:45:15,184 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 254.0ms TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-08-26 14:45:15,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-08-26 14:45:15,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 104. [2021-08-26 14:45:15,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 102 states have (on average 1.892156862745098) internal successors, (193), 103 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:15,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 193 transitions. [2021-08-26 14:45:15,186 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 193 transitions. Word has length 17 [2021-08-26 14:45:15,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:15,187 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 193 transitions. [2021-08-26 14:45:15,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:15,187 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 193 transitions. [2021-08-26 14:45:15,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-26 14:45:15,187 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:15,187 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:45:15,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 14:45:15,187 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:15,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:15,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1262518568, now seen corresponding path program 2 times [2021-08-26 14:45:15,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:15,188 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355744282] [2021-08-26 14:45:15,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:15,188 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:15,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:45:15,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:15,553 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355744282] [2021-08-26 14:45:15,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355744282] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:15,553 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:15,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-26 14:45:15,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801077263] [2021-08-26 14:45:15,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-26 14:45:15,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:15,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-26 14:45:15,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-08-26 14:45:15,555 INFO L87 Difference]: Start difference. First operand 104 states and 193 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:16,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:16,112 INFO L93 Difference]: Finished difference Result 156 states and 268 transitions. [2021-08-26 14:45:16,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-26 14:45:16,113 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-26 14:45:16,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:16,114 INFO L225 Difference]: With dead ends: 156 [2021-08-26 14:45:16,114 INFO L226 Difference]: Without dead ends: 156 [2021-08-26 14:45:16,114 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 385.5ms TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2021-08-26 14:45:16,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-08-26 14:45:16,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 119. [2021-08-26 14:45:16,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 117 states have (on average 1.8461538461538463) internal successors, (216), 118 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:16,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 216 transitions. [2021-08-26 14:45:16,117 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 216 transitions. Word has length 17 [2021-08-26 14:45:16,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:16,117 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 216 transitions. [2021-08-26 14:45:16,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:16,117 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 216 transitions. [2021-08-26 14:45:16,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-26 14:45:16,118 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:16,118 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:45:16,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-26 14:45:16,118 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:16,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:16,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1262518590, now seen corresponding path program 2 times [2021-08-26 14:45:16,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:16,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739981625] [2021-08-26 14:45:16,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:16,118 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:16,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:45:16,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:16,266 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739981625] [2021-08-26 14:45:16,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739981625] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:16,267 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:16,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 14:45:16,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166954214] [2021-08-26 14:45:16,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 14:45:16,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:16,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 14:45:16,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-26 14:45:16,268 INFO L87 Difference]: Start difference. First operand 119 states and 216 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:16,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:16,391 INFO L93 Difference]: Finished difference Result 170 states and 289 transitions. [2021-08-26 14:45:16,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 14:45:16,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-26 14:45:16,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:16,392 INFO L225 Difference]: With dead ends: 170 [2021-08-26 14:45:16,392 INFO L226 Difference]: Without dead ends: 157 [2021-08-26 14:45:16,393 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 62.7ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-08-26 14:45:16,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-08-26 14:45:16,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 108. [2021-08-26 14:45:16,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 106 states have (on average 1.8867924528301887) internal successors, (200), 107 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 200 transitions. [2021-08-26 14:45:16,395 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 200 transitions. Word has length 17 [2021-08-26 14:45:16,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:16,395 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 200 transitions. [2021-08-26 14:45:16,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:16,395 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 200 transitions. [2021-08-26 14:45:16,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-26 14:45:16,396 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:16,396 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:45:16,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-26 14:45:16,396 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:16,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:16,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1971188852, now seen corresponding path program 3 times [2021-08-26 14:45:16,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:16,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550001711] [2021-08-26 14:45:16,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:16,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:16,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:45:16,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:16,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550001711] [2021-08-26 14:45:16,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550001711] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:16,750 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:16,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-26 14:45:16,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188366866] [2021-08-26 14:45:16,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-26 14:45:16,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:16,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-26 14:45:16,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-08-26 14:45:16,751 INFO L87 Difference]: Start difference. First operand 108 states and 200 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:17,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:17,249 INFO L93 Difference]: Finished difference Result 165 states and 271 transitions. [2021-08-26 14:45:17,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 14:45:17,250 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-26 14:45:17,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:17,250 INFO L225 Difference]: With dead ends: 165 [2021-08-26 14:45:17,251 INFO L226 Difference]: Without dead ends: 158 [2021-08-26 14:45:17,251 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 354.8ms TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2021-08-26 14:45:17,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-08-26 14:45:17,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 108. [2021-08-26 14:45:17,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 106 states have (on average 1.8679245283018868) internal successors, (198), 107 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:17,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 198 transitions. [2021-08-26 14:45:17,253 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 198 transitions. Word has length 17 [2021-08-26 14:45:17,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:17,254 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 198 transitions. [2021-08-26 14:45:17,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:17,254 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 198 transitions. [2021-08-26 14:45:17,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-26 14:45:17,254 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:17,254 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:45:17,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-26 14:45:17,254 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:17,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:17,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1472634312, now seen corresponding path program 4 times [2021-08-26 14:45:17,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:17,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714082717] [2021-08-26 14:45:17,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:17,255 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:17,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:45:17,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:17,587 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714082717] [2021-08-26 14:45:17,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714082717] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:17,587 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:17,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-26 14:45:17,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577209446] [2021-08-26 14:45:17,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-26 14:45:17,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:17,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-26 14:45:17,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-08-26 14:45:17,589 INFO L87 Difference]: Start difference. First operand 108 states and 198 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:18,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:18,160 INFO L93 Difference]: Finished difference Result 161 states and 267 transitions. [2021-08-26 14:45:18,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 14:45:18,160 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-26 14:45:18,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:18,161 INFO L225 Difference]: With dead ends: 161 [2021-08-26 14:45:18,161 INFO L226 Difference]: Without dead ends: 144 [2021-08-26 14:45:18,162 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 413.8ms TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2021-08-26 14:45:18,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-08-26 14:45:18,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 100. [2021-08-26 14:45:18,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 98 states have (on average 1.8775510204081634) internal successors, (184), 99 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:18,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 184 transitions. [2021-08-26 14:45:18,165 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 184 transitions. Word has length 17 [2021-08-26 14:45:18,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:18,165 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 184 transitions. [2021-08-26 14:45:18,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:18,165 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 184 transitions. [2021-08-26 14:45:18,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-26 14:45:18,165 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:18,165 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:45:18,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-26 14:45:18,166 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:18,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:18,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1231075460, now seen corresponding path program 5 times [2021-08-26 14:45:18,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:18,167 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617055250] [2021-08-26 14:45:18,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:18,167 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:18,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:45:18,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:18,523 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617055250] [2021-08-26 14:45:18,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617055250] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:18,523 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:18,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-26 14:45:18,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099035232] [2021-08-26 14:45:18,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 14:45:18,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:18,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 14:45:18,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-08-26 14:45:18,525 INFO L87 Difference]: Start difference. First operand 100 states and 184 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:18,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:18,930 INFO L93 Difference]: Finished difference Result 185 states and 316 transitions. [2021-08-26 14:45:18,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-26 14:45:18,930 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-26 14:45:18,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:18,931 INFO L225 Difference]: With dead ends: 185 [2021-08-26 14:45:18,931 INFO L226 Difference]: Without dead ends: 168 [2021-08-26 14:45:18,932 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 304.1ms TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2021-08-26 14:45:18,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-08-26 14:45:18,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 104. [2021-08-26 14:45:18,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 102 states have (on average 1.8627450980392157) internal successors, (190), 103 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:18,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 190 transitions. [2021-08-26 14:45:18,934 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 190 transitions. Word has length 17 [2021-08-26 14:45:18,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:18,934 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 190 transitions. [2021-08-26 14:45:18,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:18,934 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 190 transitions. [2021-08-26 14:45:18,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-26 14:45:18,935 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:18,935 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:45:18,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-26 14:45:18,935 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:18,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:18,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1963202090, now seen corresponding path program 6 times [2021-08-26 14:45:18,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:18,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653415701] [2021-08-26 14:45:18,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:18,936 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:45:19,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:45:19,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:45:19,244 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653415701] [2021-08-26 14:45:19,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653415701] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:45:19,244 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:45:19,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-26 14:45:19,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366887946] [2021-08-26 14:45:19,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 14:45:19,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:45:19,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 14:45:19,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-08-26 14:45:19,245 INFO L87 Difference]: Start difference. First operand 104 states and 190 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:19,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:45:19,648 INFO L93 Difference]: Finished difference Result 164 states and 281 transitions. [2021-08-26 14:45:19,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-26 14:45:19,649 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-26 14:45:19,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:45:19,649 INFO L225 Difference]: With dead ends: 164 [2021-08-26 14:45:19,649 INFO L226 Difference]: Without dead ends: 151 [2021-08-26 14:45:19,650 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 328.0ms TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-08-26 14:45:19,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-08-26 14:45:19,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 105. [2021-08-26 14:45:19,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 103 states have (on average 1.854368932038835) internal successors, (191), 104 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:19,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 191 transitions. [2021-08-26 14:45:19,652 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 191 transitions. Word has length 17 [2021-08-26 14:45:19,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:45:19,652 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 191 transitions. [2021-08-26 14:45:19,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:45:19,652 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 191 transitions. [2021-08-26 14:45:19,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-26 14:45:19,652 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:45:19,653 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:45:19,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-26 14:45:19,653 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-08-26 14:45:19,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:45:19,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1015607902, now seen corresponding path program 7 times [2021-08-26 14:45:19,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:45:19,653 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656773141] [2021-08-26 14:45:19,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:45:19,653 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:45:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 14:45:19,677 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 14:45:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 14:45:19,716 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-26 14:45:19,716 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 14:45:19,717 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:45:19,718 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:45:19,718 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:45:19,719 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:45:19,719 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:45:19,719 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:45:19,719 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-26 14:45:19,719 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-26 14:45:19,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-26 14:45:19,723 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-26 14:45:19,723 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 14:45:19,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 02:45:19 BasicIcfg [2021-08-26 14:45:19,778 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 14:45:19,779 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 14:45:19,779 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 14:45:19,779 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 14:45:19,779 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:44:15" (3/4) ... [2021-08-26 14:45:19,780 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-26 14:45:19,811 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 14:45:19,812 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 14:45:19,813 INFO L168 Benchmark]: Toolchain (without parser) took 65267.46 ms. Allocated memory was 67.1 MB in the beginning and 247.5 MB in the end (delta: 180.4 MB). Free memory was 49.4 MB in the beginning and 201.5 MB in the end (delta: -152.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 16.1 GB. [2021-08-26 14:45:19,813 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 50.3 MB. Free memory is still 31.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 14:45:19,813 INFO L168 Benchmark]: CACSL2BoogieTranslator took 589.29 ms. Allocated memory is still 67.1 MB. Free memory was 49.1 MB in the beginning and 34.0 MB in the end (delta: 15.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 16.1 GB. [2021-08-26 14:45:19,813 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.10 ms. Allocated memory is still 67.1 MB. Free memory was 34.0 MB in the beginning and 30.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 14:45:19,814 INFO L168 Benchmark]: Boogie Preprocessor took 44.88 ms. Allocated memory was 67.1 MB in the beginning and 109.1 MB in the end (delta: 41.9 MB). Free memory was 30.7 MB in the beginning and 84.6 MB in the end (delta: -53.9 MB). Peak memory consumption was 2.4 MB. Max. memory is 16.1 GB. [2021-08-26 14:45:19,814 INFO L168 Benchmark]: RCFGBuilder took 590.68 ms. Allocated memory is still 109.1 MB. Free memory was 84.0 MB in the beginning and 65.1 MB in the end (delta: 18.9 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. [2021-08-26 14:45:19,814 INFO L168 Benchmark]: TraceAbstraction took 63927.43 ms. Allocated memory was 109.1 MB in the beginning and 247.5 MB in the end (delta: 138.4 MB). Free memory was 64.4 MB in the beginning and 208.9 MB in the end (delta: -144.5 MB). Peak memory consumption was 131.7 MB. Max. memory is 16.1 GB. [2021-08-26 14:45:19,815 INFO L168 Benchmark]: Witness Printer took 33.15 ms. Allocated memory is still 247.5 MB. Free memory was 208.9 MB in the beginning and 201.5 MB in the end (delta: 7.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-08-26 14:45:19,816 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 50.3 MB. Free memory is still 31.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 589.29 ms. Allocated memory is still 67.1 MB. Free memory was 49.1 MB in the beginning and 34.0 MB in the end (delta: 15.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 77.10 ms. Allocated memory is still 67.1 MB. Free memory was 34.0 MB in the beginning and 30.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 44.88 ms. Allocated memory was 67.1 MB in the beginning and 109.1 MB in the end (delta: 41.9 MB). Free memory was 30.7 MB in the beginning and 84.6 MB in the end (delta: -53.9 MB). Peak memory consumption was 2.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 590.68 ms. Allocated memory is still 109.1 MB. Free memory was 84.0 MB in the beginning and 65.1 MB in the end (delta: 18.9 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 63927.43 ms. Allocated memory was 109.1 MB in the beginning and 247.5 MB in the end (delta: 138.4 MB). Free memory was 64.4 MB in the beginning and 208.9 MB in the end (delta: -144.5 MB). Peak memory consumption was 131.7 MB. Max. memory is 16.1 GB. * Witness Printer took 33.15 ms. Allocated memory is still 247.5 MB. Free memory was 208.9 MB in the beginning and 201.5 MB in the end (delta: 7.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 56543.0ms, 158 PlacesBefore, 35 PlacesAfterwards, 160 TransitionsBefore, 31 TransitionsAfterwards, 1836 CoEnabledTransitionPairs, 8 FixpointIterations, 113 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 16 ConcurrentYvCompositions, 6 ChoiceCompositions, 198 TotalNumberOfCompositions, 3822 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1777, positive: 1614, positive conditional: 0, positive unconditional: 1614, negative: 163, negative conditional: 0, negative unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1270, positive: 1212, positive conditional: 0, positive unconditional: 1212, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1270, positive: 1211, positive conditional: 0, positive unconditional: 1211, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 59, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41074, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 609, negative conditional: 0, negative unconditional: 609, unknown: 40430, unknown conditional: 0, unknown unconditional: 40430] ], Cache Queries: [ total: 1777, positive: 402, positive conditional: 0, positive unconditional: 402, negative: 105, negative conditional: 0, negative unconditional: 105, unknown: 1270, unknown conditional: 0, unknown unconditional: 1270] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 27, Positive conditional cache size: 0, Positive unconditional cache size: 27, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1675]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1676] 0 pthread_t t1,t2; [L1688] 0 struct device *my_dev; [L1727] 0 return 0; [L1733] 0 int ret = my_drv_init(); [L1734] COND TRUE 0 ret==0 [L1735] 0 int probe_ret; [L1736] 0 struct my_data data; [L1705] 0 data->shared.a = 0 [L1706] 0 data->shared.b = 0 [L1707] 0 data->shared.a [L1675] COND FALSE 0 !(!expression) [L1708] 0 data->shared.b [L1675] COND FALSE 0 !(!expression) [L1709] 0 int res = __VERIFIER_nondet_int(); [L1710] COND FALSE 0 !(\read(res)) [L1712] 0 my_dev = &data->dev [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, my_dev={7:24}, t1={6:0}, t2={8:0}] [L1690] 1 struct my_data *data; [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1693] 1 data->shared.a = 1 VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, my_dev={7:24}, t1={6:0}, t2={8:0}] [L1696] EXPR 1 data->shared.b [L1696] 1 int lb = data->shared.b; [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, lb=0, my_dev={7:24}, t1={6:0}, t2={8:0}] [L1715] 0 return 0; [L1737] 0 probe_ret = my_drv_probe(&data) VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, lb=0, my_dev={7:24}, t1={6:0}, t2={8:0}] [L1738] COND TRUE 0 probe_ret==0 [L1721] 0 void *status; [L1722] 0 \read(t1) VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, lb=0, my_dev={7:24}, t1={6:0}, t2={8:0}] [L1690] 2 struct my_data *data; [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1691] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1693] 2 data->shared.a = 1 VAL [__mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, lb=0, my_dev={7:24}, t1={6:0}, t2={8:0}] [L1696] EXPR 2 data->shared.b [L1696] 2 int lb = data->shared.b; [L1699] 1 data->shared.b = lb + 1 [L1701] 1 return 0; [L1699] 2 data->shared.b = lb + 1 [L1701] 2 return 0; [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, lb=0, my_dev={7:24}, t1={6:0}, t2={8:0}] [L1723] 0 \read(t2) VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, lb=0, my_dev={7:24}, t1={6:0}, t2={8:0}] [L1723] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, lb=0, my_dev={7:24}, t1={6:0}, t2={8:0}] [L1740] 0 data.shared.a [L1675] COND FALSE 0 !(!expression) [L1741] 0 data.shared.b [L1675] COND TRUE 0 !expression [L1675] 0 reach_error() VAL [\result={0:0}, __mptr={7:24}, arg={0:0}, arg={0:0}, data={7:0}, lb=0, my_dev={7:24}, t1={6:0}, t2={8:0}] - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1713]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1714]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 164 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 63804.4ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 15.2ms, AutomataDifference: 3648.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 56606.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 226 SDtfs, 395 SDslu, 529 SDs, 0 SdLazy, 1842 SolverSat, 228 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1507.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 2510.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=238occurred in iteration=3, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 82.1ms AutomataMinimizationTime, 12 MinimizatonAttempts, 395 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 29.0ms SsaConstructionTime, 413.8ms SatisfiabilityAnalysisTime, 2639.2ms InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 2969 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-26 14:45:19,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...