./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe011_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 997cd7c3 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/pthread-wmm/safe011_rmo.oepc.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 a0cb5dc184dac0001c61c2131f6ae5a7bfabf957 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-997cd7c-m [2021-09-22 14:49:22,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-22 14:49:22,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-22 14:49:22,056 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-22 14:49:22,057 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-22 14:49:22,060 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-22 14:49:22,061 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-22 14:49:22,066 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-22 14:49:22,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-22 14:49:22,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-22 14:49:22,073 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-22 14:49:22,076 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-22 14:49:22,077 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-22 14:49:22,079 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-22 14:49:22,080 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-22 14:49:22,083 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-22 14:49:22,084 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-22 14:49:22,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-22 14:49:22,087 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-22 14:49:22,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-22 14:49:22,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-22 14:49:22,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-22 14:49:22,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-22 14:49:22,097 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-22 14:49:22,103 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-22 14:49:22,103 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-22 14:49:22,104 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-22 14:49:22,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-22 14:49:22,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-22 14:49:22,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-22 14:49:22,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-22 14:49:22,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-22 14:49:22,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-22 14:49:22,115 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-22 14:49:22,116 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-22 14:49:22,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-22 14:49:22,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-22 14:49:22,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-22 14:49:22,117 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-22 14:49:22,118 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-22 14:49:22,119 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-22 14:49:22,120 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-09-22 14:49:22,155 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-22 14:49:22,156 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-22 14:49:22,157 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-22 14:49:22,157 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-22 14:49:22,159 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-22 14:49:22,159 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-22 14:49:22,159 INFO L138 SettingsManager]: * Use SBE=true [2021-09-22 14:49:22,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-22 14:49:22,160 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-22 14:49:22,160 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-22 14:49:22,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-22 14:49:22,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-22 14:49:22,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-22 14:49:22,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-22 14:49:22,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-22 14:49:22,162 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-22 14:49:22,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-22 14:49:22,162 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-22 14:49:22,162 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-22 14:49:22,162 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-22 14:49:22,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-22 14:49:22,163 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-22 14:49:22,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-22 14:49:22,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-22 14:49:22,163 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-22 14:49:22,164 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-22 14:49:22,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-22 14:49:22,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-22 14:49:22,164 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-22 14:49:22,164 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-22 14:49:22,164 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 -> a0cb5dc184dac0001c61c2131f6ae5a7bfabf957 [2021-09-22 14:49:22,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-22 14:49:22,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-22 14:49:22,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-22 14:49:22,459 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-22 14:49:22,460 INFO L275 PluginConnector]: CDTParser initialized [2021-09-22 14:49:22,461 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe011_rmo.oepc.i [2021-09-22 14:49:22,524 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/191e6d9ea/1a592d6fca7e4908b333de160106e886/FLAG8f9bbace5 [2021-09-22 14:49:23,009 INFO L306 CDTParser]: Found 1 translation units. [2021-09-22 14:49:23,009 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe011_rmo.oepc.i [2021-09-22 14:49:23,039 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/191e6d9ea/1a592d6fca7e4908b333de160106e886/FLAG8f9bbace5 [2021-09-22 14:49:23,338 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/191e6d9ea/1a592d6fca7e4908b333de160106e886 [2021-09-22 14:49:23,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-22 14:49:23,342 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-22 14:49:23,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-22 14:49:23,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-22 14:49:23,348 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-22 14:49:23,349 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 02:49:23" (1/1) ... [2021-09-22 14:49:23,350 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48b3ef24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:49:23, skipping insertion in model container [2021-09-22 14:49:23,350 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 02:49:23" (1/1) ... [2021-09-22 14:49:23,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-22 14:49:23,404 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-22 14:49:23,566 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/pthread-wmm/safe011_rmo.oepc.i[950,963] [2021-09-22 14:49:23,837 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-22 14:49:23,851 INFO L203 MainTranslator]: Completed pre-run [2021-09-22 14:49:23,864 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/pthread-wmm/safe011_rmo.oepc.i[950,963] [2021-09-22 14:49:23,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-22 14:49:23,974 INFO L208 MainTranslator]: Completed translation [2021-09-22 14:49:23,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:49:23 WrapperNode [2021-09-22 14:49:23,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-22 14:49:23,978 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-22 14:49:23,978 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-22 14:49:23,978 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-22 14:49:23,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:49:23" (1/1) ... [2021-09-22 14:49:24,019 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:49:23" (1/1) ... [2021-09-22 14:49:24,060 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-22 14:49:24,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-22 14:49:24,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-22 14:49:24,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-22 14:49:24,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:49:23" (1/1) ... [2021-09-22 14:49:24,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:49:23" (1/1) ... [2021-09-22 14:49:24,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:49:23" (1/1) ... [2021-09-22 14:49:24,089 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:49:23" (1/1) ... [2021-09-22 14:49:24,096 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:49:23" (1/1) ... [2021-09-22 14:49:24,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:49:23" (1/1) ... [2021-09-22 14:49:24,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:49:23" (1/1) ... [2021-09-22 14:49:24,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-22 14:49:24,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-22 14:49:24,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-22 14:49:24,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-22 14:49:24,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:49:23" (1/1) ... [2021-09-22 14:49:24,131 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-22 14:49:24,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-22 14:49:24,161 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-09-22 14:49:24,172 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-09-22 14:49:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-09-22 14:49:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-09-22 14:49:24,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-22 14:49:24,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-09-22 14:49:24,196 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-09-22 14:49:24,196 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-09-22 14:49:24,196 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-09-22 14:49:24,197 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-09-22 14:49:24,197 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-09-22 14:49:24,197 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-09-22 14:49:24,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-22 14:49:24,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-09-22 14:49:24,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-22 14:49:24,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-22 14:49:24,199 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-09-22 14:49:25,806 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-22 14:49:25,807 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-09-22 14:49:25,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 02:49:25 BoogieIcfgContainer [2021-09-22 14:49:25,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-22 14:49:25,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-22 14:49:25,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-22 14:49:25,814 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-22 14:49:25,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.09 02:49:23" (1/3) ... [2021-09-22 14:49:25,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e67f324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 02:49:25, skipping insertion in model container [2021-09-22 14:49:25,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:49:23" (2/3) ... [2021-09-22 14:49:25,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e67f324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 02:49:25, skipping insertion in model container [2021-09-22 14:49:25,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 02:49:25" (3/3) ... [2021-09-22 14:49:25,816 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_rmo.oepc.i [2021-09-22 14:49:25,821 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-09-22 14:49:25,821 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-22 14:49:25,821 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-09-22 14:49:25,821 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-09-22 14:49:25,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,848 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,849 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,849 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,849 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,849 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,850 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,850 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,851 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,851 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,851 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,851 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,851 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,851 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,852 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,852 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,852 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,852 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,852 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,855 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,855 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,855 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,856 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,859 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,860 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,860 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,860 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,866 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,866 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,866 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,867 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,867 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,867 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,867 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,867 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,867 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,867 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,868 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,868 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,869 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,870 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,870 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,870 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,870 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,870 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,870 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,871 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,871 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,871 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,872 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,872 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,874 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:49:25,875 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-09-22 14:49:25,918 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-22 14:49:25,931 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-09-22 14:49:25,932 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-09-22 14:49:25,949 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-09-22 14:49:25,957 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 106 transitions, 227 flow [2021-09-22 14:49:25,961 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 106 transitions, 227 flow [2021-09-22 14:49:25,962 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2021-09-22 14:49:26,006 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2021-09-22 14:49:26,006 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-09-22 14:49:26,009 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2021-09-22 14:49:26,012 INFO L116 LiptonReduction]: Number of co-enabled transitions 1876 [2021-09-22 14:49:41,899 INFO L131 LiptonReduction]: Checked pairs total: 5073 [2021-09-22 14:49:41,899 INFO L133 LiptonReduction]: Total number of compositions: 91 [2021-09-22 14:49:41,917 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2021-09-22 14:49:41,956 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 724 states, 721 states have (on average 3.116504854368932) internal successors, (2247), 723 states have internal predecessors, (2247), 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-09-22 14:49:41,962 INFO L276 IsEmpty]: Start isEmpty. Operand has 724 states, 721 states have (on average 3.116504854368932) internal successors, (2247), 723 states have internal predecessors, (2247), 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-09-22 14:49:41,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-09-22 14:49:41,966 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:49:41,966 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-09-22 14:49:41,967 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:49:41,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:49:41,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1086320, now seen corresponding path program 1 times [2021-09-22 14:49:41,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:49:41,982 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462207719] [2021-09-22 14:49:41,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:49:41,983 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:49:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:49:42,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:49:42,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:49:42,162 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462207719] [2021-09-22 14:49:42,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462207719] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:49:42,162 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:49:42,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-09-22 14:49:42,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673856157] [2021-09-22 14:49:42,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-09-22 14:49:42,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:49:42,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-09-22 14:49:42,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:49:42,185 INFO L87 Difference]: Start difference. First operand has 724 states, 721 states have (on average 3.116504854368932) internal successors, (2247), 723 states have internal predecessors, (2247), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-09-22 14:49:42,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:49:42,273 INFO L93 Difference]: Finished difference Result 587 states and 1790 transitions. [2021-09-22 14:49:42,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-09-22 14:49:42,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2021-09-22 14:49:42,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:49:42,290 INFO L225 Difference]: With dead ends: 587 [2021-09-22 14:49:42,290 INFO L226 Difference]: Without dead ends: 562 [2021-09-22 14:49:42,291 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:49:42,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2021-09-22 14:49:42,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2021-09-22 14:49:42,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 561 states have (on average 3.0748663101604277) internal successors, (1725), 561 states have internal predecessors, (1725), 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-09-22 14:49:42,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2021-09-22 14:49:42,393 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 3 [2021-09-22 14:49:42,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:49:42,394 INFO L470 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2021-09-22 14:49:42,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-09-22 14:49:42,394 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2021-09-22 14:49:42,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-09-22 14:49:42,396 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:49:42,396 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:49:42,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-22 14:49:42,396 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:49:42,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:49:42,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1056249650, now seen corresponding path program 1 times [2021-09-22 14:49:42,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:49:42,398 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732213110] [2021-09-22 14:49:42,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:49:42,398 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:49:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:49:42,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-09-22 14:49:42,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:49:42,553 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732213110] [2021-09-22 14:49:42,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732213110] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:49:42,553 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:49:42,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-09-22 14:49:42,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769464298] [2021-09-22 14:49:42,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-09-22 14:49:42,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:49:42,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-09-22 14:49:42,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:49:42,560 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-09-22 14:49:42,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:49:42,575 INFO L93 Difference]: Finished difference Result 552 states and 1687 transitions. [2021-09-22 14:49:42,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-09-22 14:49:42,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2021-09-22 14:49:42,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:49:42,583 INFO L225 Difference]: With dead ends: 552 [2021-09-22 14:49:42,583 INFO L226 Difference]: Without dead ends: 552 [2021-09-22 14:49:42,584 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:49:42,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2021-09-22 14:49:42,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2021-09-22 14:49:42,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 551 states have (on average 3.061705989110708) internal successors, (1687), 551 states have internal predecessors, (1687), 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-09-22 14:49:42,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1687 transitions. [2021-09-22 14:49:42,607 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1687 transitions. Word has length 9 [2021-09-22 14:49:42,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:49:42,608 INFO L470 AbstractCegarLoop]: Abstraction has 552 states and 1687 transitions. [2021-09-22 14:49:42,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-09-22 14:49:42,608 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1687 transitions. [2021-09-22 14:49:42,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-09-22 14:49:42,610 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:49:42,610 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:49:42,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-09-22 14:49:42,610 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:49:42,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:49:42,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1616791615, now seen corresponding path program 1 times [2021-09-22 14:49:42,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:49:42,612 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929987288] [2021-09-22 14:49:42,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:49:42,612 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:49:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:49:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:49:42,771 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:49:42,771 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929987288] [2021-09-22 14:49:42,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929987288] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:49:42,772 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:49:42,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-09-22 14:49:42,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258385214] [2021-09-22 14:49:42,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-09-22 14:49:42,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:49:42,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-09-22 14:49:42,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:49:42,774 INFO L87 Difference]: Start difference. First operand 552 states and 1687 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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-09-22 14:49:42,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:49:42,784 INFO L93 Difference]: Finished difference Result 529 states and 1605 transitions. [2021-09-22 14:49:42,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-09-22 14:49:42,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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-09-22 14:49:42,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:49:42,788 INFO L225 Difference]: With dead ends: 529 [2021-09-22 14:49:42,789 INFO L226 Difference]: Without dead ends: 529 [2021-09-22 14:49:42,789 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:49:42,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2021-09-22 14:49:42,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2021-09-22 14:49:42,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 3.039772727272727) internal successors, (1605), 528 states have internal predecessors, (1605), 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-09-22 14:49:42,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1605 transitions. [2021-09-22 14:49:42,806 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1605 transitions. Word has length 10 [2021-09-22 14:49:42,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:49:42,806 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 1605 transitions. [2021-09-22 14:49:42,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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-09-22 14:49:42,807 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1605 transitions. [2021-09-22 14:49:42,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-09-22 14:49:42,809 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:49:42,809 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:49:42,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-09-22 14:49:42,809 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:49:42,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:49:42,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1387798897, now seen corresponding path program 1 times [2021-09-22 14:49:42,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:49:42,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602349534] [2021-09-22 14:49:42,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:49:42,811 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:49:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:49:42,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:49:42,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:49:42,898 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602349534] [2021-09-22 14:49:42,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602349534] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:49:42,898 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:49:42,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-22 14:49:42,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444322056] [2021-09-22 14:49:42,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:49:42,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:49:42,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:49:42,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:49:42,900 INFO L87 Difference]: Start difference. First operand 529 states and 1605 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-09-22 14:49:42,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:49:42,922 INFO L93 Difference]: Finished difference Result 677 states and 2012 transitions. [2021-09-22 14:49:42,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-22 14:49:42,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2021-09-22 14:49:42,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:49:42,925 INFO L225 Difference]: With dead ends: 677 [2021-09-22 14:49:42,926 INFO L226 Difference]: Without dead ends: 377 [2021-09-22 14:49:42,926 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:49:42,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-09-22 14:49:42,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2021-09-22 14:49:42,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 2.8643617021276597) internal successors, (1077), 376 states have internal predecessors, (1077), 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-09-22 14:49:42,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1077 transitions. [2021-09-22 14:49:42,938 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1077 transitions. Word has length 11 [2021-09-22 14:49:42,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:49:42,938 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 1077 transitions. [2021-09-22 14:49:42,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-09-22 14:49:42,939 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1077 transitions. [2021-09-22 14:49:42,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-09-22 14:49:42,940 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:49:42,940 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:49:42,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-09-22 14:49:42,940 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:49:42,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:49:42,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1041365036, now seen corresponding path program 1 times [2021-09-22 14:49:42,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:49:42,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9976277] [2021-09-22 14:49:42,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:49:42,942 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:49:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:49:43,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:49:43,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:49:43,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9976277] [2021-09-22 14:49:43,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9976277] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:49:43,057 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:49:43,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-09-22 14:49:43,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492059676] [2021-09-22 14:49:43,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-09-22 14:49:43,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:49:43,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-09-22 14:49:43,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:49:43,059 INFO L87 Difference]: Start difference. First operand 377 states and 1077 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-09-22 14:49:43,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:49:43,090 INFO L93 Difference]: Finished difference Result 374 states and 1066 transitions. [2021-09-22 14:49:43,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-09-22 14:49:43,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2021-09-22 14:49:43,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:49:43,093 INFO L225 Difference]: With dead ends: 374 [2021-09-22 14:49:43,094 INFO L226 Difference]: Without dead ends: 374 [2021-09-22 14:49:43,094 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:49:43,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2021-09-22 14:49:43,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2021-09-22 14:49:43,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 373 states have (on average 2.8579088471849867) internal successors, (1066), 373 states have internal predecessors, (1066), 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-09-22 14:49:43,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1066 transitions. [2021-09-22 14:49:43,105 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1066 transitions. Word has length 12 [2021-09-22 14:49:43,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:49:43,106 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 1066 transitions. [2021-09-22 14:49:43,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-09-22 14:49:43,106 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1066 transitions. [2021-09-22 14:49:43,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-09-22 14:49:43,108 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:49:43,109 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:49:43,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-09-22 14:49:43,109 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:49:43,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:49:43,111 INFO L82 PathProgramCache]: Analyzing trace with hash 561230875, now seen corresponding path program 1 times [2021-09-22 14:49:43,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:49:43,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614357157] [2021-09-22 14:49:43,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:49:43,113 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:49:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:49:43,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:49:43,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:49:43,268 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614357157] [2021-09-22 14:49:43,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614357157] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:49:43,273 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:49:43,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:49:43,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615211653] [2021-09-22 14:49:43,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-22 14:49:43,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:49:43,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-22 14:49:43,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:49:43,275 INFO L87 Difference]: Start difference. First operand 374 states and 1066 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-09-22 14:49:43,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:49:43,351 INFO L93 Difference]: Finished difference Result 388 states and 1108 transitions. [2021-09-22 14:49:43,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:49:43,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2021-09-22 14:49:43,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:49:43,354 INFO L225 Difference]: With dead ends: 388 [2021-09-22 14:49:43,354 INFO L226 Difference]: Without dead ends: 388 [2021-09-22 14:49:43,355 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.3ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:49:43,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-09-22 14:49:43,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2021-09-22 14:49:43,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 387 states have (on average 2.863049095607235) internal successors, (1108), 387 states have internal predecessors, (1108), 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-09-22 14:49:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1108 transitions. [2021-09-22 14:49:43,366 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1108 transitions. Word has length 13 [2021-09-22 14:49:43,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:49:43,367 INFO L470 AbstractCegarLoop]: Abstraction has 388 states and 1108 transitions. [2021-09-22 14:49:43,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-09-22 14:49:43,368 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1108 transitions. [2021-09-22 14:49:43,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-09-22 14:49:43,369 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:49:43,369 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:49:43,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-09-22 14:49:43,370 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:49:43,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:49:43,373 INFO L82 PathProgramCache]: Analyzing trace with hash -2075894361, now seen corresponding path program 2 times [2021-09-22 14:49:43,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:49:43,374 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168698365] [2021-09-22 14:49:43,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:49:43,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:49:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:49:43,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:49:43,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:49:43,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168698365] [2021-09-22 14:49:43,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168698365] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:49:43,494 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:49:43,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:49:43,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315025739] [2021-09-22 14:49:43,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-22 14:49:43,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:49:43,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-22 14:49:43,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:49:43,495 INFO L87 Difference]: Start difference. First operand 388 states and 1108 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-09-22 14:49:43,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:49:43,555 INFO L93 Difference]: Finished difference Result 418 states and 1196 transitions. [2021-09-22 14:49:43,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-22 14:49:43,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2021-09-22 14:49:43,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:49:43,558 INFO L225 Difference]: With dead ends: 418 [2021-09-22 14:49:43,558 INFO L226 Difference]: Without dead ends: 418 [2021-09-22 14:49:43,559 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 27.0ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-09-22 14:49:43,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-09-22 14:49:43,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2021-09-22 14:49:43,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 2.86810551558753) internal successors, (1196), 417 states have internal predecessors, (1196), 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-09-22 14:49:43,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1196 transitions. [2021-09-22 14:49:43,570 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 1196 transitions. Word has length 13 [2021-09-22 14:49:43,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:49:43,571 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 1196 transitions. [2021-09-22 14:49:43,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-09-22 14:49:43,571 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 1196 transitions. [2021-09-22 14:49:43,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-09-22 14:49:43,572 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:49:43,572 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:49:43,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-09-22 14:49:43,573 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:49:43,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:49:43,573 INFO L82 PathProgramCache]: Analyzing trace with hash -2077423746, now seen corresponding path program 1 times [2021-09-22 14:49:43,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:49:43,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888857523] [2021-09-22 14:49:43,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:49:43,574 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:49:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:49:43,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:49:43,653 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:49:43,653 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888857523] [2021-09-22 14:49:43,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888857523] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:49:43,653 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:49:43,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-22 14:49:43,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448105050] [2021-09-22 14:49:43,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:49:43,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:49:43,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:49:43,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:49:43,655 INFO L87 Difference]: Start difference. First operand 418 states and 1196 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-09-22 14:49:43,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:49:43,713 INFO L93 Difference]: Finished difference Result 425 states and 1218 transitions. [2021-09-22 14:49:43,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-22 14:49:43,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2021-09-22 14:49:43,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:49:43,720 INFO L225 Difference]: With dead ends: 425 [2021-09-22 14:49:43,720 INFO L226 Difference]: Without dead ends: 425 [2021-09-22 14:49:43,720 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:49:43,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2021-09-22 14:49:43,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 421. [2021-09-22 14:49:43,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 2.8666666666666667) internal successors, (1204), 420 states have internal predecessors, (1204), 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-09-22 14:49:43,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1204 transitions. [2021-09-22 14:49:43,732 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1204 transitions. Word has length 13 [2021-09-22 14:49:43,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:49:43,734 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 1204 transitions. [2021-09-22 14:49:43,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-09-22 14:49:43,734 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1204 transitions. [2021-09-22 14:49:43,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-09-22 14:49:43,735 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:49:43,735 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:49:43,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-09-22 14:49:43,736 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:49:43,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:49:43,736 INFO L82 PathProgramCache]: Analyzing trace with hash 2125806490, now seen corresponding path program 2 times [2021-09-22 14:49:43,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:49:43,740 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885048590] [2021-09-22 14:49:43,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:49:43,743 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:49:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:49:43,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:49:43,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:49:43,840 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885048590] [2021-09-22 14:49:43,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885048590] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:49:43,841 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:49:43,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:49:43,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618983258] [2021-09-22 14:49:43,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-22 14:49:43,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:49:43,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-22 14:49:43,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:49:43,844 INFO L87 Difference]: Start difference. First operand 421 states and 1204 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-09-22 14:49:43,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:49:43,902 INFO L93 Difference]: Finished difference Result 440 states and 1263 transitions. [2021-09-22 14:49:43,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:49:43,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2021-09-22 14:49:43,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:49:43,907 INFO L225 Difference]: With dead ends: 440 [2021-09-22 14:49:43,907 INFO L226 Difference]: Without dead ends: 440 [2021-09-22 14:49:43,907 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 15.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:49:43,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-09-22 14:49:43,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 431. [2021-09-22 14:49:43,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 430 states have (on average 2.8674418604651164) internal successors, (1233), 430 states have internal predecessors, (1233), 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-09-22 14:49:43,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1233 transitions. [2021-09-22 14:49:43,919 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 1233 transitions. Word has length 13 [2021-09-22 14:49:43,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:49:43,919 INFO L470 AbstractCegarLoop]: Abstraction has 431 states and 1233 transitions. [2021-09-22 14:49:43,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-09-22 14:49:43,919 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 1233 transitions. [2021-09-22 14:49:43,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-09-22 14:49:43,920 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:49:43,920 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:49:43,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-09-22 14:49:43,921 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:49:43,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:49:43,921 INFO L82 PathProgramCache]: Analyzing trace with hash 218267661, now seen corresponding path program 1 times [2021-09-22 14:49:43,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:49:43,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574464462] [2021-09-22 14:49:43,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:49:43,922 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:49:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:49:44,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:49:44,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:49:44,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574464462] [2021-09-22 14:49:44,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574464462] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:49:44,040 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:49:44,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-22 14:49:44,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215048894] [2021-09-22 14:49:44,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-22 14:49:44,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:49:44,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-22 14:49:44,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-09-22 14:49:44,041 INFO L87 Difference]: Start difference. First operand 431 states and 1233 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-09-22 14:49:44,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:49:44,099 INFO L93 Difference]: Finished difference Result 427 states and 1219 transitions. [2021-09-22 14:49:44,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-22 14:49:44,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2021-09-22 14:49:44,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:49:44,102 INFO L225 Difference]: With dead ends: 427 [2021-09-22 14:49:44,102 INFO L226 Difference]: Without dead ends: 427 [2021-09-22 14:49:44,103 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.0ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-09-22 14:49:44,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-09-22 14:49:44,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 395. [2021-09-22 14:49:44,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 394 states have (on average 2.850253807106599) internal successors, (1123), 394 states have internal predecessors, (1123), 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-09-22 14:49:44,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1123 transitions. [2021-09-22 14:49:44,113 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1123 transitions. Word has length 14 [2021-09-22 14:49:44,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:49:44,114 INFO L470 AbstractCegarLoop]: Abstraction has 395 states and 1123 transitions. [2021-09-22 14:49:44,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-09-22 14:49:44,114 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1123 transitions. [2021-09-22 14:49:44,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-09-22 14:49:44,115 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:49:44,115 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:49:44,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-09-22 14:49:44,115 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:49:44,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:49:44,116 INFO L82 PathProgramCache]: Analyzing trace with hash 71782755, now seen corresponding path program 1 times [2021-09-22 14:49:44,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:49:44,116 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172421541] [2021-09-22 14:49:44,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:49:44,117 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:49:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:49:44,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:49:44,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:49:44,200 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172421541] [2021-09-22 14:49:44,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172421541] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:49:44,201 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:49:44,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:49:44,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851281043] [2021-09-22 14:49:44,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-22 14:49:44,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:49:44,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-22 14:49:44,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:49:44,202 INFO L87 Difference]: Start difference. First operand 395 states and 1123 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-09-22 14:49:44,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:49:44,269 INFO L93 Difference]: Finished difference Result 438 states and 1241 transitions. [2021-09-22 14:49:44,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-22 14:49:44,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2021-09-22 14:49:44,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:49:44,271 INFO L225 Difference]: With dead ends: 438 [2021-09-22 14:49:44,272 INFO L226 Difference]: Without dead ends: 438 [2021-09-22 14:49:44,272 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.3ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-09-22 14:49:44,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-09-22 14:49:44,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 389. [2021-09-22 14:49:44,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 2.8402061855670104) internal successors, (1102), 388 states have internal predecessors, (1102), 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-09-22 14:49:44,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1102 transitions. [2021-09-22 14:49:44,282 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1102 transitions. Word has length 14 [2021-09-22 14:49:44,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:49:44,282 INFO L470 AbstractCegarLoop]: Abstraction has 389 states and 1102 transitions. [2021-09-22 14:49:44,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-09-22 14:49:44,282 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1102 transitions. [2021-09-22 14:49:44,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-09-22 14:49:44,283 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:49:44,283 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:49:44,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-09-22 14:49:44,284 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:49:44,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:49:44,284 INFO L82 PathProgramCache]: Analyzing trace with hash 24371634, now seen corresponding path program 1 times [2021-09-22 14:49:44,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:49:44,285 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710442945] [2021-09-22 14:49:44,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:49:44,285 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:49:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:49:44,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:49:44,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:49:44,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710442945] [2021-09-22 14:49:44,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710442945] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:49:44,359 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:49:44,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:49:44,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497451658] [2021-09-22 14:49:44,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-22 14:49:44,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:49:44,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-22 14:49:44,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:49:44,360 INFO L87 Difference]: Start difference. First operand 389 states and 1102 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-09-22 14:49:44,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:49:44,415 INFO L93 Difference]: Finished difference Result 384 states and 1084 transitions. [2021-09-22 14:49:44,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-22 14:49:44,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2021-09-22 14:49:44,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:49:44,417 INFO L225 Difference]: With dead ends: 384 [2021-09-22 14:49:44,417 INFO L226 Difference]: Without dead ends: 384 [2021-09-22 14:49:44,418 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 25.8ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-09-22 14:49:44,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2021-09-22 14:49:44,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 381. [2021-09-22 14:49:44,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 2.831578947368421) internal successors, (1076), 380 states have internal predecessors, (1076), 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-09-22 14:49:44,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1076 transitions. [2021-09-22 14:49:44,427 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1076 transitions. Word has length 14 [2021-09-22 14:49:44,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:49:44,427 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 1076 transitions. [2021-09-22 14:49:44,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-09-22 14:49:44,427 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1076 transitions. [2021-09-22 14:49:44,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-09-22 14:49:44,428 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:49:44,428 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:49:44,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-09-22 14:49:44,429 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:49:44,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:49:44,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1167436388, now seen corresponding path program 1 times [2021-09-22 14:49:44,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:49:44,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655154173] [2021-09-22 14:49:44,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:49:44,430 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:49:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:49:44,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:49:44,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:49:44,479 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655154173] [2021-09-22 14:49:44,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655154173] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:49:44,480 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:49:44,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:49:44,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417072064] [2021-09-22 14:49:44,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:49:44,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:49:44,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:49:44,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:49:44,481 INFO L87 Difference]: Start difference. First operand 381 states and 1076 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-09-22 14:49:44,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:49:44,500 INFO L93 Difference]: Finished difference Result 372 states and 940 transitions. [2021-09-22 14:49:44,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-22 14:49:44,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2021-09-22 14:49:44,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:49:44,502 INFO L225 Difference]: With dead ends: 372 [2021-09-22 14:49:44,502 INFO L226 Difference]: Without dead ends: 281 [2021-09-22 14:49:44,503 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:49:44,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-09-22 14:49:44,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2021-09-22 14:49:44,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 2.4785714285714286) internal successors, (694), 280 states have internal predecessors, (694), 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-09-22 14:49:44,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 694 transitions. [2021-09-22 14:49:44,509 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 694 transitions. Word has length 15 [2021-09-22 14:49:44,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:49:44,510 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 694 transitions. [2021-09-22 14:49:44,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-09-22 14:49:44,510 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 694 transitions. [2021-09-22 14:49:44,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-09-22 14:49:44,511 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:49:44,511 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:49:44,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-09-22 14:49:44,511 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:49:44,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:49:44,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1874931372, now seen corresponding path program 1 times [2021-09-22 14:49:44,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:49:44,512 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686282106] [2021-09-22 14:49:44,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:49:44,512 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:49:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:49:44,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:49:44,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:49:44,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686282106] [2021-09-22 14:49:44,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686282106] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:49:44,577 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:49:44,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-22 14:49:44,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580497102] [2021-09-22 14:49:44,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-22 14:49:44,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:49:44,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-22 14:49:44,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:49:44,578 INFO L87 Difference]: Start difference. First operand 281 states and 694 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-09-22 14:49:44,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:49:44,613 INFO L93 Difference]: Finished difference Result 233 states and 532 transitions. [2021-09-22 14:49:44,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:49:44,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2021-09-22 14:49:44,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:49:44,614 INFO L225 Difference]: With dead ends: 233 [2021-09-22 14:49:44,614 INFO L226 Difference]: Without dead ends: 185 [2021-09-22 14:49:44,615 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 17.6ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-09-22 14:49:44,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-09-22 14:49:44,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 179. [2021-09-22 14:49:44,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 2.235955056179775) internal successors, (398), 178 states have internal predecessors, (398), 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-09-22 14:49:44,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 398 transitions. [2021-09-22 14:49:44,619 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 398 transitions. Word has length 16 [2021-09-22 14:49:44,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:49:44,620 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 398 transitions. [2021-09-22 14:49:44,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-09-22 14:49:44,620 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 398 transitions. [2021-09-22 14:49:44,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-22 14:49:44,621 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:49:44,621 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:49:44,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-09-22 14:49:44,621 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:49:44,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:49:44,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1331909860, now seen corresponding path program 1 times [2021-09-22 14:49:44,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:49:44,622 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453032741] [2021-09-22 14:49:44,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:49:44,622 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:49:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:49:44,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:49:44,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:49:44,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453032741] [2021-09-22 14:49:44,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453032741] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:49:44,701 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:49:44,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-22 14:49:44,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956871647] [2021-09-22 14:49:44,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-22 14:49:44,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:49:44,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-22 14:49:44,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-09-22 14:49:44,705 INFO L87 Difference]: Start difference. First operand 179 states and 398 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-09-22 14:49:44,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:49:44,743 INFO L93 Difference]: Finished difference Result 161 states and 361 transitions. [2021-09-22 14:49:44,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-22 14:49:44,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2021-09-22 14:49:44,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:49:44,745 INFO L225 Difference]: With dead ends: 161 [2021-09-22 14:49:44,745 INFO L226 Difference]: Without dead ends: 150 [2021-09-22 14:49:44,747 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 25.0ms TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-09-22 14:49:44,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-09-22 14:49:44,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2021-09-22 14:49:44,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 2.2885906040268456) internal successors, (341), 149 states have internal predecessors, (341), 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-09-22 14:49:44,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 341 transitions. [2021-09-22 14:49:44,751 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 341 transitions. Word has length 18 [2021-09-22 14:49:44,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:49:44,751 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 341 transitions. [2021-09-22 14:49:44,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-09-22 14:49:44,752 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 341 transitions. [2021-09-22 14:49:44,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:49:44,752 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:49:44,753 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:49:44,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-09-22 14:49:44,753 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:49:44,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:49:44,754 INFO L82 PathProgramCache]: Analyzing trace with hash -155428488, now seen corresponding path program 1 times [2021-09-22 14:49:44,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:49:44,754 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595573864] [2021-09-22 14:49:44,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:49:44,754 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:49:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:49:45,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:49:45,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:49:45,010 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595573864] [2021-09-22 14:49:45,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595573864] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:49:45,012 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:49:45,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-09-22 14:49:45,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281645990] [2021-09-22 14:49:45,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-22 14:49:45,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:49:45,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-22 14:49:45,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-09-22 14:49:45,015 INFO L87 Difference]: Start difference. First operand 150 states and 341 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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-09-22 14:49:45,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:49:45,164 INFO L93 Difference]: Finished difference Result 243 states and 528 transitions. [2021-09-22 14:49:45,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-22 14:49:45,165 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 21 [2021-09-22 14:49:45,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:49:45,166 INFO L225 Difference]: With dead ends: 243 [2021-09-22 14:49:45,166 INFO L226 Difference]: Without dead ends: 179 [2021-09-22 14:49:45,166 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 97.0ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-09-22 14:49:45,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-09-22 14:49:45,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 142. [2021-09-22 14:49:45,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 2.1914893617021276) internal successors, (309), 141 states have internal predecessors, (309), 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-09-22 14:49:45,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 309 transitions. [2021-09-22 14:49:45,170 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 309 transitions. Word has length 21 [2021-09-22 14:49:45,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:49:45,170 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 309 transitions. [2021-09-22 14:49:45,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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-09-22 14:49:45,170 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 309 transitions. [2021-09-22 14:49:45,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:49:45,171 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:49:45,171 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:49:45,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-09-22 14:49:45,171 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:49:45,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:49:45,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1388483026, now seen corresponding path program 2 times [2021-09-22 14:49:45,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:49:45,171 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50058706] [2021-09-22 14:49:45,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:49:45,172 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:49:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-09-22 14:49:45,224 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-09-22 14:49:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-09-22 14:49:45,353 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-09-22 14:49:45,353 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-09-22 14:49:45,354 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:49:45,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:49:45,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-09-22 14:49:45,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-09-22 14:49:45,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-09-22 14:49:45,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:49:45,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-09-22 14:49:45,362 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-09-22 14:49:45,362 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-22 14:49:45,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.09 02:49:45 BasicIcfg [2021-09-22 14:49:45,422 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-22 14:49:45,422 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-22 14:49:45,422 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-22 14:49:45,422 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-22 14:49:45,423 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 02:49:25" (3/4) ... [2021-09-22 14:49:45,424 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-09-22 14:49:45,513 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-09-22 14:49:45,513 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-22 14:49:45,514 INFO L168 Benchmark]: Toolchain (without parser) took 22171.16 ms. Allocated memory was 56.6 MB in the beginning and 182.5 MB in the end (delta: 125.8 MB). Free memory was 33.9 MB in the beginning and 109.8 MB in the end (delta: -75.9 MB). Peak memory consumption was 49.6 MB. Max. memory is 16.1 GB. [2021-09-22 14:49:45,515 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 56.6 MB. Free memory was 37.5 MB in the beginning and 37.5 MB in the end (delta: 36.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-09-22 14:49:45,515 INFO L168 Benchmark]: CACSL2BoogieTranslator took 631.82 ms. Allocated memory was 56.6 MB in the beginning and 71.3 MB in the end (delta: 14.7 MB). Free memory was 33.8 MB in the beginning and 51.6 MB in the end (delta: -17.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-09-22 14:49:45,515 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.89 ms. Allocated memory is still 71.3 MB. Free memory was 51.6 MB in the beginning and 48.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-09-22 14:49:45,516 INFO L168 Benchmark]: Boogie Preprocessor took 60.94 ms. Allocated memory is still 71.3 MB. Free memory was 48.7 MB in the beginning and 46.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-09-22 14:49:45,516 INFO L168 Benchmark]: RCFGBuilder took 1686.46 ms. Allocated memory was 71.3 MB in the beginning and 86.0 MB in the end (delta: 14.7 MB). Free memory was 46.5 MB in the beginning and 51.9 MB in the end (delta: -5.5 MB). Peak memory consumption was 25.9 MB. Max. memory is 16.1 GB. [2021-09-22 14:49:45,516 INFO L168 Benchmark]: TraceAbstraction took 19610.85 ms. Allocated memory was 86.0 MB in the beginning and 182.5 MB in the end (delta: 96.5 MB). Free memory was 51.3 MB in the beginning and 122.4 MB in the end (delta: -71.1 MB). Peak memory consumption was 97.1 MB. Max. memory is 16.1 GB. [2021-09-22 14:49:45,517 INFO L168 Benchmark]: Witness Printer took 90.89 ms. Allocated memory is still 182.5 MB. Free memory was 122.4 MB in the beginning and 109.8 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-09-22 14:49:45,518 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.18 ms. Allocated memory is still 56.6 MB. Free memory was 37.5 MB in the beginning and 37.5 MB in the end (delta: 36.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 631.82 ms. Allocated memory was 56.6 MB in the beginning and 71.3 MB in the end (delta: 14.7 MB). Free memory was 33.8 MB in the beginning and 51.6 MB in the end (delta: -17.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 82.89 ms. Allocated memory is still 71.3 MB. Free memory was 51.6 MB in the beginning and 48.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 60.94 ms. Allocated memory is still 71.3 MB. Free memory was 48.7 MB in the beginning and 46.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1686.46 ms. Allocated memory was 71.3 MB in the beginning and 86.0 MB in the end (delta: 14.7 MB). Free memory was 46.5 MB in the beginning and 51.9 MB in the end (delta: -5.5 MB). Peak memory consumption was 25.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 19610.85 ms. Allocated memory was 86.0 MB in the beginning and 182.5 MB in the end (delta: 96.5 MB). Free memory was 51.3 MB in the beginning and 122.4 MB in the end (delta: -71.1 MB). Peak memory consumption was 97.1 MB. Max. memory is 16.1 GB. * Witness Printer took 90.89 ms. Allocated memory is still 182.5 MB. Free memory was 122.4 MB in the beginning and 109.8 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15938.6ms, 114 PlacesBefore, 36 PlacesAfterwards, 106 TransitionsBefore, 26 TransitionsAfterwards, 1876 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 91 TotalNumberOfCompositions, 5073 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2527, positive: 2354, positive conditional: 0, positive unconditional: 2354, negative: 173, negative conditional: 0, negative unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1312, positive: 1244, positive conditional: 0, positive unconditional: 1244, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1312, positive: 1224, positive conditional: 0, positive unconditional: 1224, negative: 88, negative conditional: 0, negative unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 88, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 938, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 884, negative conditional: 0, negative unconditional: 884, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2527, positive: 1110, positive conditional: 0, positive unconditional: 1110, negative: 105, negative conditional: 0, negative unconditional: 105, unknown: 1312, unknown conditional: 0, unknown unconditional: 1312] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 107, Positive conditional cache size: 0, Positive unconditional cache size: 107, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32 - 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2037; [L819] FCALL, FORK 0 pthread_create(&t2037, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2038; [L821] FCALL, FORK 0 pthread_create(&t2038, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t2039; [L823] FCALL, FORK 0 pthread_create(&t2039, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L790] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: 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: 823]: 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: 821]: 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: 819]: 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 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 19443.1ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 25.7ms, AutomataDifference: 950.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 16024.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 311 SDtfs, 476 SDslu, 496 SDs, 0 SdLazy, 334 SolverSat, 129 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 467.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 330.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=724occurred in iteration=0, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 245.6ms AutomataMinimizationTime, 16 MinimizatonAttempts, 140 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 51.6ms SsaConstructionTime, 419.5ms SatisfiabilityAnalysisTime, 1274.0ms InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 193 ConstructedInterpolants, 0 QuantifiedInterpolants, 1636 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-09-22 14:49:45,560 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...