./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl/chromosome-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8c2bbc92 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl/chromosome-trans.wvr.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/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 e7b4df25dfc6745791d4d43165d1604ab5956e28 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-8c2bbc9 [2021-10-03 11:56:11,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-03 11:56:11,873 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-03 11:56:11,925 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-03 11:56:11,925 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-03 11:56:11,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-03 11:56:11,936 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-03 11:56:11,941 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-03 11:56:11,943 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-03 11:56:11,945 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-03 11:56:11,946 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-03 11:56:11,947 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-03 11:56:11,948 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-03 11:56:11,949 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-03 11:56:11,950 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-03 11:56:11,952 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-03 11:56:11,953 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-03 11:56:11,954 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-03 11:56:11,956 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-03 11:56:11,958 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-03 11:56:11,959 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-03 11:56:11,963 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-03 11:56:11,964 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-03 11:56:11,965 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-03 11:56:11,968 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-03 11:56:11,969 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-03 11:56:11,969 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-03 11:56:11,970 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-03 11:56:11,971 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-03 11:56:11,972 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-03 11:56:11,972 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-03 11:56:11,973 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-03 11:56:11,974 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-03 11:56:11,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-03 11:56:11,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-03 11:56:11,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-03 11:56:11,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-03 11:56:11,978 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-03 11:56:11,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-03 11:56:11,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-03 11:56:11,980 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-03 11:56:11,985 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-03 11:56:12,030 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-03 11:56:12,031 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-03 11:56:12,032 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-03 11:56:12,032 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-03 11:56:12,034 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-03 11:56:12,035 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-03 11:56:12,035 INFO L138 SettingsManager]: * Use SBE=true [2021-10-03 11:56:12,035 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-03 11:56:12,036 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-03 11:56:12,036 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-03 11:56:12,037 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-03 11:56:12,037 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-03 11:56:12,037 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-03 11:56:12,038 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-03 11:56:12,038 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-03 11:56:12,038 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-03 11:56:12,038 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-03 11:56:12,039 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-03 11:56:12,039 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-03 11:56:12,039 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-03 11:56:12,039 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-03 11:56:12,040 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-03 11:56:12,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-03 11:56:12,040 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-03 11:56:12,040 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-03 11:56:12,041 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-03 11:56:12,041 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-03 11:56:12,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-03 11:56:12,041 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-03 11:56:12,041 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-03 11:56:12,042 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-2/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-2/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 -> e7b4df25dfc6745791d4d43165d1604ab5956e28 [2021-10-03 11:56:12,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-03 11:56:12,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-03 11:56:12,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-03 11:56:12,483 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-03 11:56:12,484 INFO L275 PluginConnector]: CDTParser initialized [2021-10-03 11:56:12,485 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl/chromosome-trans.wvr.c [2021-10-03 11:56:12,564 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5760a340a/c441ca56559c406fb1158ae9fbfffa2d/FLAGb3e50d3cf [2021-10-03 11:56:13,186 INFO L306 CDTParser]: Found 1 translation units. [2021-10-03 11:56:13,188 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/chl/chromosome-trans.wvr.c [2021-10-03 11:56:13,189 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2021-10-03 11:56:13,189 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2021-10-03 11:56:13,199 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5760a340a/c441ca56559c406fb1158ae9fbfffa2d/FLAGb3e50d3cf [2021-10-03 11:56:13,500 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5760a340a/c441ca56559c406fb1158ae9fbfffa2d [2021-10-03 11:56:13,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-03 11:56:13,513 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-03 11:56:13,518 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-03 11:56:13,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-03 11:56:13,524 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-03 11:56:13,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 11:56:13" (1/1) ... [2021-10-03 11:56:13,526 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26569a20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 11:56:13, skipping insertion in model container [2021-10-03 11:56:13,526 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 11:56:13" (1/1) ... [2021-10-03 11:56:13,536 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-03 11:56:13,566 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-03 11:56:13,753 WARN L612 FunctionHandler]: implicit declaration of function assert [2021-10-03 11:56:13,806 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/chl/chromosome-trans.wvr.c[1565,1578] [2021-10-03 11:56:13,815 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-03 11:56:13,825 INFO L203 MainTranslator]: Completed pre-run [2021-10-03 11:56:13,838 WARN L612 FunctionHandler]: implicit declaration of function assert [2021-10-03 11:56:13,852 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/chl/chromosome-trans.wvr.c[1565,1578] [2021-10-03 11:56:13,856 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-03 11:56:13,876 INFO L208 MainTranslator]: Completed translation [2021-10-03 11:56:13,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 11:56:13 WrapperNode [2021-10-03 11:56:13,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-03 11:56:13,878 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-03 11:56:13,879 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-03 11:56:13,879 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-03 11:56:13,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 11:56:13" (1/1) ... [2021-10-03 11:56:13,909 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 11:56:13" (1/1) ... [2021-10-03 11:56:13,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-03 11:56:13,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-03 11:56:13,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-03 11:56:13,969 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-03 11:56:13,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 11:56:13" (1/1) ... [2021-10-03 11:56:13,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 11:56:13" (1/1) ... [2021-10-03 11:56:14,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 11:56:13" (1/1) ... [2021-10-03 11:56:14,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 11:56:13" (1/1) ... [2021-10-03 11:56:14,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 11:56:13" (1/1) ... [2021-10-03 11:56:14,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 11:56:13" (1/1) ... [2021-10-03 11:56:14,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 11:56:13" (1/1) ... [2021-10-03 11:56:14,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-03 11:56:14,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-03 11:56:14,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-03 11:56:14,053 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-03 11:56:14,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 11:56:13" (1/1) ... [2021-10-03 11:56:14,069 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-03 11:56:14,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-03 11:56:14,103 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-03 11:56:14,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-03 11:56:14,173 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-03 11:56:14,173 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-03 11:56:14,173 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-03 11:56:14,174 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-03 11:56:14,174 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-10-03 11:56:14,174 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-10-03 11:56:14,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-03 11:56:14,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-03 11:56:14,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-03 11:56:14,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-03 11:56:14,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-03 11:56:14,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-03 11:56:14,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-03 11:56:14,178 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-03 11:56:14,740 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-03 11:56:14,741 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2021-10-03 11:56:14,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 11:56:14 BoogieIcfgContainer [2021-10-03 11:56:14,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-03 11:56:14,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-03 11:56:14,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-03 11:56:14,757 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-03 11:56:14,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 11:56:13" (1/3) ... [2021-10-03 11:56:14,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d17a7d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 11:56:14, skipping insertion in model container [2021-10-03 11:56:14,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 11:56:13" (2/3) ... [2021-10-03 11:56:14,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d17a7d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 11:56:14, skipping insertion in model container [2021-10-03 11:56:14,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 11:56:14" (3/3) ... [2021-10-03 11:56:14,766 INFO L111 eAbstractionObserver]: Analyzing ICFG chromosome-trans.wvr.c [2021-10-03 11:56:14,774 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-03 11:56:14,775 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-03 11:56:14,776 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-03 11:56:14,776 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-03 11:56:14,857 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,858 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,861 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,861 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,862 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,862 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,862 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,863 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,863 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,863 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,864 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,864 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,864 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,865 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,865 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,865 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,866 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,866 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,866 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,867 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,867 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,867 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,868 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,868 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,869 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,869 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,869 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,870 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,871 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,871 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,871 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,872 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,872 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,872 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,873 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,873 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,874 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,874 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,874 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,875 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,875 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,875 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,875 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,876 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,877 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,877 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,878 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,878 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,879 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,879 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,880 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,880 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,880 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,881 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,881 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,881 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,882 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,882 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,882 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,883 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,883 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,884 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,884 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,885 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,885 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,888 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,888 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,889 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,889 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,890 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,890 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,890 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,891 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,891 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,892 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,892 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,892 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,892 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,893 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,893 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,893 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,894 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,894 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,894 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,895 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,896 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,898 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,899 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,900 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,900 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,900 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,902 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,902 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,903 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,903 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,915 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,915 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,916 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,916 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,917 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,917 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,917 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,918 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,918 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,918 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,919 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,919 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,920 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,920 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,920 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,920 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,921 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,921 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,921 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,922 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,922 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,922 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,922 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,923 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,923 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,923 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,924 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,924 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,924 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,925 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,925 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,925 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,925 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,926 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,926 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,927 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,927 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,931 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,932 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,932 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,932 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,933 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,933 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,933 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,934 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,939 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,939 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,940 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,940 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,940 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,940 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,941 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,941 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,945 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,945 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,946 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,946 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,946 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,946 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,947 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,948 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-03 11:56:14,974 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-10-03 11:56:15,041 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-03 11:56:15,054 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-10-03 11:56:15,055 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-10-03 11:56:15,085 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-03 11:56:15,098 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 212 transitions, 448 flow [2021-10-03 11:56:15,101 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 212 transitions, 448 flow [2021-10-03 11:56:15,103 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 200 places, 212 transitions, 448 flow [2021-10-03 11:56:15,226 INFO L129 PetriNetUnfolder]: 22/209 cut-off events. [2021-10-03 11:56:15,226 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-10-03 11:56:15,235 INFO L84 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 209 events. 22/209 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 227 event pairs, 0 based on Foata normal form. 0/186 useless extension candidates. Maximal degree in co-relation 165. Up to 3 conditions per place. [2021-10-03 11:56:15,241 INFO L116 LiptonReduction]: Number of co-enabled transitions 4272 [2021-10-03 11:56:21,962 INFO L131 LiptonReduction]: Checked pairs total: 5981 [2021-10-03 11:56:21,962 INFO L133 LiptonReduction]: Total number of compositions: 208 [2021-10-03 11:56:21,970 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 40 transitions, 104 flow [2021-10-03 11:56:22,010 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 311 states, 310 states have (on average 3.7870967741935484) internal successors, (1174), 310 states have internal predecessors, (1174), 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-10-03 11:56:22,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 311 states, 310 states have (on average 3.7870967741935484) internal successors, (1174), 310 states have internal predecessors, (1174), 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-10-03 11:56:22,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-03 11:56:22,035 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 11:56:22,036 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, 1] [2021-10-03 11:56:22,036 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 11:56:22,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 11:56:22,041 INFO L82 PathProgramCache]: Analyzing trace with hash 424765599, now seen corresponding path program 1 times [2021-10-03 11:56:22,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 11:56:22,051 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601457327] [2021-10-03 11:56:22,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:22,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 11:56:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:22,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-03 11:56:22,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 11:56:22,278 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601457327] [2021-10-03 11:56:22,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601457327] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 11:56:22,279 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 11:56:22,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-03 11:56:22,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090258852] [2021-10-03 11:56:22,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-03 11:56:22,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 11:56:22,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-03 11:56:22,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-03 11:56:22,316 INFO L87 Difference]: Start difference. First operand has 311 states, 310 states have (on average 3.7870967741935484) internal successors, (1174), 310 states have internal predecessors, (1174), 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, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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-10-03 11:56:22,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 11:56:22,386 INFO L93 Difference]: Finished difference Result 314 states and 1177 transitions. [2021-10-03 11:56:22,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-03 11:56:22,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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 22 [2021-10-03 11:56:22,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 11:56:22,416 INFO L225 Difference]: With dead ends: 314 [2021-10-03 11:56:22,417 INFO L226 Difference]: Without dead ends: 314 [2021-10-03 11:56:22,418 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-03 11:56:22,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-10-03 11:56:22,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2021-10-03 11:56:22,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 3.7603833865814695) internal successors, (1177), 313 states have internal predecessors, (1177), 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-10-03 11:56:22,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 1177 transitions. [2021-10-03 11:56:22,501 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 1177 transitions. Word has length 22 [2021-10-03 11:56:22,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 11:56:22,501 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 1177 transitions. [2021-10-03 11:56:22,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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-10-03 11:56:22,502 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 1177 transitions. [2021-10-03 11:56:22,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-03 11:56:22,507 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 11:56:22,507 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, 1, 1, 1, 1] [2021-10-03 11:56:22,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-03 11:56:22,508 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 11:56:22,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 11:56:22,509 INFO L82 PathProgramCache]: Analyzing trace with hash 115213769, now seen corresponding path program 1 times [2021-10-03 11:56:22,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 11:56:22,510 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424479766] [2021-10-03 11:56:22,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:22,510 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 11:56:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:22,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-03 11:56:22,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 11:56:22,667 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424479766] [2021-10-03 11:56:22,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424479766] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:22,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406810494] [2021-10-03 11:56:22,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:22,668 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-03 11:56:22,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-03 11:56:22,670 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-03 11:56:22,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-03 11:56:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:22,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-03 11:56:22,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-03 11:56:22,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-03 11:56:22,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406810494] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:22,879 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-03 11:56:22,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2021-10-03 11:56:22,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436841193] [2021-10-03 11:56:22,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-03 11:56:22,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 11:56:22,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-03 11:56:22,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-03 11:56:22,883 INFO L87 Difference]: Start difference. First operand 314 states and 1177 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-10-03 11:56:22,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 11:56:22,922 INFO L93 Difference]: Finished difference Result 317 states and 1180 transitions. [2021-10-03 11:56:22,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-03 11:56:22,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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 25 [2021-10-03 11:56:22,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 11:56:22,927 INFO L225 Difference]: With dead ends: 317 [2021-10-03 11:56:22,927 INFO L226 Difference]: Without dead ends: 317 [2021-10-03 11:56:22,928 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.0ms TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-03 11:56:22,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-10-03 11:56:22,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2021-10-03 11:56:22,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 3.7341772151898733) internal successors, (1180), 316 states have internal predecessors, (1180), 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-10-03 11:56:22,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 1180 transitions. [2021-10-03 11:56:22,999 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 1180 transitions. Word has length 25 [2021-10-03 11:56:23,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 11:56:23,000 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 1180 transitions. [2021-10-03 11:56:23,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-10-03 11:56:23,000 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 1180 transitions. [2021-10-03 11:56:23,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-03 11:56:23,010 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 11:56:23,010 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 11:56:23,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-03 11:56:23,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-03 11:56:23,226 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 11:56:23,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 11:56:23,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1133597855, now seen corresponding path program 2 times [2021-10-03 11:56:23,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 11:56:23,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126313883] [2021-10-03 11:56:23,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:23,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 11:56:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:23,336 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-03 11:56:23,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 11:56:23,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126313883] [2021-10-03 11:56:23,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126313883] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:23,338 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774507707] [2021-10-03 11:56:23,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-03 11:56:23,338 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-03 11:56:23,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-03 11:56:23,340 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-03 11:56:23,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-03 11:56:23,429 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-03 11:56:23,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-03 11:56:23,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-03 11:56:23,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-03 11:56:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-03 11:56:23,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774507707] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 11:56:23,508 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-03 11:56:23,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2021-10-03 11:56:23,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95459055] [2021-10-03 11:56:23,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-03 11:56:23,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 11:56:23,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-03 11:56:23,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-03 11:56:23,510 INFO L87 Difference]: Start difference. First operand 317 states and 1180 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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-10-03 11:56:23,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 11:56:23,532 INFO L93 Difference]: Finished difference Result 518 states and 1879 transitions. [2021-10-03 11:56:23,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-03 11:56:23,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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 28 [2021-10-03 11:56:23,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 11:56:23,540 INFO L225 Difference]: With dead ends: 518 [2021-10-03 11:56:23,540 INFO L226 Difference]: Without dead ends: 505 [2021-10-03 11:56:23,541 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 16.1ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-03 11:56:23,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-10-03 11:56:23,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 429. [2021-10-03 11:56:23,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 3.5654205607476634) internal successors, (1526), 428 states have internal predecessors, (1526), 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-10-03 11:56:23,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1526 transitions. [2021-10-03 11:56:23,603 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 1526 transitions. Word has length 28 [2021-10-03 11:56:23,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 11:56:23,605 INFO L470 AbstractCegarLoop]: Abstraction has 429 states and 1526 transitions. [2021-10-03 11:56:23,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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-10-03 11:56:23,605 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1526 transitions. [2021-10-03 11:56:23,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-03 11:56:23,615 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 11:56:23,616 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 11:56:23,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-03 11:56:23,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-03 11:56:23,831 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 11:56:23,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 11:56:23,832 INFO L82 PathProgramCache]: Analyzing trace with hash 2065092519, now seen corresponding path program 1 times [2021-10-03 11:56:23,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 11:56:23,834 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287161780] [2021-10-03 11:56:23,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:23,834 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 11:56:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:23,989 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-10-03 11:56:23,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 11:56:23,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287161780] [2021-10-03 11:56:23,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287161780] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:23,990 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135549718] [2021-10-03 11:56:23,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:23,990 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-03 11:56:23,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-03 11:56:23,996 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-03 11:56:24,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-03 11:56:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:24,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-03 11:56:24,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-03 11:56:24,203 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-03 11:56:24,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135549718] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:24,204 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-03 11:56:24,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2021-10-03 11:56:24,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974196549] [2021-10-03 11:56:24,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-03 11:56:24,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 11:56:24,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-03 11:56:24,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-10-03 11:56:24,206 INFO L87 Difference]: Start difference. First operand 429 states and 1526 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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-10-03 11:56:24,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 11:56:24,297 INFO L93 Difference]: Finished difference Result 1024 states and 3519 transitions. [2021-10-03 11:56:24,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-03 11:56:24,297 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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 30 [2021-10-03 11:56:24,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 11:56:24,308 INFO L225 Difference]: With dead ends: 1024 [2021-10-03 11:56:24,308 INFO L226 Difference]: Without dead ends: 1024 [2021-10-03 11:56:24,309 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 29.2ms TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-10-03 11:56:24,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2021-10-03 11:56:24,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 636. [2021-10-03 11:56:24,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 3.809448818897638) internal successors, (2419), 635 states have internal predecessors, (2419), 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-10-03 11:56:24,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 2419 transitions. [2021-10-03 11:56:24,350 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 2419 transitions. Word has length 30 [2021-10-03 11:56:24,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 11:56:24,350 INFO L470 AbstractCegarLoop]: Abstraction has 636 states and 2419 transitions. [2021-10-03 11:56:24,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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-10-03 11:56:24,351 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 2419 transitions. [2021-10-03 11:56:24,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-03 11:56:24,354 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 11:56:24,354 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 11:56:24,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-03 11:56:24,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-03 11:56:24,569 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 11:56:24,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 11:56:24,570 INFO L82 PathProgramCache]: Analyzing trace with hash -625470171, now seen corresponding path program 2 times [2021-10-03 11:56:24,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 11:56:24,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592671298] [2021-10-03 11:56:24,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:24,572 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 11:56:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:24,723 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-03 11:56:24,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 11:56:24,724 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592671298] [2021-10-03 11:56:24,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592671298] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 11:56:24,724 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 11:56:24,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-03 11:56:24,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912723132] [2021-10-03 11:56:24,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-03 11:56:24,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 11:56:24,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-03 11:56:24,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-03 11:56:24,727 INFO L87 Difference]: Start difference. First operand 636 states and 2419 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-10-03 11:56:24,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 11:56:24,765 INFO L93 Difference]: Finished difference Result 970 states and 3593 transitions. [2021-10-03 11:56:24,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-03 11:56:24,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 35 [2021-10-03 11:56:24,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 11:56:24,775 INFO L225 Difference]: With dead ends: 970 [2021-10-03 11:56:24,776 INFO L226 Difference]: Without dead ends: 970 [2021-10-03 11:56:24,776 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-03 11:56:24,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2021-10-03 11:56:24,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 666. [2021-10-03 11:56:24,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 665 states have (on average 3.8601503759398494) internal successors, (2567), 665 states have internal predecessors, (2567), 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-10-03 11:56:24,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 2567 transitions. [2021-10-03 11:56:24,811 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 2567 transitions. Word has length 35 [2021-10-03 11:56:24,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 11:56:24,812 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 2567 transitions. [2021-10-03 11:56:24,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-10-03 11:56:24,812 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 2567 transitions. [2021-10-03 11:56:24,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-03 11:56:24,815 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 11:56:24,816 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 11:56:24,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-03 11:56:24,816 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 11:56:24,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 11:56:24,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1389548488, now seen corresponding path program 1 times [2021-10-03 11:56:24,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 11:56:24,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520715728] [2021-10-03 11:56:24,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:24,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 11:56:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:24,873 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-10-03 11:56:24,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 11:56:24,874 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520715728] [2021-10-03 11:56:24,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520715728] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 11:56:24,875 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 11:56:24,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-03 11:56:24,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050301263] [2021-10-03 11:56:24,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-03 11:56:24,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 11:56:24,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-03 11:56:24,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-03 11:56:24,877 INFO L87 Difference]: Start difference. First operand 666 states and 2567 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-10-03 11:56:24,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 11:56:24,913 INFO L93 Difference]: Finished difference Result 836 states and 2975 transitions. [2021-10-03 11:56:24,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-03 11:56:24,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 35 [2021-10-03 11:56:24,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 11:56:24,922 INFO L225 Difference]: With dead ends: 836 [2021-10-03 11:56:24,922 INFO L226 Difference]: Without dead ends: 816 [2021-10-03 11:56:24,923 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-03 11:56:24,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2021-10-03 11:56:24,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 696. [2021-10-03 11:56:24,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 695 states have (on average 3.7482014388489207) internal successors, (2605), 695 states have internal predecessors, (2605), 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-10-03 11:56:24,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 2605 transitions. [2021-10-03 11:56:24,957 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 2605 transitions. Word has length 35 [2021-10-03 11:56:24,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 11:56:24,971 INFO L470 AbstractCegarLoop]: Abstraction has 696 states and 2605 transitions. [2021-10-03 11:56:24,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-10-03 11:56:24,971 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 2605 transitions. [2021-10-03 11:56:24,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-03 11:56:24,975 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 11:56:24,975 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 11:56:24,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-03 11:56:24,976 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 11:56:24,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 11:56:24,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1769023479, now seen corresponding path program 3 times [2021-10-03 11:56:24,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 11:56:24,977 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197234128] [2021-10-03 11:56:24,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:24,978 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 11:56:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:25,039 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-03 11:56:25,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 11:56:25,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197234128] [2021-10-03 11:56:25,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197234128] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 11:56:25,040 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 11:56:25,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-03 11:56:25,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780154104] [2021-10-03 11:56:25,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-03 11:56:25,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 11:56:25,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-03 11:56:25,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-03 11:56:25,043 INFO L87 Difference]: Start difference. First operand 696 states and 2605 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-10-03 11:56:25,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 11:56:25,080 INFO L93 Difference]: Finished difference Result 1226 states and 4517 transitions. [2021-10-03 11:56:25,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-03 11:56:25,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 35 [2021-10-03 11:56:25,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 11:56:25,093 INFO L225 Difference]: With dead ends: 1226 [2021-10-03 11:56:25,094 INFO L226 Difference]: Without dead ends: 1226 [2021-10-03 11:56:25,094 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-03 11:56:25,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2021-10-03 11:56:25,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 706. [2021-10-03 11:56:25,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 705 states have (on average 3.7602836879432626) internal successors, (2651), 705 states have internal predecessors, (2651), 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-10-03 11:56:25,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 2651 transitions. [2021-10-03 11:56:25,133 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 2651 transitions. Word has length 35 [2021-10-03 11:56:25,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 11:56:25,134 INFO L470 AbstractCegarLoop]: Abstraction has 706 states and 2651 transitions. [2021-10-03 11:56:25,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-10-03 11:56:25,134 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 2651 transitions. [2021-10-03 11:56:25,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-03 11:56:25,137 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 11:56:25,138 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 11:56:25,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-03 11:56:25,138 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 11:56:25,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 11:56:25,139 INFO L82 PathProgramCache]: Analyzing trace with hash -218085457, now seen corresponding path program 4 times [2021-10-03 11:56:25,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 11:56:25,139 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068949349] [2021-10-03 11:56:25,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:25,140 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 11:56:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:25,195 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-03 11:56:25,195 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 11:56:25,195 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068949349] [2021-10-03 11:56:25,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068949349] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 11:56:25,196 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 11:56:25,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-03 11:56:25,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121671488] [2021-10-03 11:56:25,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-03 11:56:25,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 11:56:25,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-03 11:56:25,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-03 11:56:25,198 INFO L87 Difference]: Start difference. First operand 706 states and 2651 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-10-03 11:56:25,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 11:56:25,236 INFO L93 Difference]: Finished difference Result 1146 states and 4187 transitions. [2021-10-03 11:56:25,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-03 11:56:25,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 35 [2021-10-03 11:56:25,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 11:56:25,247 INFO L225 Difference]: With dead ends: 1146 [2021-10-03 11:56:25,248 INFO L226 Difference]: Without dead ends: 1114 [2021-10-03 11:56:25,248 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-03 11:56:25,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2021-10-03 11:56:25,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 706. [2021-10-03 11:56:25,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 705 states have (on average 3.720567375886525) internal successors, (2623), 705 states have internal predecessors, (2623), 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-10-03 11:56:25,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 2623 transitions. [2021-10-03 11:56:25,282 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 2623 transitions. Word has length 35 [2021-10-03 11:56:25,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 11:56:25,282 INFO L470 AbstractCegarLoop]: Abstraction has 706 states and 2623 transitions. [2021-10-03 11:56:25,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-10-03 11:56:25,283 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 2623 transitions. [2021-10-03 11:56:25,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-03 11:56:25,286 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 11:56:25,286 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 11:56:25,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-03 11:56:25,287 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 11:56:25,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 11:56:25,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1595846540, now seen corresponding path program 2 times [2021-10-03 11:56:25,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 11:56:25,287 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010647828] [2021-10-03 11:56:25,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:25,288 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 11:56:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:25,367 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-10-03 11:56:25,367 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 11:56:25,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010647828] [2021-10-03 11:56:25,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010647828] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 11:56:25,368 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 11:56:25,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-03 11:56:25,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295670609] [2021-10-03 11:56:25,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-03 11:56:25,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 11:56:25,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-03 11:56:25,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-03 11:56:25,370 INFO L87 Difference]: Start difference. First operand 706 states and 2623 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-10-03 11:56:25,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 11:56:25,407 INFO L93 Difference]: Finished difference Result 844 states and 3081 transitions. [2021-10-03 11:56:25,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-03 11:56:25,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 35 [2021-10-03 11:56:25,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 11:56:25,416 INFO L225 Difference]: With dead ends: 844 [2021-10-03 11:56:25,417 INFO L226 Difference]: Without dead ends: 844 [2021-10-03 11:56:25,417 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-03 11:56:25,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2021-10-03 11:56:25,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 594. [2021-10-03 11:56:25,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 593 states have (on average 3.752107925801012) internal successors, (2225), 593 states have internal predecessors, (2225), 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-10-03 11:56:25,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 2225 transitions. [2021-10-03 11:56:25,445 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 2225 transitions. Word has length 35 [2021-10-03 11:56:25,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 11:56:25,446 INFO L470 AbstractCegarLoop]: Abstraction has 594 states and 2225 transitions. [2021-10-03 11:56:25,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-10-03 11:56:25,446 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 2225 transitions. [2021-10-03 11:56:25,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-03 11:56:25,449 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 11:56:25,449 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 11:56:25,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-03 11:56:25,450 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 11:56:25,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 11:56:25,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1937370948, now seen corresponding path program 1 times [2021-10-03 11:56:25,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 11:56:25,451 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743311061] [2021-10-03 11:56:25,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:25,452 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 11:56:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:25,519 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-10-03 11:56:25,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 11:56:25,520 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743311061] [2021-10-03 11:56:25,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743311061] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:25,521 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592805503] [2021-10-03 11:56:25,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:25,521 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-03 11:56:25,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-03 11:56:25,523 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-03 11:56:25,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-03 11:56:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:25,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-03 11:56:25,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-03 11:56:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-03 11:56:25,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592805503] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:25,757 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-03 11:56:25,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-10-03 11:56:25,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746399959] [2021-10-03 11:56:25,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-03 11:56:25,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 11:56:25,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-03 11:56:25,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-10-03 11:56:25,759 INFO L87 Difference]: Start difference. First operand 594 states and 2225 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 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-10-03 11:56:25,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 11:56:25,898 INFO L93 Difference]: Finished difference Result 1151 states and 4290 transitions. [2021-10-03 11:56:25,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-03 11:56:25,899 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 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 36 [2021-10-03 11:56:25,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 11:56:25,910 INFO L225 Difference]: With dead ends: 1151 [2021-10-03 11:56:25,911 INFO L226 Difference]: Without dead ends: 1151 [2021-10-03 11:56:25,911 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 75.6ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-10-03 11:56:25,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2021-10-03 11:56:25,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 787. [2021-10-03 11:56:25,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 3.8702290076335877) internal successors, (3042), 786 states have internal predecessors, (3042), 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-10-03 11:56:25,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3042 transitions. [2021-10-03 11:56:25,963 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3042 transitions. Word has length 36 [2021-10-03 11:56:25,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 11:56:25,964 INFO L470 AbstractCegarLoop]: Abstraction has 787 states and 3042 transitions. [2021-10-03 11:56:25,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 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-10-03 11:56:25,964 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3042 transitions. [2021-10-03 11:56:25,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-03 11:56:25,968 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 11:56:25,968 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 11:56:26,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-03 11:56:26,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-10-03 11:56:26,181 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 11:56:26,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 11:56:26,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1989376858, now seen corresponding path program 2 times [2021-10-03 11:56:26,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 11:56:26,183 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044561524] [2021-10-03 11:56:26,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:26,183 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 11:56:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:26,247 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-10-03 11:56:26,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 11:56:26,248 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044561524] [2021-10-03 11:56:26,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044561524] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:26,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020365428] [2021-10-03 11:56:26,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-03 11:56:26,249 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-03 11:56:26,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-03 11:56:26,250 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-03 11:56:26,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-03 11:56:26,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-10-03 11:56:26,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-03 11:56:26,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-03 11:56:26,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-03 11:56:26,440 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-10-03 11:56:26,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020365428] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 11:56:26,441 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-03 11:56:26,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2021-10-03 11:56:26,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027644968] [2021-10-03 11:56:26,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-03 11:56:26,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 11:56:26,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-03 11:56:26,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-03 11:56:26,445 INFO L87 Difference]: Start difference. First operand 787 states and 3042 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-10-03 11:56:26,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 11:56:26,486 INFO L93 Difference]: Finished difference Result 1711 states and 6384 transitions. [2021-10-03 11:56:26,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-03 11:56:26,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 39 [2021-10-03 11:56:26,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 11:56:26,505 INFO L225 Difference]: With dead ends: 1711 [2021-10-03 11:56:26,505 INFO L226 Difference]: Without dead ends: 1679 [2021-10-03 11:56:26,506 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 24.2ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-03 11:56:26,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2021-10-03 11:56:26,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 805. [2021-10-03 11:56:26,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 804 states have (on average 3.861940298507463) internal successors, (3105), 804 states have internal predecessors, (3105), 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-10-03 11:56:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3105 transitions. [2021-10-03 11:56:26,546 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3105 transitions. Word has length 39 [2021-10-03 11:56:26,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 11:56:26,547 INFO L470 AbstractCegarLoop]: Abstraction has 805 states and 3105 transitions. [2021-10-03 11:56:26,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-10-03 11:56:26,547 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3105 transitions. [2021-10-03 11:56:26,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-03 11:56:26,551 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 11:56:26,551 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 11:56:26,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-03 11:56:26,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-03 11:56:26,766 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 11:56:26,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 11:56:26,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1576805362, now seen corresponding path program 3 times [2021-10-03 11:56:26,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 11:56:26,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685489722] [2021-10-03 11:56:26,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:26,769 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 11:56:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:26,844 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-10-03 11:56:26,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 11:56:26,845 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685489722] [2021-10-03 11:56:26,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685489722] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:26,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398966581] [2021-10-03 11:56:26,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-03 11:56:26,848 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-03 11:56:26,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-03 11:56:26,853 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-03 11:56:26,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-03 11:56:27,000 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-10-03 11:56:27,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-03 11:56:27,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-03 11:56:27,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-03 11:56:27,158 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-10-03 11:56:27,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398966581] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:27,158 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-03 11:56:27,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-10-03 11:56:27,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802577054] [2021-10-03 11:56:27,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-03 11:56:27,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 11:56:27,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-03 11:56:27,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-03 11:56:27,162 INFO L87 Difference]: Start difference. First operand 805 states and 3105 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-10-03 11:56:27,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 11:56:27,230 INFO L93 Difference]: Finished difference Result 1649 states and 6183 transitions. [2021-10-03 11:56:27,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-03 11:56:27,230 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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 39 [2021-10-03 11:56:27,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 11:56:27,248 INFO L225 Difference]: With dead ends: 1649 [2021-10-03 11:56:27,248 INFO L226 Difference]: Without dead ends: 1649 [2021-10-03 11:56:27,249 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 25.5ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-03 11:56:27,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2021-10-03 11:56:27,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 917. [2021-10-03 11:56:27,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 916 states have (on average 3.8482532751091703) internal successors, (3525), 916 states have internal predecessors, (3525), 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-10-03 11:56:27,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 3525 transitions. [2021-10-03 11:56:27,291 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 3525 transitions. Word has length 39 [2021-10-03 11:56:27,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 11:56:27,292 INFO L470 AbstractCegarLoop]: Abstraction has 917 states and 3525 transitions. [2021-10-03 11:56:27,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-10-03 11:56:27,292 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 3525 transitions. [2021-10-03 11:56:27,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-03 11:56:27,297 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 11:56:27,297 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 11:56:27,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-10-03 11:56:27,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-10-03 11:56:27,512 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 11:56:27,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 11:56:27,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1471551788, now seen corresponding path program 1 times [2021-10-03 11:56:27,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 11:56:27,514 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586099742] [2021-10-03 11:56:27,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:27,515 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 11:56:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:27,611 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-10-03 11:56:27,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 11:56:27,612 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586099742] [2021-10-03 11:56:27,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586099742] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:27,612 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800817601] [2021-10-03 11:56:27,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:27,613 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-03 11:56:27,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-03 11:56:27,614 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-03 11:56:27,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-03 11:56:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:27,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-03 11:56:27,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-03 11:56:27,909 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-10-03 11:56:27,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800817601] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:27,910 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-03 11:56:27,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2021-10-03 11:56:27,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891304729] [2021-10-03 11:56:27,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 11:56:27,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 11:56:27,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 11:56:27,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2021-10-03 11:56:27,912 INFO L87 Difference]: Start difference. First operand 917 states and 3525 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 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-10-03 11:56:27,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 11:56:27,965 INFO L93 Difference]: Finished difference Result 920 states and 3528 transitions. [2021-10-03 11:56:27,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-03 11:56:27,965 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 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 41 [2021-10-03 11:56:27,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 11:56:27,974 INFO L225 Difference]: With dead ends: 920 [2021-10-03 11:56:27,974 INFO L226 Difference]: Without dead ends: 920 [2021-10-03 11:56:27,974 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 68.9ms TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2021-10-03 11:56:27,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2021-10-03 11:56:27,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 920. [2021-10-03 11:56:28,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 919 states have (on average 3.838955386289445) internal successors, (3528), 919 states have internal predecessors, (3528), 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-10-03 11:56:28,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 3528 transitions. [2021-10-03 11:56:28,006 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 3528 transitions. Word has length 41 [2021-10-03 11:56:28,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 11:56:28,006 INFO L470 AbstractCegarLoop]: Abstraction has 920 states and 3528 transitions. [2021-10-03 11:56:28,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 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-10-03 11:56:28,007 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 3528 transitions. [2021-10-03 11:56:28,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-03 11:56:28,010 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 11:56:28,011 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 11:56:28,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-10-03 11:56:28,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-10-03 11:56:28,227 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 11:56:28,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 11:56:28,228 INFO L82 PathProgramCache]: Analyzing trace with hash -400303166, now seen corresponding path program 2 times [2021-10-03 11:56:28,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 11:56:28,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262380620] [2021-10-03 11:56:28,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:28,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 11:56:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:28,309 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-03 11:56:28,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 11:56:28,310 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262380620] [2021-10-03 11:56:28,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262380620] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:28,310 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829426828] [2021-10-03 11:56:28,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-03 11:56:28,310 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-03 11:56:28,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-03 11:56:28,311 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-03 11:56:28,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-10-03 11:56:28,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-03 11:56:28,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-03 11:56:28,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-03 11:56:28,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-03 11:56:28,651 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-03 11:56:28,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829426828] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:28,652 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-03 11:56:28,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2021-10-03 11:56:28,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908673975] [2021-10-03 11:56:28,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-03 11:56:28,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 11:56:28,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-03 11:56:28,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-10-03 11:56:28,653 INFO L87 Difference]: Start difference. First operand 920 states and 3528 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-10-03 11:56:28,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 11:56:28,731 INFO L93 Difference]: Finished difference Result 1762 states and 6396 transitions. [2021-10-03 11:56:28,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-03 11:56:28,731 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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 44 [2021-10-03 11:56:28,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 11:56:28,748 INFO L225 Difference]: With dead ends: 1762 [2021-10-03 11:56:28,748 INFO L226 Difference]: Without dead ends: 1762 [2021-10-03 11:56:28,749 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 31.1ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-10-03 11:56:28,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2021-10-03 11:56:28,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1148. [2021-10-03 11:56:28,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1147 states have (on average 3.909328683522232) internal successors, (4484), 1147 states have internal predecessors, (4484), 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-10-03 11:56:28,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 4484 transitions. [2021-10-03 11:56:28,795 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 4484 transitions. Word has length 44 [2021-10-03 11:56:28,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 11:56:28,796 INFO L470 AbstractCegarLoop]: Abstraction has 1148 states and 4484 transitions. [2021-10-03 11:56:28,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-10-03 11:56:28,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 4484 transitions. [2021-10-03 11:56:28,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-03 11:56:28,800 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 11:56:28,801 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 11:56:28,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-10-03 11:56:29,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-10-03 11:56:29,017 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 11:56:29,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 11:56:29,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1922723539, now seen corresponding path program 4 times [2021-10-03 11:56:29,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 11:56:29,019 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813595362] [2021-10-03 11:56:29,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:29,019 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 11:56:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:29,116 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-03 11:56:29,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 11:56:29,116 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813595362] [2021-10-03 11:56:29,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813595362] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:29,116 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468073107] [2021-10-03 11:56:29,116 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-03 11:56:29,117 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-03 11:56:29,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-03 11:56:29,118 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-03 11:56:29,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-10-03 11:56:29,284 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-03 11:56:29,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-03 11:56:29,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-03 11:56:29,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-03 11:56:29,445 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-03 11:56:29,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468073107] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:29,446 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-03 11:56:29,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-10-03 11:56:29,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571506434] [2021-10-03 11:56:29,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-03 11:56:29,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 11:56:29,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-03 11:56:29,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-10-03 11:56:29,448 INFO L87 Difference]: Start difference. First operand 1148 states and 4484 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-10-03 11:56:29,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 11:56:29,533 INFO L93 Difference]: Finished difference Result 2276 states and 8762 transitions. [2021-10-03 11:56:29,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-03 11:56:29,533 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 46 [2021-10-03 11:56:29,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 11:56:29,545 INFO L225 Difference]: With dead ends: 2276 [2021-10-03 11:56:29,546 INFO L226 Difference]: Without dead ends: 2276 [2021-10-03 11:56:29,546 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 26.4ms TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-10-03 11:56:29,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2276 states. [2021-10-03 11:56:29,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2276 to 1428. [2021-10-03 11:56:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1427 states have (on average 3.9747722494744218) internal successors, (5672), 1427 states have internal predecessors, (5672), 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-10-03 11:56:29,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 5672 transitions. [2021-10-03 11:56:29,604 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 5672 transitions. Word has length 46 [2021-10-03 11:56:29,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 11:56:29,605 INFO L470 AbstractCegarLoop]: Abstraction has 1428 states and 5672 transitions. [2021-10-03 11:56:29,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-10-03 11:56:29,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 5672 transitions. [2021-10-03 11:56:29,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-03 11:56:29,611 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 11:56:29,611 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 11:56:29,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-10-03 11:56:29,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-03 11:56:29,826 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 11:56:29,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 11:56:29,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1187853294, now seen corresponding path program 3 times [2021-10-03 11:56:29,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 11:56:29,828 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241852966] [2021-10-03 11:56:29,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:29,828 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 11:56:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:29,917 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-03 11:56:29,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 11:56:29,917 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241852966] [2021-10-03 11:56:29,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241852966] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:29,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103564092] [2021-10-03 11:56:29,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-03 11:56:29,918 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-03 11:56:29,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-03 11:56:29,919 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-03 11:56:29,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-10-03 11:56:30,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-10-03 11:56:30,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-03 11:56:30,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-03 11:56:30,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-03 11:56:30,540 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-03 11:56:30,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103564092] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:30,540 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-03 11:56:30,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-10-03 11:56:30,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806684320] [2021-10-03 11:56:30,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-03 11:56:30,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 11:56:30,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-03 11:56:30,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-10-03 11:56:30,543 INFO L87 Difference]: Start difference. First operand 1428 states and 5672 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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-10-03 11:56:30,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 11:56:30,628 INFO L93 Difference]: Finished difference Result 2666 states and 9793 transitions. [2021-10-03 11:56:30,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-03 11:56:30,629 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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 46 [2021-10-03 11:56:30,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 11:56:30,643 INFO L225 Difference]: With dead ends: 2666 [2021-10-03 11:56:30,643 INFO L226 Difference]: Without dead ends: 2666 [2021-10-03 11:56:30,644 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 37.3ms TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-10-03 11:56:30,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2021-10-03 11:56:30,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 1736. [2021-10-03 11:56:30,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1736 states, 1735 states have (on average 4.020749279538905) internal successors, (6976), 1735 states have internal predecessors, (6976), 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-10-03 11:56:30,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 6976 transitions. [2021-10-03 11:56:30,723 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 6976 transitions. Word has length 46 [2021-10-03 11:56:30,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 11:56:30,723 INFO L470 AbstractCegarLoop]: Abstraction has 1736 states and 6976 transitions. [2021-10-03 11:56:30,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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-10-03 11:56:30,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 6976 transitions. [2021-10-03 11:56:30,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-03 11:56:30,730 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 11:56:30,731 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 11:56:30,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-10-03 11:56:30,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-10-03 11:56:30,945 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 11:56:30,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 11:56:30,946 INFO L82 PathProgramCache]: Analyzing trace with hash 398743461, now seen corresponding path program 5 times [2021-10-03 11:56:30,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 11:56:30,947 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716412896] [2021-10-03 11:56:30,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:30,947 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 11:56:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:30,988 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-03 11:56:30,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 11:56:30,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716412896] [2021-10-03 11:56:30,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716412896] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 11:56:30,989 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 11:56:30,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-03 11:56:30,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836968994] [2021-10-03 11:56:30,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-03 11:56:30,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 11:56:30,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-03 11:56:30,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-03 11:56:30,990 INFO L87 Difference]: Start difference. First operand 1736 states and 6976 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-10-03 11:56:31,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 11:56:31,026 INFO L93 Difference]: Finished difference Result 2384 states and 9117 transitions. [2021-10-03 11:56:31,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-03 11:56:31,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 46 [2021-10-03 11:56:31,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 11:56:31,040 INFO L225 Difference]: With dead ends: 2384 [2021-10-03 11:56:31,041 INFO L226 Difference]: Without dead ends: 2384 [2021-10-03 11:56:31,041 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-03 11:56:31,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2021-10-03 11:56:31,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 2136. [2021-10-03 11:56:31,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2136 states, 2135 states have (on average 3.9747072599531617) internal successors, (8486), 2135 states have internal predecessors, (8486), 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-10-03 11:56:31,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 8486 transitions. [2021-10-03 11:56:31,158 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 8486 transitions. Word has length 46 [2021-10-03 11:56:31,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 11:56:31,158 INFO L470 AbstractCegarLoop]: Abstraction has 2136 states and 8486 transitions. [2021-10-03 11:56:31,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-10-03 11:56:31,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 8486 transitions. [2021-10-03 11:56:31,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-03 11:56:31,166 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 11:56:31,167 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 11:56:31,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-03 11:56:31,167 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 11:56:31,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 11:56:31,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1584993315, now seen corresponding path program 6 times [2021-10-03 11:56:31,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 11:56:31,168 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265731127] [2021-10-03 11:56:31,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:31,168 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 11:56:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:31,210 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-10-03 11:56:31,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 11:56:31,210 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265731127] [2021-10-03 11:56:31,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265731127] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 11:56:31,210 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 11:56:31,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-03 11:56:31,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520509352] [2021-10-03 11:56:31,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-03 11:56:31,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 11:56:31,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-03 11:56:31,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-03 11:56:31,212 INFO L87 Difference]: Start difference. First operand 2136 states and 8486 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-10-03 11:56:31,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 11:56:31,242 INFO L93 Difference]: Finished difference Result 2362 states and 9005 transitions. [2021-10-03 11:56:31,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-03 11:56:31,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 46 [2021-10-03 11:56:31,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 11:56:31,254 INFO L225 Difference]: With dead ends: 2362 [2021-10-03 11:56:31,254 INFO L226 Difference]: Without dead ends: 2306 [2021-10-03 11:56:31,254 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-03 11:56:31,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2021-10-03 11:56:31,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2136. [2021-10-03 11:56:31,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2136 states, 2135 states have (on average 3.862295081967213) internal successors, (8246), 2135 states have internal predecessors, (8246), 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-10-03 11:56:31,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 8246 transitions. [2021-10-03 11:56:31,330 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 8246 transitions. Word has length 46 [2021-10-03 11:56:31,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 11:56:31,330 INFO L470 AbstractCegarLoop]: Abstraction has 2136 states and 8246 transitions. [2021-10-03 11:56:31,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-10-03 11:56:31,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 8246 transitions. [2021-10-03 11:56:31,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-03 11:56:31,360 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 11:56:31,360 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 11:56:31,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-03 11:56:31,361 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 11:56:31,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 11:56:31,361 INFO L82 PathProgramCache]: Analyzing trace with hash -699285783, now seen corresponding path program 7 times [2021-10-03 11:56:31,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 11:56:31,362 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669661600] [2021-10-03 11:56:31,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:31,362 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 11:56:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:31,439 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-03 11:56:31,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 11:56:31,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669661600] [2021-10-03 11:56:31,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669661600] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:31,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873782747] [2021-10-03 11:56:31,440 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-10-03 11:56:31,440 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-03 11:56:31,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-03 11:56:31,442 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-03 11:56:31,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-10-03 11:56:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:31,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-03 11:56:31,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-03 11:56:31,791 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-03 11:56:31,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873782747] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:31,792 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-03 11:56:31,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2021-10-03 11:56:31,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010616462] [2021-10-03 11:56:31,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-03 11:56:31,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 11:56:31,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-03 11:56:31,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-10-03 11:56:31,794 INFO L87 Difference]: Start difference. First operand 2136 states and 8246 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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-10-03 11:56:31,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 11:56:31,872 INFO L93 Difference]: Finished difference Result 4238 states and 15856 transitions. [2021-10-03 11:56:31,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-03 11:56:31,872 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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 46 [2021-10-03 11:56:31,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 11:56:31,893 INFO L225 Difference]: With dead ends: 4238 [2021-10-03 11:56:31,894 INFO L226 Difference]: Without dead ends: 4238 [2021-10-03 11:56:31,894 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 32.1ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-10-03 11:56:31,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4238 states. [2021-10-03 11:56:32,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4238 to 2248. [2021-10-03 11:56:32,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2248 states, 2247 states have (on average 3.856697819314642) internal successors, (8666), 2247 states have internal predecessors, (8666), 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-10-03 11:56:32,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 8666 transitions. [2021-10-03 11:56:32,027 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 8666 transitions. Word has length 46 [2021-10-03 11:56:32,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 11:56:32,027 INFO L470 AbstractCegarLoop]: Abstraction has 2248 states and 8666 transitions. [2021-10-03 11:56:32,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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-10-03 11:56:32,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 8666 transitions. [2021-10-03 11:56:32,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-10-03 11:56:32,035 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 11:56:32,035 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 11:56:32,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-10-03 11:56:32,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-03 11:56:32,250 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 11:56:32,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 11:56:32,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1602146022, now seen corresponding path program 4 times [2021-10-03 11:56:32,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 11:56:32,252 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138567912] [2021-10-03 11:56:32,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:32,252 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 11:56:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:32,351 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-03 11:56:32,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 11:56:32,352 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138567912] [2021-10-03 11:56:32,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138567912] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:32,353 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43694325] [2021-10-03 11:56:32,353 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-03 11:56:32,353 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-03 11:56:32,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-03 11:56:32,356 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-03 11:56:32,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-10-03 11:56:32,562 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-03 11:56:32,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-03 11:56:32,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-03 11:56:32,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-03 11:56:32,732 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-03 11:56:32,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43694325] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:32,732 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-03 11:56:32,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-10-03 11:56:32,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130488728] [2021-10-03 11:56:32,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 11:56:32,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 11:56:32,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 11:56:32,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-10-03 11:56:32,734 INFO L87 Difference]: Start difference. First operand 2248 states and 8666 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 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-10-03 11:56:32,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 11:56:32,858 INFO L93 Difference]: Finished difference Result 3592 states and 12837 transitions. [2021-10-03 11:56:32,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-03 11:56:32,858 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 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 48 [2021-10-03 11:56:32,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 11:56:32,875 INFO L225 Difference]: With dead ends: 3592 [2021-10-03 11:56:32,875 INFO L226 Difference]: Without dead ends: 3592 [2021-10-03 11:56:32,876 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 47.2ms TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-10-03 11:56:32,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3592 states. [2021-10-03 11:56:32,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3592 to 2656. [2021-10-03 11:56:32,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2656 states, 2655 states have (on average 3.871939736346516) internal successors, (10280), 2655 states have internal predecessors, (10280), 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-10-03 11:56:32,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2656 states to 2656 states and 10280 transitions. [2021-10-03 11:56:32,986 INFO L78 Accepts]: Start accepts. Automaton has 2656 states and 10280 transitions. Word has length 48 [2021-10-03 11:56:32,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 11:56:32,987 INFO L470 AbstractCegarLoop]: Abstraction has 2656 states and 10280 transitions. [2021-10-03 11:56:32,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 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-10-03 11:56:32,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2656 states and 10280 transitions. [2021-10-03 11:56:32,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-03 11:56:32,996 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 11:56:32,997 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 11:56:33,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-10-03 11:56:33,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-03 11:56:33,211 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 11:56:33,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 11:56:33,212 INFO L82 PathProgramCache]: Analyzing trace with hash 7643534, now seen corresponding path program 8 times [2021-10-03 11:56:33,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 11:56:33,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109680766] [2021-10-03 11:56:33,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:33,214 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 11:56:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:33,306 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-03 11:56:33,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 11:56:33,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109680766] [2021-10-03 11:56:33,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109680766] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:33,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019986707] [2021-10-03 11:56:33,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-03 11:56:33,307 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-03 11:56:33,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-03 11:56:33,308 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-03 11:56:33,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-10-03 11:56:33,563 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-03 11:56:33,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-03 11:56:33,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-03 11:56:33,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-03 11:56:33,754 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-10-03 11:56:33,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019986707] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:33,754 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-03 11:56:33,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-10-03 11:56:33,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920310321] [2021-10-03 11:56:33,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-03 11:56:33,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 11:56:33,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-03 11:56:33,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-10-03 11:56:33,756 INFO L87 Difference]: Start difference. First operand 2656 states and 10280 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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-10-03 11:56:33,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 11:56:33,858 INFO L93 Difference]: Finished difference Result 5474 states and 20616 transitions. [2021-10-03 11:56:33,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-03 11:56:33,858 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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 50 [2021-10-03 11:56:33,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 11:56:33,888 INFO L225 Difference]: With dead ends: 5474 [2021-10-03 11:56:33,888 INFO L226 Difference]: Without dead ends: 5474 [2021-10-03 11:56:33,889 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 36.8ms TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-10-03 11:56:33,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5474 states. [2021-10-03 11:56:33,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5474 to 3296. [2021-10-03 11:56:34,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3296 states, 3295 states have (on average 3.882852807283763) internal successors, (12794), 3295 states have internal predecessors, (12794), 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-10-03 11:56:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3296 states to 3296 states and 12794 transitions. [2021-10-03 11:56:34,075 INFO L78 Accepts]: Start accepts. Automaton has 3296 states and 12794 transitions. Word has length 50 [2021-10-03 11:56:34,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 11:56:34,076 INFO L470 AbstractCegarLoop]: Abstraction has 3296 states and 12794 transitions. [2021-10-03 11:56:34,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 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-10-03 11:56:34,076 INFO L276 IsEmpty]: Start isEmpty. Operand 3296 states and 12794 transitions. [2021-10-03 11:56:34,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-03 11:56:34,088 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 11:56:34,088 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 11:56:34,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-10-03 11:56:34,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-10-03 11:56:34,303 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 11:56:34,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 11:56:34,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1563071302, now seen corresponding path program 5 times [2021-10-03 11:56:34,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 11:56:34,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034658573] [2021-10-03 11:56:34,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:34,305 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 11:56:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:34,401 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-10-03 11:56:34,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 11:56:34,401 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034658573] [2021-10-03 11:56:34,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034658573] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 11:56:34,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 11:56:34,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-03 11:56:34,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653852748] [2021-10-03 11:56:34,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-03 11:56:34,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 11:56:34,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-03 11:56:34,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-03 11:56:34,403 INFO L87 Difference]: Start difference. First operand 3296 states and 12794 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-10-03 11:56:34,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 11:56:34,470 INFO L93 Difference]: Finished difference Result 7722 states and 28974 transitions. [2021-10-03 11:56:34,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-03 11:56:34,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 50 [2021-10-03 11:56:34,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 11:56:34,505 INFO L225 Difference]: With dead ends: 7722 [2021-10-03 11:56:34,505 INFO L226 Difference]: Without dead ends: 7722 [2021-10-03 11:56:34,506 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-03 11:56:34,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7722 states. [2021-10-03 11:56:34,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7722 to 3916. [2021-10-03 11:56:34,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3916 states, 3915 states have (on average 3.871264367816092) internal successors, (15156), 3915 states have internal predecessors, (15156), 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-10-03 11:56:34,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3916 states to 3916 states and 15156 transitions. [2021-10-03 11:56:34,699 INFO L78 Accepts]: Start accepts. Automaton has 3916 states and 15156 transitions. Word has length 50 [2021-10-03 11:56:34,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 11:56:34,699 INFO L470 AbstractCegarLoop]: Abstraction has 3916 states and 15156 transitions. [2021-10-03 11:56:34,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-10-03 11:56:34,699 INFO L276 IsEmpty]: Start isEmpty. Operand 3916 states and 15156 transitions. [2021-10-03 11:56:34,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-03 11:56:34,713 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 11:56:34,713 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 11:56:34,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-03 11:56:34,713 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 11:56:34,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 11:56:34,714 INFO L82 PathProgramCache]: Analyzing trace with hash 535568112, now seen corresponding path program 6 times [2021-10-03 11:56:34,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 11:56:34,714 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194452179] [2021-10-03 11:56:34,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:34,715 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 11:56:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:34,809 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-10-03 11:56:34,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 11:56:34,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194452179] [2021-10-03 11:56:34,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194452179] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 11:56:34,810 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-03 11:56:34,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-03 11:56:34,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194079631] [2021-10-03 11:56:34,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-03 11:56:34,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 11:56:34,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-03 11:56:34,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-03 11:56:34,811 INFO L87 Difference]: Start difference. First operand 3916 states and 15156 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-10-03 11:56:34,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 11:56:34,985 INFO L93 Difference]: Finished difference Result 6396 states and 24272 transitions. [2021-10-03 11:56:34,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-03 11:56:34,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 50 [2021-10-03 11:56:34,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 11:56:35,026 INFO L225 Difference]: With dead ends: 6396 [2021-10-03 11:56:35,027 INFO L226 Difference]: Without dead ends: 6396 [2021-10-03 11:56:35,027 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-03 11:56:35,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6396 states. [2021-10-03 11:56:35,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6396 to 3916. [2021-10-03 11:56:35,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3916 states, 3915 states have (on average 3.871264367816092) internal successors, (15156), 3915 states have internal predecessors, (15156), 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-10-03 11:56:35,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3916 states to 3916 states and 15156 transitions. [2021-10-03 11:56:35,211 INFO L78 Accepts]: Start accepts. Automaton has 3916 states and 15156 transitions. Word has length 50 [2021-10-03 11:56:35,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 11:56:35,211 INFO L470 AbstractCegarLoop]: Abstraction has 3916 states and 15156 transitions. [2021-10-03 11:56:35,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-10-03 11:56:35,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3916 states and 15156 transitions. [2021-10-03 11:56:35,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-03 11:56:35,227 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 11:56:35,227 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 11:56:35,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-03 11:56:35,227 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 11:56:35,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 11:56:35,228 INFO L82 PathProgramCache]: Analyzing trace with hash 561117693, now seen corresponding path program 1 times [2021-10-03 11:56:35,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 11:56:35,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38494562] [2021-10-03 11:56:35,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:35,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 11:56:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:35,332 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-10-03 11:56:35,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 11:56:35,333 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38494562] [2021-10-03 11:56:35,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38494562] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:35,333 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688556535] [2021-10-03 11:56:35,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:35,333 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-03 11:56:35,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-03 11:56:35,334 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-03 11:56:35,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-10-03 11:56:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:35,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-03 11:56:35,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-03 11:56:35,678 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-10-03 11:56:35,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688556535] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-03 11:56:35,679 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-03 11:56:35,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2021-10-03 11:56:35,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787725356] [2021-10-03 11:56:35,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-03 11:56:35,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 11:56:35,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-03 11:56:35,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-03 11:56:35,680 INFO L87 Difference]: Start difference. First operand 3916 states and 15156 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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-10-03 11:56:35,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 11:56:35,729 INFO L93 Difference]: Finished difference Result 5211 states and 19096 transitions. [2021-10-03 11:56:35,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-03 11:56:35,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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 51 [2021-10-03 11:56:35,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 11:56:35,750 INFO L225 Difference]: With dead ends: 5211 [2021-10-03 11:56:35,750 INFO L226 Difference]: Without dead ends: 3916 [2021-10-03 11:56:35,750 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-10-03 11:56:35,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3916 states. [2021-10-03 11:56:35,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3916 to 3916. [2021-10-03 11:56:35,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3916 states, 3915 states have (on average 3.7052362707535123) internal successors, (14506), 3915 states have internal predecessors, (14506), 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-10-03 11:56:35,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3916 states to 3916 states and 14506 transitions. [2021-10-03 11:56:35,967 INFO L78 Accepts]: Start accepts. Automaton has 3916 states and 14506 transitions. Word has length 51 [2021-10-03 11:56:35,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 11:56:35,969 INFO L470 AbstractCegarLoop]: Abstraction has 3916 states and 14506 transitions. [2021-10-03 11:56:35,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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-10-03 11:56:35,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3916 states and 14506 transitions. [2021-10-03 11:56:35,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-03 11:56:35,982 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 11:56:35,983 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 11:56:36,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-10-03 11:56:36,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-03 11:56:36,199 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 11:56:36,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 11:56:36,200 INFO L82 PathProgramCache]: Analyzing trace with hash -980903449, now seen corresponding path program 1 times [2021-10-03 11:56:36,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 11:56:36,201 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029624390] [2021-10-03 11:56:36,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:36,201 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 11:56:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:36,258 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-10-03 11:56:36,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 11:56:36,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029624390] [2021-10-03 11:56:36,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029624390] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:36,259 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315451602] [2021-10-03 11:56:36,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:36,259 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-03 11:56:36,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-03 11:56:36,260 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-03 11:56:36,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-10-03 11:56:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:36,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-03 11:56:36,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-03 11:56:36,652 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-10-03 11:56:36,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315451602] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:36,652 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-03 11:56:36,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-10-03 11:56:36,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138701551] [2021-10-03 11:56:36,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-03 11:56:36,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 11:56:36,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-03 11:56:36,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-03 11:56:36,655 INFO L87 Difference]: Start difference. First operand 3916 states and 14506 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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-10-03 11:56:36,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 11:56:36,732 INFO L93 Difference]: Finished difference Result 6486 states and 24287 transitions. [2021-10-03 11:56:36,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-03 11:56:36,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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 52 [2021-10-03 11:56:36,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 11:56:36,761 INFO L225 Difference]: With dead ends: 6486 [2021-10-03 11:56:36,761 INFO L226 Difference]: Without dead ends: 6486 [2021-10-03 11:56:36,762 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 26.8ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-03 11:56:36,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6486 states. [2021-10-03 11:56:36,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6486 to 5216. [2021-10-03 11:56:36,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5216 states, 5215 states have (on average 3.7300095877277086) internal successors, (19452), 5215 states have internal predecessors, (19452), 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-10-03 11:56:37,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5216 states to 5216 states and 19452 transitions. [2021-10-03 11:56:37,004 INFO L78 Accepts]: Start accepts. Automaton has 5216 states and 19452 transitions. Word has length 52 [2021-10-03 11:56:37,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 11:56:37,005 INFO L470 AbstractCegarLoop]: Abstraction has 5216 states and 19452 transitions. [2021-10-03 11:56:37,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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-10-03 11:56:37,005 INFO L276 IsEmpty]: Start isEmpty. Operand 5216 states and 19452 transitions. [2021-10-03 11:56:37,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-03 11:56:37,022 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 11:56:37,022 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 11:56:37,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-10-03 11:56:37,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-03 11:56:37,236 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 11:56:37,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 11:56:37,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1665227334, now seen corresponding path program 2 times [2021-10-03 11:56:37,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 11:56:37,237 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548030632] [2021-10-03 11:56:37,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:37,238 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 11:56:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:37,345 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-10-03 11:56:37,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 11:56:37,346 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548030632] [2021-10-03 11:56:37,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548030632] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:37,346 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804941618] [2021-10-03 11:56:37,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-03 11:56:37,347 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-03 11:56:37,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-03 11:56:37,348 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-03 11:56:37,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-10-03 11:56:37,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-03 11:56:37,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-03 11:56:37,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-03 11:56:37,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-03 11:56:37,745 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-10-03 11:56:37,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804941618] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:37,745 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-03 11:56:37,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2021-10-03 11:56:37,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287229531] [2021-10-03 11:56:37,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-03 11:56:37,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 11:56:37,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-03 11:56:37,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-10-03 11:56:37,747 INFO L87 Difference]: Start difference. First operand 5216 states and 19452 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 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-10-03 11:56:37,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 11:56:37,934 INFO L93 Difference]: Finished difference Result 7786 states and 29233 transitions. [2021-10-03 11:56:37,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-03 11:56:37,935 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 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 54 [2021-10-03 11:56:37,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 11:56:37,965 INFO L225 Difference]: With dead ends: 7786 [2021-10-03 11:56:37,965 INFO L226 Difference]: Without dead ends: 7786 [2021-10-03 11:56:37,966 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 29.8ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-10-03 11:56:37,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7786 states. [2021-10-03 11:56:38,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7786 to 6516. [2021-10-03 11:56:38,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6516 states, 6515 states have (on average 3.7448963929393706) internal successors, (24398), 6515 states have internal predecessors, (24398), 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-10-03 11:56:38,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6516 states to 6516 states and 24398 transitions. [2021-10-03 11:56:38,298 INFO L78 Accepts]: Start accepts. Automaton has 6516 states and 24398 transitions. Word has length 54 [2021-10-03 11:56:38,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 11:56:38,300 INFO L470 AbstractCegarLoop]: Abstraction has 6516 states and 24398 transitions. [2021-10-03 11:56:38,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 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-10-03 11:56:38,301 INFO L276 IsEmpty]: Start isEmpty. Operand 6516 states and 24398 transitions. [2021-10-03 11:56:38,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-10-03 11:56:38,346 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 11:56:38,346 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 11:56:38,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-10-03 11:56:38,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-10-03 11:56:38,560 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 11:56:38,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 11:56:38,561 INFO L82 PathProgramCache]: Analyzing trace with hash 2124482765, now seen corresponding path program 3 times [2021-10-03 11:56:38,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 11:56:38,562 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152252074] [2021-10-03 11:56:38,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:38,563 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 11:56:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:38,662 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-10-03 11:56:38,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 11:56:38,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152252074] [2021-10-03 11:56:38,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152252074] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:38,663 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540910811] [2021-10-03 11:56:38,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-03 11:56:38,663 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-03 11:56:38,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-03 11:56:38,664 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-03 11:56:38,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-10-03 11:56:39,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-10-03 11:56:39,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-03 11:56:39,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-03 11:56:39,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-03 11:56:39,607 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-10-03 11:56:39,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540910811] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:39,608 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-03 11:56:39,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-10-03 11:56:39,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675420584] [2021-10-03 11:56:39,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-03 11:56:39,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 11:56:39,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-03 11:56:39,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-10-03 11:56:39,610 INFO L87 Difference]: Start difference. First operand 6516 states and 24398 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 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-10-03 11:56:39,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 11:56:39,759 INFO L93 Difference]: Finished difference Result 9086 states and 34179 transitions. [2021-10-03 11:56:39,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-03 11:56:39,760 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 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 56 [2021-10-03 11:56:39,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 11:56:39,799 INFO L225 Difference]: With dead ends: 9086 [2021-10-03 11:56:39,800 INFO L226 Difference]: Without dead ends: 9086 [2021-10-03 11:56:39,800 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 60.4ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-10-03 11:56:39,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9086 states. [2021-10-03 11:56:40,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9086 to 7816. [2021-10-03 11:56:40,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7816 states, 7815 states have (on average 3.7548304542546385) internal successors, (29344), 7815 states have internal predecessors, (29344), 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-10-03 11:56:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7816 states to 7816 states and 29344 transitions. [2021-10-03 11:56:40,149 INFO L78 Accepts]: Start accepts. Automaton has 7816 states and 29344 transitions. Word has length 56 [2021-10-03 11:56:40,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 11:56:40,150 INFO L470 AbstractCegarLoop]: Abstraction has 7816 states and 29344 transitions. [2021-10-03 11:56:40,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 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-10-03 11:56:40,150 INFO L276 IsEmpty]: Start isEmpty. Operand 7816 states and 29344 transitions. [2021-10-03 11:56:40,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-03 11:56:40,176 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 11:56:40,176 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 11:56:40,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-10-03 11:56:40,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-10-03 11:56:40,391 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 11:56:40,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 11:56:40,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1903620896, now seen corresponding path program 4 times [2021-10-03 11:56:40,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 11:56:40,392 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879075149] [2021-10-03 11:56:40,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:40,393 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 11:56:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-03 11:56:40,492 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-10-03 11:56:40,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-03 11:56:40,492 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879075149] [2021-10-03 11:56:40,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879075149] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:40,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74032707] [2021-10-03 11:56:40,493 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-03 11:56:40,493 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-03 11:56:40,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-03 11:56:40,496 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-03 11:56:40,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-10-03 11:56:40,848 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-03 11:56:40,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-03 11:56:40,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-03 11:56:40,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-03 11:56:41,023 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-10-03 11:56:41,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74032707] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-03 11:56:41,024 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-03 11:56:41,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-10-03 11:56:41,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975291334] [2021-10-03 11:56:41,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-03 11:56:41,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-03 11:56:41,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-03 11:56:41,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-10-03 11:56:41,026 INFO L87 Difference]: Start difference. First operand 7816 states and 29344 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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-10-03 11:56:41,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-03 11:56:41,155 INFO L93 Difference]: Finished difference Result 9736 states and 36652 transitions. [2021-10-03 11:56:41,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-03 11:56:41,156 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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 58 [2021-10-03 11:56:41,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-03 11:56:41,401 INFO L225 Difference]: With dead ends: 9736 [2021-10-03 11:56:41,405 INFO L226 Difference]: Without dead ends: 9736 [2021-10-03 11:56:41,405 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 54.7ms TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-10-03 11:56:41,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9736 states. [2021-10-03 11:56:41,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9736 to 9116. [2021-10-03 11:56:41,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9116 states, 9115 states have (on average 3.761930883159627) internal successors, (34290), 9115 states have internal predecessors, (34290), 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-10-03 11:56:41,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9116 states to 9116 states and 34290 transitions. [2021-10-03 11:56:41,828 INFO L78 Accepts]: Start accepts. Automaton has 9116 states and 34290 transitions. Word has length 58 [2021-10-03 11:56:41,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-03 11:56:41,831 INFO L470 AbstractCegarLoop]: Abstraction has 9116 states and 34290 transitions. [2021-10-03 11:56:41,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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-10-03 11:56:41,831 INFO L276 IsEmpty]: Start isEmpty. Operand 9116 states and 34290 transitions. [2021-10-03 11:56:41,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-03 11:56:41,863 INFO L504 BasicCegarLoop]: Found error trace [2021-10-03 11:56:41,864 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-03 11:56:41,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-10-03 11:56:42,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-10-03 11:56:42,078 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-03 11:56:42,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-03 11:56:42,080 INFO L82 PathProgramCache]: Analyzing trace with hash 108762291, now seen corresponding path program 5 times [2021-10-03 11:56:42,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-03 11:56:42,080 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519557666] [2021-10-03 11:56:42,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-03 11:56:42,082 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-03 11:56:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-03 11:56:42,419 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-03 11:56:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-03 11:56:42,594 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-03 11:56:42,594 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-03 11:56:42,595 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-03 11:56:42,597 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-03 11:56:42,597 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-03 11:56:42,598 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-03 11:56:42,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-03 11:56:42,605 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-03 11:56:42,605 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-03 11:56:42,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 11:56:42 BasicIcfg [2021-10-03 11:56:42,741 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-03 11:56:42,741 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-03 11:56:42,741 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-03 11:56:42,742 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-03 11:56:42,742 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 11:56:14" (3/4) ... [2021-10-03 11:56:42,744 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-03 11:56:42,874 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-10-03 11:56:42,875 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-03 11:56:42,877 INFO L168 Benchmark]: Toolchain (without parser) took 29368.67 ms. Allocated memory was 48.2 MB in the beginning and 910.2 MB in the end (delta: 861.9 MB). Free memory was 23.9 MB in the beginning and 459.3 MB in the end (delta: -435.3 MB). Peak memory consumption was 429.7 MB. Max. memory is 16.1 GB. [2021-10-03 11:56:42,878 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 37.7 MB. Free memory is still 22.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-03 11:56:42,878 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.82 ms. Allocated memory is still 48.2 MB. Free memory was 23.6 MB in the beginning and 24.0 MB in the end (delta: -331.6 kB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2021-10-03 11:56:42,879 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.18 ms. Allocated memory is still 48.2 MB. Free memory was 24.0 MB in the beginning and 21.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-03 11:56:42,879 INFO L168 Benchmark]: Boogie Preprocessor took 82.38 ms. Allocated memory is still 48.2 MB. Free memory was 21.8 MB in the beginning and 31.8 MB in the end (delta: -10.0 MB). Peak memory consumption was 3.2 MB. Max. memory is 16.1 GB. [2021-10-03 11:56:42,880 INFO L168 Benchmark]: RCFGBuilder took 697.38 ms. Allocated memory is still 48.2 MB. Free memory was 31.6 MB in the beginning and 26.4 MB in the end (delta: 5.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 16.1 GB. [2021-10-03 11:56:42,880 INFO L168 Benchmark]: TraceAbstraction took 27989.92 ms. Allocated memory was 48.2 MB in the beginning and 910.2 MB in the end (delta: 861.9 MB). Free memory was 25.9 MB in the beginning and 477.1 MB in the end (delta: -451.3 MB). Peak memory consumption was 408.8 MB. Max. memory is 16.1 GB. [2021-10-03 11:56:42,880 INFO L168 Benchmark]: Witness Printer took 133.37 ms. Allocated memory is still 910.2 MB. Free memory was 477.1 MB in the beginning and 459.3 MB in the end (delta: 17.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-03 11:56:42,884 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.24 ms. Allocated memory is still 37.7 MB. Free memory is still 22.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 359.82 ms. Allocated memory is still 48.2 MB. Free memory was 23.6 MB in the beginning and 24.0 MB in the end (delta: -331.6 kB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 89.18 ms. Allocated memory is still 48.2 MB. Free memory was 24.0 MB in the beginning and 21.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 82.38 ms. Allocated memory is still 48.2 MB. Free memory was 21.8 MB in the beginning and 31.8 MB in the end (delta: -10.0 MB). Peak memory consumption was 3.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 697.38 ms. Allocated memory is still 48.2 MB. Free memory was 31.6 MB in the beginning and 26.4 MB in the end (delta: 5.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 27989.92 ms. Allocated memory was 48.2 MB in the beginning and 910.2 MB in the end (delta: 861.9 MB). Free memory was 25.9 MB in the beginning and 477.1 MB in the end (delta: -451.3 MB). Peak memory consumption was 408.8 MB. Max. memory is 16.1 GB. * Witness Printer took 133.37 ms. Allocated memory is still 910.2 MB. Free memory was 477.1 MB in the beginning and 459.3 MB in the end (delta: 17.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6861.3ms, 200 PlacesBefore, 41 PlacesAfterwards, 212 TransitionsBefore, 40 TransitionsAfterwards, 4272 CoEnabledTransitionPairs, 7 FixpointIterations, 109 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 9 ConcurrentYvCompositions, 13 ChoiceCompositions, 208 TotalNumberOfCompositions, 5981 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4386, positive: 4248, positive conditional: 0, positive unconditional: 4248, negative: 138, negative conditional: 0, negative unconditional: 138, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2923, positive: 2888, positive conditional: 0, positive unconditional: 2888, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2923, positive: 2888, positive conditional: 0, positive unconditional: 2888, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 35, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4386, positive: 1360, positive conditional: 0, positive unconditional: 1360, negative: 103, negative conditional: 0, negative unconditional: 103, unknown: 2923, unknown conditional: 0, unknown unconditional: 2923] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 148, Positive conditional cache size: 0, Positive unconditional cache size: 148, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12 - 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: 79]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] 0 int *a1, *a2, *a3; [L18] 0 int res1, res2, res3; [L19] 0 _Bool isNull1, isNull2, isNull3; [L61] 0 pthread_t t1, t2, t3; [L14] COND FALSE 0 !(!cond) [L85] 0 int* arr = (int*)malloc(sizeof(int) * size); [L86] 0 int i = 0; VAL [a1={0:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={0:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={0:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={0:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={0:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={0:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND FALSE 0 !(i < size) [L89] 0 return arr; [L63] 0 a1 = create_fresh_int_array(5) [L14] COND FALSE 0 !(!cond) [L85] 0 int* arr = (int*)malloc(sizeof(int) * size); [L86] 0 int i = 0; VAL [a1={2:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={2:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={2:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={2:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={2:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={2:0}, a2={0:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND FALSE 0 !(i < size) [L89] 0 return arr; [L64] 0 a2 = create_fresh_int_array(5) [L14] COND FALSE 0 !(!cond) [L85] 0 int* arr = (int*)malloc(sizeof(int) * size); [L86] 0 int i = 0; VAL [a1={2:0}, a2={3:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={2:0}, a2={3:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={2:0}, a2={3:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={2:0}, a2={3:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={2:0}, a2={3:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND TRUE 0 i < size [L87] 0 arr[i] = __VERIFIER_nondet_int() [L86] 0 i++ VAL [a1={2:0}, a2={3:0}, a3={0:0}, isNull1=0, isNull2=0, isNull3=0, res1=0, res2=0, res3=0] [L86] COND FALSE 0 !(i < size) [L89] 0 return arr; [L65] 0 a3 = create_fresh_int_array(5) [L66] 0 isNull1 = __VERIFIER_nondet_bool() [L67] 0 isNull2 = __VERIFIER_nondet_bool() [L68] 0 isNull3 = __VERIFIER_nondet_bool() [L71] FCALL, FORK 0 pthread_create(&t1, NULL, thread1, NULL) VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=0, res2=0, res3=0] [L72] FCALL, FORK 0 pthread_create(&t2, NULL, thread2, NULL) VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=0, res2=0, res3=0] [L73] FCALL, FORK 0 pthread_create(&t3, NULL, thread3, NULL) VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=0, res2=0, res3=0] [L49] 3 int i = 0; [L14] COND FALSE 3 !(!cond) VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=0, res2=0, res3=0] [L51] COND TRUE 3 !isNull3 && i < 5 [L52] EXPR 3 a1[i] [L52] EXPR 3 a3[i] [L52] 3 res2 = a1[i] - a3[i] [L74] 0 \read(t1) VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=0, res2=-3, res3=0] [L53] COND FALSE 3 !(res2 == 0) [L56] 3 i++ VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=0, res2=-3, res3=0] [L51] COND TRUE 3 !isNull3 && i < 5 [L52] EXPR 3 a1[i] [L52] EXPR 3 a3[i] [L52] 3 res2 = a1[i] - a3[i] [L53] COND FALSE 3 !(res2 == 0) [L56] 3 i++ VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=0, res2=4, res3=0] [L51] COND TRUE 3 !isNull3 && i < 5 [L52] EXPR 3 a1[i] [L52] EXPR 3 a3[i] [L52] 3 res2 = a1[i] - a3[i] [L53] COND FALSE 3 !(res2 == 0) [L56] 3 i++ VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=0, res2=-1, res3=0] [L51] COND TRUE 3 !isNull3 && i < 5 [L52] EXPR 3 a1[i] [L52] EXPR 3 a3[i] [L52] 3 res2 = a1[i] - a3[i] [L53] COND FALSE 3 !(res2 == 0) [L56] 3 i++ VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=0, res2=1, res3=0] [L24] 1 int i = 0; [L14] COND FALSE 1 !(!cond) [L26] 1 res1 = 1 VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=1, res2=1, res3=0] [L27] COND TRUE 1 !isNull2 && i < 5 [L28] EXPR 1 a1[i] VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=1, res2=1, res3=0] [L28] EXPR 1 a2[i] [L28] 1 res1 = a1[i] - a2[i] [L29] COND FALSE 1 !(res1 == 0) [L32] 1 i++ VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=-3, res2=1, res3=0] [L27] COND TRUE 1 !isNull2 && i < 5 [L28] EXPR 1 a1[i] VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=-3, res2=1, res3=0] [L28] EXPR 1 a2[i] [L28] 1 res1 = a1[i] - a2[i] [L29] COND FALSE 1 !(res1 == 0) [L32] 1 i++ VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=-1, res2=1, res3=0] [L27] COND TRUE 1 !isNull2 && i < 5 [L28] EXPR 1 a1[i] VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=-1, res2=1, res3=0] [L28] EXPR 1 a2[i] [L28] 1 res1 = a1[i] - a2[i] [L29] COND FALSE 1 !(res1 == 0) [L32] 1 i++ VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=1, res2=1, res3=0] [L27] COND TRUE 1 !isNull2 && i < 5 [L28] EXPR 1 a1[i] VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=1, res2=1, res3=0] [L28] EXPR 1 a2[i] [L28] 1 res1 = a1[i] - a2[i] [L29] COND FALSE 1 !(res1 == 0) [L32] 1 i++ VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=-1, res2=1, res3=0] [L27] COND TRUE 1 !isNull2 && i < 5 [L28] EXPR 1 a1[i] VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=-1, res2=1, res3=0] [L28] EXPR 1 a2[i] [L28] 1 res1 = a1[i] - a2[i] [L29] COND FALSE 1 !(res1 == 0) [L32] 1 i++ VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=2, res2=1, res3=0] [L27] COND FALSE 1 !(!isNull2 && i < 5) [L74] FCALL, JOIN 1 pthread_join(t1, 0) VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=2, res2=1, res3=0] [L75] 0 \read(t2) VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=2, res2=1, res3=0] [L37] 2 int i = 0; [L14] COND FALSE 2 !(!cond) VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=2, res2=1, res3=0] [L39] COND TRUE 2 !isNull3 && i < 5 [L40] EXPR 2 a2[i] VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=2, res2=1, res3=0] [L40] EXPR 2 a3[i] VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=2, res2=1, res3=0] [L40] 2 res2 = a2[i] - a3[i] VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=2, res2=0, res3=0] [L41] COND TRUE 2 res2 == 0 [L51] COND TRUE 3 !isNull3 && i < 5 [L52] EXPR 3 a1[i] [L52] EXPR 3 a3[i] [L52] 3 res2 = a1[i] - a3[i] [L75] FCALL, JOIN 2 pthread_join(t2, 0) VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=2, res2=1, res3=0] [L53] COND FALSE 3 !(res2 == 0) [L56] 3 i++ VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=2, res2=1, res3=0] [L51] COND FALSE 3 !(!isNull3 && i < 5) [L76] 0 \read(t3) VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=2, res2=1, res3=0] [L76] FCALL, JOIN 3 pthread_join(t3, 0) VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=2, res2=1, res3=0] [L14] COND FALSE 0 !(!cond) [L79] 0 reach_error() VAL [a1={2:0}, a2={3:0}, a3={-11:0}, isNull1=512, isNull2=256, isNull3=768, res1=2, res2=1, res3=0] - UnprovableResult [Line: 72]: 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: 71]: 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: 73]: 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, 249 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 27563.4ms, OverallIterations: 29, TraceHistogramMax: 5, EmptinessCheckTime: 325.0ms, AutomataDifference: 2980.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6955.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1547 SDtfs, 2136 SDslu, 3072 SDs, 0 SdLazy, 786 SolverSat, 185 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 716.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 918 GetRequests, 773 SyntacticMatches, 10 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 722.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=9116occurred in iteration=28, InterpolantAutomatonStates: 146, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 3316.1ms AutomataMinimizationTime, 28 MinimizatonAttempts, 22666 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 398.2ms SsaConstructionTime, 2737.7ms SatisfiabilityAnalysisTime, 4058.0ms InterpolantComputationTime, 2027 NumberOfCodeBlocks, 1998 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 1921 ConstructedInterpolants, 0 QuantifiedInterpolants, 5138 SizeOfPredicates, 32 NumberOfNonLiveVariables, 5676 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 46 InterpolantComputations, 13 PerfectInterpolantSequences, 1820/2032 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-10-03 11:56:42,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...