./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/byte_add_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 11:40:45,055 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 11:40:45,056 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 11:40:45,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 11:40:45,103 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 11:40:45,108 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 11:40:45,109 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 11:40:45,112 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 11:40:45,114 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 11:40:45,115 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 11:40:45,116 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 11:40:45,117 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 11:40:45,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 11:40:45,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 11:40:45,122 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 11:40:45,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 11:40:45,124 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 11:40:45,125 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 11:40:45,126 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 11:40:45,130 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 11:40:45,133 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 11:40:45,133 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 11:40:45,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 11:40:45,135 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 11:40:45,136 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 11:40:45,138 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 11:40:45,138 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 11:40:45,139 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 11:40:45,140 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 11:40:45,140 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 11:40:45,140 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 11:40:45,141 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 11:40:45,142 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 11:40:45,142 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 11:40:45,143 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 11:40:45,144 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 11:40:45,144 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 11:40:45,145 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 11:40:45,145 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 11:40:45,145 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 11:40:45,146 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 11:40:45,146 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 11:40:45,169 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 11:40:45,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 11:40:45,170 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 11:40:45,170 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 11:40:45,171 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 11:40:45,171 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 11:40:45,172 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 11:40:45,172 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 11:40:45,172 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 11:40:45,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 11:40:45,173 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 11:40:45,173 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 11:40:45,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 11:40:45,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 11:40:45,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 11:40:45,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 11:40:45,174 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 11:40:45,174 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 11:40:45,174 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 11:40:45,174 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 11:40:45,174 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 11:40:45,174 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 11:40:45,174 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 11:40:45,175 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 11:40:45,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:40:45,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 11:40:45,175 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 11:40:45,176 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 11:40:45,176 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 11:40:45,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 11:40:45,176 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 11:40:45,176 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 11:40:45,177 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 11:40:45,177 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 11:40:45,177 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 [2021-12-14 11:40:45,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 11:40:45,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 11:40:45,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 11:40:45,370 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 11:40:45,370 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 11:40:45,371 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-1.i [2021-12-14 11:40:45,431 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8311b85a9/cafe4f5107db42f199cef21b42ea6d27/FLAG48c976f3f [2021-12-14 11:40:45,787 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 11:40:45,787 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i [2021-12-14 11:40:45,792 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8311b85a9/cafe4f5107db42f199cef21b42ea6d27/FLAG48c976f3f [2021-12-14 11:40:45,800 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8311b85a9/cafe4f5107db42f199cef21b42ea6d27 [2021-12-14 11:40:45,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 11:40:45,802 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 11:40:45,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 11:40:45,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 11:40:45,806 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 11:40:45,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:40:45" (1/1) ... [2021-12-14 11:40:45,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b730d85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:45, skipping insertion in model container [2021-12-14 11:40:45,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:40:45" (1/1) ... [2021-12-14 11:40:45,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 11:40:45,828 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 11:40:45,934 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i[1168,1181] [2021-12-14 11:40:45,968 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:40:45,974 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 11:40:45,981 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i[1168,1181] [2021-12-14 11:40:46,010 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:40:46,018 INFO L208 MainTranslator]: Completed translation [2021-12-14 11:40:46,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:46 WrapperNode [2021-12-14 11:40:46,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 11:40:46,021 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 11:40:46,021 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 11:40:46,021 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 11:40:46,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:46" (1/1) ... [2021-12-14 11:40:46,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:46" (1/1) ... [2021-12-14 11:40:46,042 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2021-12-14 11:40:46,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 11:40:46,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 11:40:46,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 11:40:46,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 11:40:46,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:46" (1/1) ... [2021-12-14 11:40:46,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:46" (1/1) ... [2021-12-14 11:40:46,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:46" (1/1) ... [2021-12-14 11:40:46,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:46" (1/1) ... [2021-12-14 11:40:46,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:46" (1/1) ... [2021-12-14 11:40:46,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:46" (1/1) ... [2021-12-14 11:40:46,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:46" (1/1) ... [2021-12-14 11:40:46,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 11:40:46,058 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 11:40:46,058 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 11:40:46,058 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 11:40:46,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:46" (1/1) ... [2021-12-14 11:40:46,071 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:40:46,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:40:46,104 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 11:40:46,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 11:40:46,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 11:40:46,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 11:40:46,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 11:40:46,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 11:40:46,185 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 11:40:46,186 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 11:40:46,362 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 11:40:46,366 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 11:40:46,367 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-14 11:40:46,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:40:46 BoogieIcfgContainer [2021-12-14 11:40:46,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 11:40:46,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 11:40:46,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 11:40:46,381 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 11:40:46,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:40:45" (1/3) ... [2021-12-14 11:40:46,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18534982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:40:46, skipping insertion in model container [2021-12-14 11:40:46,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:46" (2/3) ... [2021-12-14 11:40:46,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18534982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:40:46, skipping insertion in model container [2021-12-14 11:40:46,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:40:46" (3/3) ... [2021-12-14 11:40:46,382 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add_1-1.i [2021-12-14 11:40:46,385 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 11:40:46,386 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 11:40:46,414 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 11:40:46,418 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, mAutomataTypeConcurrency=PETRI_NET, 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-12-14 11:40:46,418 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 11:40:46,427 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 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-12-14 11:40:46,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 11:40:46,433 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:46,433 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:40:46,434 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:46,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:46,437 INFO L85 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2021-12-14 11:40:46,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:46,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355211617] [2021-12-14 11:40:46,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:46,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:46,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:40:46,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:46,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355211617] [2021-12-14 11:40:46,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355211617] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:46,546 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:40:46,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 11:40:46,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122867634] [2021-12-14 11:40:46,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:46,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 11:40:46,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:46,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 11:40:46,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 11:40:46,575 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:46,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:46,590 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2021-12-14 11:40:46,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 11:40:46,592 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-14 11:40:46,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:46,597 INFO L225 Difference]: With dead ends: 57 [2021-12-14 11:40:46,597 INFO L226 Difference]: Without dead ends: 38 [2021-12-14 11:40:46,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 11:40:46,603 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:46,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:40:46,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-14 11:40:46,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-12-14 11:40:46,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 37 states have internal predecessors, (64), 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-12-14 11:40:46,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2021-12-14 11:40:46,624 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2021-12-14 11:40:46,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:46,624 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2021-12-14 11:40:46,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:46,624 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2021-12-14 11:40:46,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 11:40:46,624 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:46,625 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:40:46,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 11:40:46,625 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:46,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:46,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2021-12-14 11:40:46,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:46,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420109100] [2021-12-14 11:40:46,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:46,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:46,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:40:46,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:46,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420109100] [2021-12-14 11:40:46,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420109100] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:46,730 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:40:46,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:40:46,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300872157] [2021-12-14 11:40:46,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:46,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:40:46,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:46,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:40:46,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:40:46,734 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:46,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:46,849 INFO L93 Difference]: Finished difference Result 89 states and 156 transitions. [2021-12-14 11:40:46,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:40:46,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-14 11:40:46,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:46,851 INFO L225 Difference]: With dead ends: 89 [2021-12-14 11:40:46,852 INFO L226 Difference]: Without dead ends: 61 [2021-12-14 11:40:46,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:40:46,853 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 24 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:46,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 59 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:40:46,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-12-14 11:40:46,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2021-12-14 11:40:46,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 58 states have internal predecessors, (89), 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-12-14 11:40:46,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2021-12-14 11:40:46,859 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 12 [2021-12-14 11:40:46,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:46,859 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2021-12-14 11:40:46,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:46,860 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2021-12-14 11:40:46,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-14 11:40:46,860 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:46,861 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:40:46,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 11:40:46,861 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:46,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:46,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1336656122, now seen corresponding path program 1 times [2021-12-14 11:40:46,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:46,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979134089] [2021-12-14 11:40:46,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:46,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:46,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 11:40:46,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:46,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979134089] [2021-12-14 11:40:46,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979134089] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:46,947 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:40:46,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 11:40:46,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128782289] [2021-12-14 11:40:46,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:46,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:40:46,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:46,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:40:46,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 11:40:46,949 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:47,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:47,087 INFO L93 Difference]: Finished difference Result 143 states and 218 transitions. [2021-12-14 11:40:47,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 11:40:47,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-14 11:40:47,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:47,092 INFO L225 Difference]: With dead ends: 143 [2021-12-14 11:40:47,092 INFO L226 Difference]: Without dead ends: 105 [2021-12-14 11:40:47,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:40:47,098 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 85 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:47,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 156 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:40:47,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-14 11:40:47,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2021-12-14 11:40:47,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 66 states have internal predecessors, (98), 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-12-14 11:40:47,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 98 transitions. [2021-12-14 11:40:47,113 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 98 transitions. Word has length 18 [2021-12-14 11:40:47,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:47,114 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 98 transitions. [2021-12-14 11:40:47,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:47,114 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 98 transitions. [2021-12-14 11:40:47,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 11:40:47,115 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:47,115 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:40:47,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 11:40:47,116 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:47,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:47,117 INFO L85 PathProgramCache]: Analyzing trace with hash -640429161, now seen corresponding path program 1 times [2021-12-14 11:40:47,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:47,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881910845] [2021-12-14 11:40:47,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:47,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:47,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 11:40:47,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:47,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881910845] [2021-12-14 11:40:47,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881910845] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:47,204 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:40:47,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 11:40:47,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891024708] [2021-12-14 11:40:47,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:47,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:40:47,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:47,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:40:47,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 11:40:47,205 INFO L87 Difference]: Start difference. First operand 67 states and 98 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-12-14 11:40:47,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:47,332 INFO L93 Difference]: Finished difference Result 169 states and 250 transitions. [2021-12-14 11:40:47,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 11:40:47,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2021-12-14 11:40:47,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:47,335 INFO L225 Difference]: With dead ends: 169 [2021-12-14 11:40:47,335 INFO L226 Difference]: Without dead ends: 125 [2021-12-14 11:40:47,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:40:47,341 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 89 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:47,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 164 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:40:47,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-14 11:40:47,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 77. [2021-12-14 11:40:47,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 76 states have internal predecessors, (111), 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-12-14 11:40:47,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2021-12-14 11:40:47,349 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 19 [2021-12-14 11:40:47,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:47,349 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2021-12-14 11:40:47,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-12-14 11:40:47,349 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2021-12-14 11:40:47,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-14 11:40:47,350 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:47,350 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:40:47,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 11:40:47,351 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:47,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:47,353 INFO L85 PathProgramCache]: Analyzing trace with hash -170409323, now seen corresponding path program 1 times [2021-12-14 11:40:47,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:47,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038575463] [2021-12-14 11:40:47,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:47,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:47,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 11:40:47,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:47,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038575463] [2021-12-14 11:40:47,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038575463] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:47,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:40:47,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:40:47,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427712089] [2021-12-14 11:40:47,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:47,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:40:47,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:47,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:40:47,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:40:47,424 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-12-14 11:40:47,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:47,427 INFO L93 Difference]: Finished difference Result 124 states and 180 transitions. [2021-12-14 11:40:47,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:40:47,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2021-12-14 11:40:47,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:47,428 INFO L225 Difference]: With dead ends: 124 [2021-12-14 11:40:47,428 INFO L226 Difference]: Without dead ends: 60 [2021-12-14 11:40:47,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:40:47,429 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 57 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:47,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 58 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:40:47,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-14 11:40:47,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-12-14 11:40:47,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 59 states have internal predecessors, (85), 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-12-14 11:40:47,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 85 transitions. [2021-12-14 11:40:47,433 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 85 transitions. Word has length 20 [2021-12-14 11:40:47,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:47,433 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 85 transitions. [2021-12-14 11:40:47,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-12-14 11:40:47,434 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 85 transitions. [2021-12-14 11:40:47,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 11:40:47,434 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:47,434 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:40:47,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 11:40:47,435 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:47,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:47,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1388506533, now seen corresponding path program 1 times [2021-12-14 11:40:47,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:47,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499810344] [2021-12-14 11:40:47,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:47,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:47,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:40:47,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:47,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499810344] [2021-12-14 11:40:47,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499810344] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:47,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:40:47,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:40:47,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182046702] [2021-12-14 11:40:47,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:47,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:40:47,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:47,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:40:47,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:40:47,487 INFO L87 Difference]: Start difference. First operand 60 states and 85 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-12-14 11:40:47,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:47,499 INFO L93 Difference]: Finished difference Result 81 states and 115 transitions. [2021-12-14 11:40:47,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:40:47,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2021-12-14 11:40:47,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:47,500 INFO L225 Difference]: With dead ends: 81 [2021-12-14 11:40:47,500 INFO L226 Difference]: Without dead ends: 70 [2021-12-14 11:40:47,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:40:47,501 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:47,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 113 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:40:47,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-12-14 11:40:47,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-12-14 11:40:47,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.434782608695652) internal successors, (99), 69 states have internal predecessors, (99), 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-12-14 11:40:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 99 transitions. [2021-12-14 11:40:47,510 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 99 transitions. Word has length 26 [2021-12-14 11:40:47,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:47,510 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 99 transitions. [2021-12-14 11:40:47,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-12-14 11:40:47,511 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 99 transitions. [2021-12-14 11:40:47,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 11:40:47,513 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:47,513 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:40:47,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 11:40:47,513 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:47,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:47,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1130341095, now seen corresponding path program 1 times [2021-12-14 11:40:47,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:47,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738188977] [2021-12-14 11:40:47,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:47,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:47,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:40:47,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:47,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738188977] [2021-12-14 11:40:47,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738188977] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:40:47,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115658450] [2021-12-14 11:40:47,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:47,560 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:40:47,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:40:47,562 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:40:47,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 11:40:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:47,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 11:40:47,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:40:47,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:40:47,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:40:47,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115658450] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:47,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 11:40:47,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-12-14 11:40:47,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902945317] [2021-12-14 11:40:47,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:47,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:40:47,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:47,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:40:47,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:40:47,813 INFO L87 Difference]: Start difference. First operand 70 states and 99 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-12-14 11:40:47,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:47,934 INFO L93 Difference]: Finished difference Result 156 states and 254 transitions. [2021-12-14 11:40:47,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 11:40:47,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2021-12-14 11:40:47,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:47,935 INFO L225 Difference]: With dead ends: 156 [2021-12-14 11:40:47,935 INFO L226 Difference]: Without dead ends: 122 [2021-12-14 11:40:47,935 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:40:47,936 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 35 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:47,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 59 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:40:47,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-12-14 11:40:47,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 102. [2021-12-14 11:40:47,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.3366336633663367) internal successors, (135), 101 states have internal predecessors, (135), 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-12-14 11:40:47,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 135 transitions. [2021-12-14 11:40:47,941 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 135 transitions. Word has length 26 [2021-12-14 11:40:47,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:47,941 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 135 transitions. [2021-12-14 11:40:47,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-12-14 11:40:47,941 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 135 transitions. [2021-12-14 11:40:47,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 11:40:47,942 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:47,942 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:40:47,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-14 11:40:48,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:40:48,162 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:48,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:48,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1226843574, now seen corresponding path program 1 times [2021-12-14 11:40:48,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:48,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91269548] [2021-12-14 11:40:48,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:48,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:48,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:40:48,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:48,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91269548] [2021-12-14 11:40:48,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91269548] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:40:48,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802206482] [2021-12-14 11:40:48,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:48,311 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:40:48,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:40:48,315 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:40:48,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 11:40:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:48,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 11:40:48,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:40:48,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 11:40:48,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:40:48,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802206482] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:48,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 11:40:48,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2021-12-14 11:40:48,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273344948] [2021-12-14 11:40:48,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:48,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:40:48,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:48,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:40:48,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:40:48,439 INFO L87 Difference]: Start difference. First operand 102 states and 135 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-12-14 11:40:48,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:48,545 INFO L93 Difference]: Finished difference Result 243 states and 351 transitions. [2021-12-14 11:40:48,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 11:40:48,546 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 32 [2021-12-14 11:40:48,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:48,546 INFO L225 Difference]: With dead ends: 243 [2021-12-14 11:40:48,546 INFO L226 Difference]: Without dead ends: 160 [2021-12-14 11:40:48,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:40:48,547 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 37 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:48,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 89 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:40:48,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-14 11:40:48,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 131. [2021-12-14 11:40:48,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.2923076923076924) internal successors, (168), 130 states have internal predecessors, (168), 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-12-14 11:40:48,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 168 transitions. [2021-12-14 11:40:48,552 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 168 transitions. Word has length 32 [2021-12-14 11:40:48,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:48,552 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 168 transitions. [2021-12-14 11:40:48,552 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-12-14 11:40:48,552 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 168 transitions. [2021-12-14 11:40:48,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-14 11:40:48,553 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:48,553 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:40:48,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 11:40:48,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-12-14 11:40:48,754 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:48,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:48,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1448774913, now seen corresponding path program 1 times [2021-12-14 11:40:48,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:48,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820358137] [2021-12-14 11:40:48,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:48,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:48,842 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 11:40:48,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:48,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820358137] [2021-12-14 11:40:48,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820358137] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:40:48,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430378167] [2021-12-14 11:40:48,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:48,843 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:40:48,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:40:48,844 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:40:48,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 11:40:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:48,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 11:40:48,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:40:48,983 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 11:40:48,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:40:48,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430378167] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:48,983 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 11:40:48,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2021-12-14 11:40:48,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389446073] [2021-12-14 11:40:48,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:48,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:40:48,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:48,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:40:48,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:40:48,985 INFO L87 Difference]: Start difference. First operand 131 states and 168 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-12-14 11:40:49,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:49,119 INFO L93 Difference]: Finished difference Result 302 states and 416 transitions. [2021-12-14 11:40:49,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 11:40:49,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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 38 [2021-12-14 11:40:49,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:49,120 INFO L225 Difference]: With dead ends: 302 [2021-12-14 11:40:49,120 INFO L226 Difference]: Without dead ends: 190 [2021-12-14 11:40:49,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:40:49,121 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 36 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:49,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 93 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:40:49,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-12-14 11:40:49,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 160. [2021-12-14 11:40:49,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.2641509433962264) internal successors, (201), 159 states have internal predecessors, (201), 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-12-14 11:40:49,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 201 transitions. [2021-12-14 11:40:49,126 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 201 transitions. Word has length 38 [2021-12-14 11:40:49,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:49,126 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 201 transitions. [2021-12-14 11:40:49,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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-12-14 11:40:49,126 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 201 transitions. [2021-12-14 11:40:49,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-14 11:40:49,127 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:49,127 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1] [2021-12-14 11:40:49,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 11:40:49,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:40:49,343 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:49,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:49,344 INFO L85 PathProgramCache]: Analyzing trace with hash 882299696, now seen corresponding path program 1 times [2021-12-14 11:40:49,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:49,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662352815] [2021-12-14 11:40:49,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:49,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:49,423 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-14 11:40:49,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:49,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662352815] [2021-12-14 11:40:49,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662352815] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:40:49,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53437721] [2021-12-14 11:40:49,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:49,424 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:40:49,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:40:49,427 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:40:49,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 11:40:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:49,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 11:40:49,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:40:49,619 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-14 11:40:49,620 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:40:49,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53437721] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:49,620 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 11:40:49,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2021-12-14 11:40:49,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693623213] [2021-12-14 11:40:49,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:49,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 11:40:49,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:49,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 11:40:49,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:40:49,622 INFO L87 Difference]: Start difference. First operand 160 states and 201 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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-12-14 11:40:49,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:49,704 INFO L93 Difference]: Finished difference Result 327 states and 422 transitions. [2021-12-14 11:40:49,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 11:40:49,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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 44 [2021-12-14 11:40:49,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:49,706 INFO L225 Difference]: With dead ends: 327 [2021-12-14 11:40:49,706 INFO L226 Difference]: Without dead ends: 150 [2021-12-14 11:40:49,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:40:49,707 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 66 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:49,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 46 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:40:49,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-14 11:40:49,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 130. [2021-12-14 11:40:49,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.255813953488372) internal successors, (162), 129 states have internal predecessors, (162), 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-12-14 11:40:49,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 162 transitions. [2021-12-14 11:40:49,722 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 162 transitions. Word has length 44 [2021-12-14 11:40:49,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:49,724 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 162 transitions. [2021-12-14 11:40:49,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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-12-14 11:40:49,724 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 162 transitions. [2021-12-14 11:40:49,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-14 11:40:49,731 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:49,731 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2021-12-14 11:40:49,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 11:40:49,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:40:49,932 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:49,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:49,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1716436880, now seen corresponding path program 1 times [2021-12-14 11:40:49,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:49,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587129219] [2021-12-14 11:40:49,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:49,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:50,005 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-14 11:40:50,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:50,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587129219] [2021-12-14 11:40:50,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587129219] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:50,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:40:50,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 11:40:50,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618983286] [2021-12-14 11:40:50,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:50,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 11:40:50,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:50,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 11:40:50,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:40:50,008 INFO L87 Difference]: Start difference. First operand 130 states and 162 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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-12-14 11:40:50,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:50,163 INFO L93 Difference]: Finished difference Result 491 states and 613 transitions. [2021-12-14 11:40:50,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 11:40:50,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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 65 [2021-12-14 11:40:50,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:50,164 INFO L225 Difference]: With dead ends: 491 [2021-12-14 11:40:50,164 INFO L226 Difference]: Without dead ends: 380 [2021-12-14 11:40:50,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:40:50,171 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 135 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:50,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 200 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:40:50,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2021-12-14 11:40:50,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 130. [2021-12-14 11:40:50,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.255813953488372) internal successors, (162), 129 states have internal predecessors, (162), 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-12-14 11:40:50,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 162 transitions. [2021-12-14 11:40:50,177 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 162 transitions. Word has length 65 [2021-12-14 11:40:50,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:50,177 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 162 transitions. [2021-12-14 11:40:50,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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-12-14 11:40:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 162 transitions. [2021-12-14 11:40:50,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-14 11:40:50,180 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:50,180 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 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-12-14 11:40:50,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 11:40:50,180 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:50,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:50,180 INFO L85 PathProgramCache]: Analyzing trace with hash -865911640, now seen corresponding path program 1 times [2021-12-14 11:40:50,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:50,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087096496] [2021-12-14 11:40:50,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:50,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:50,262 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-12-14 11:40:50,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:50,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087096496] [2021-12-14 11:40:50,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087096496] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:50,263 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:40:50,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 11:40:50,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86352920] [2021-12-14 11:40:50,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:50,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 11:40:50,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:50,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 11:40:50,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:40:50,265 INFO L87 Difference]: Start difference. First operand 130 states and 162 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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-12-14 11:40:50,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:50,324 INFO L93 Difference]: Finished difference Result 386 states and 482 transitions. [2021-12-14 11:40:50,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 11:40:50,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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 66 [2021-12-14 11:40:50,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:50,325 INFO L225 Difference]: With dead ends: 386 [2021-12-14 11:40:50,325 INFO L226 Difference]: Without dead ends: 275 [2021-12-14 11:40:50,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:40:50,326 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 110 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:50,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 145 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:40:50,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-12-14 11:40:50,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 202. [2021-12-14 11:40:50,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 1.263681592039801) internal successors, (254), 201 states have internal predecessors, (254), 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-12-14 11:40:50,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 254 transitions. [2021-12-14 11:40:50,332 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 254 transitions. Word has length 66 [2021-12-14 11:40:50,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:50,332 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 254 transitions. [2021-12-14 11:40:50,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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-12-14 11:40:50,333 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 254 transitions. [2021-12-14 11:40:50,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-14 11:40:50,334 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:50,334 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2021-12-14 11:40:50,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 11:40:50,334 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:50,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:50,334 INFO L85 PathProgramCache]: Analyzing trace with hash 511658858, now seen corresponding path program 1 times [2021-12-14 11:40:50,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:50,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439605855] [2021-12-14 11:40:50,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:50,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:50,422 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-14 11:40:50,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:50,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439605855] [2021-12-14 11:40:50,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439605855] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:50,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:40:50,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 11:40:50,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809062316] [2021-12-14 11:40:50,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:50,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 11:40:50,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:50,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 11:40:50,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:40:50,425 INFO L87 Difference]: Start difference. First operand 202 states and 254 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 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-12-14 11:40:50,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:50,666 INFO L93 Difference]: Finished difference Result 995 states and 1247 transitions. [2021-12-14 11:40:50,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 11:40:50,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 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 66 [2021-12-14 11:40:50,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:50,668 INFO L225 Difference]: With dead ends: 995 [2021-12-14 11:40:50,668 INFO L226 Difference]: Without dead ends: 812 [2021-12-14 11:40:50,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-14 11:40:50,669 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 203 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:50,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 335 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:40:50,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2021-12-14 11:40:50,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 202. [2021-12-14 11:40:50,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 1.263681592039801) internal successors, (254), 201 states have internal predecessors, (254), 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-12-14 11:40:50,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 254 transitions. [2021-12-14 11:40:50,684 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 254 transitions. Word has length 66 [2021-12-14 11:40:50,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:50,685 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 254 transitions. [2021-12-14 11:40:50,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 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-12-14 11:40:50,685 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 254 transitions. [2021-12-14 11:40:50,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-14 11:40:50,686 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:50,686 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2021-12-14 11:40:50,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 11:40:50,686 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:50,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:50,687 INFO L85 PathProgramCache]: Analyzing trace with hash 309834924, now seen corresponding path program 1 times [2021-12-14 11:40:50,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:50,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763383964] [2021-12-14 11:40:50,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:50,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:50,766 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-14 11:40:50,767 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:50,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763383964] [2021-12-14 11:40:50,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763383964] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:50,767 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:40:50,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 11:40:50,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114120620] [2021-12-14 11:40:50,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:50,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 11:40:50,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:50,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 11:40:50,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:40:50,768 INFO L87 Difference]: Start difference. First operand 202 states and 254 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-12-14 11:40:51,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:51,078 INFO L93 Difference]: Finished difference Result 1014 states and 1267 transitions. [2021-12-14 11:40:51,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 11:40:51,079 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 66 [2021-12-14 11:40:51,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:51,081 INFO L225 Difference]: With dead ends: 1014 [2021-12-14 11:40:51,081 INFO L226 Difference]: Without dead ends: 831 [2021-12-14 11:40:51,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-14 11:40:51,082 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 271 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:51,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 389 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 11:40:51,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2021-12-14 11:40:51,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 198. [2021-12-14 11:40:51,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 1.2690355329949239) internal successors, (250), 197 states have internal predecessors, (250), 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-12-14 11:40:51,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 250 transitions. [2021-12-14 11:40:51,089 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 250 transitions. Word has length 66 [2021-12-14 11:40:51,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:51,090 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 250 transitions. [2021-12-14 11:40:51,090 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-12-14 11:40:51,090 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 250 transitions. [2021-12-14 11:40:51,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-14 11:40:51,090 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:51,091 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2021-12-14 11:40:51,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 11:40:51,091 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:51,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:51,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1499003605, now seen corresponding path program 1 times [2021-12-14 11:40:51,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:51,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959865252] [2021-12-14 11:40:51,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:51,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-14 11:40:51,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:51,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959865252] [2021-12-14 11:40:51,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959865252] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:40:51,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884057450] [2021-12-14 11:40:51,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:51,168 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:40:51,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:40:51,169 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:40:51,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 11:40:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:51,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 11:40:51,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:40:51,382 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-14 11:40:51,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:40:51,537 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 52 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-14 11:40:51,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884057450] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:40:51,537 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:40:51,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2021-12-14 11:40:51,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973091991] [2021-12-14 11:40:51,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:40:51,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 11:40:51,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:51,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 11:40:51,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2021-12-14 11:40:51,539 INFO L87 Difference]: Start difference. First operand 198 states and 250 transitions. Second operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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-12-14 11:40:51,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:51,769 INFO L93 Difference]: Finished difference Result 936 states and 1184 transitions. [2021-12-14 11:40:51,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 11:40:51,769 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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 68 [2021-12-14 11:40:51,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:51,771 INFO L225 Difference]: With dead ends: 936 [2021-12-14 11:40:51,771 INFO L226 Difference]: Without dead ends: 753 [2021-12-14 11:40:51,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2021-12-14 11:40:51,772 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 389 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:51,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 149 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:40:51,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2021-12-14 11:40:51,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 600. [2021-12-14 11:40:51,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.2771285475792988) internal successors, (765), 599 states have internal predecessors, (765), 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-12-14 11:40:51,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 765 transitions. [2021-12-14 11:40:51,787 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 765 transitions. Word has length 68 [2021-12-14 11:40:51,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:51,787 INFO L470 AbstractCegarLoop]: Abstraction has 600 states and 765 transitions. [2021-12-14 11:40:51,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 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-12-14 11:40:51,788 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 765 transitions. [2021-12-14 11:40:51,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-14 11:40:51,788 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:51,788 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2021-12-14 11:40:51,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 11:40:52,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-14 11:40:52,004 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:52,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:52,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1439601588, now seen corresponding path program 1 times [2021-12-14 11:40:52,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:52,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160605591] [2021-12-14 11:40:52,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:52,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:52,088 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-14 11:40:52,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:52,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160605591] [2021-12-14 11:40:52,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160605591] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:40:52,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148517010] [2021-12-14 11:40:52,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:52,089 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:40:52,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:40:52,090 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:40:52,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 11:40:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:52,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 11:40:52,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:40:53,058 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-14 11:40:53,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:40:53,235 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 52 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-14 11:40:53,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148517010] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:40:53,235 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:40:53,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 16 [2021-12-14 11:40:53,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727535049] [2021-12-14 11:40:53,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:40:53,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-14 11:40:53,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:53,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-14 11:40:53,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-12-14 11:40:53,237 INFO L87 Difference]: Start difference. First operand 600 states and 765 transitions. Second operand has 16 states, 16 states have (on average 6.5625) internal successors, (105), 16 states have internal predecessors, (105), 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-12-14 11:40:53,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:53,917 INFO L93 Difference]: Finished difference Result 1746 states and 2221 transitions. [2021-12-14 11:40:53,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-14 11:40:53,917 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.5625) internal successors, (105), 16 states have internal predecessors, (105), 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 70 [2021-12-14 11:40:53,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:53,920 INFO L225 Difference]: With dead ends: 1746 [2021-12-14 11:40:53,920 INFO L226 Difference]: Without dead ends: 1302 [2021-12-14 11:40:53,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 131 SyntacticMatches, 9 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=459, Unknown=0, NotChecked=0, Total=650 [2021-12-14 11:40:53,921 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 530 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:53,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [530 Valid, 437 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 604 Invalid, 0 Unknown, 173 Unchecked, 0.4s Time] [2021-12-14 11:40:53,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2021-12-14 11:40:53,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 912. [2021-12-14 11:40:53,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 911 states have (on average 1.300768386388584) internal successors, (1185), 911 states have internal predecessors, (1185), 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-12-14 11:40:53,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1185 transitions. [2021-12-14 11:40:53,945 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1185 transitions. Word has length 70 [2021-12-14 11:40:53,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:53,945 INFO L470 AbstractCegarLoop]: Abstraction has 912 states and 1185 transitions. [2021-12-14 11:40:53,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.5625) internal successors, (105), 16 states have internal predecessors, (105), 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-12-14 11:40:53,946 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1185 transitions. [2021-12-14 11:40:53,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-14 11:40:53,950 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:53,950 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2021-12-14 11:40:53,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 11:40:54,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-14 11:40:54,155 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:54,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:54,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1493994486, now seen corresponding path program 1 times [2021-12-14 11:40:54,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:54,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800509120] [2021-12-14 11:40:54,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:54,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:54,278 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 53 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-14 11:40:54,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:40:54,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800509120] [2021-12-14 11:40:54,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800509120] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:40:54,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533233939] [2021-12-14 11:40:54,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:54,279 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:40:54,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:40:54,283 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:40:54,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 11:40:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:54,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-14 11:40:54,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:40:54,561 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-14 11:40:54,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:40:54,699 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 21 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-14 11:40:54,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533233939] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:40:54,699 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:40:54,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2021-12-14 11:40:54,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548926033] [2021-12-14 11:40:54,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:40:54,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 11:40:54,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:40:54,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 11:40:54,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-12-14 11:40:54,700 INFO L87 Difference]: Start difference. First operand 912 states and 1185 transitions. Second operand has 14 states, 14 states have (on average 9.785714285714286) internal successors, (137), 14 states have internal predecessors, (137), 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-12-14 11:40:55,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:55,031 INFO L93 Difference]: Finished difference Result 1970 states and 2529 transitions. [2021-12-14 11:40:55,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 11:40:55,032 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.785714285714286) internal successors, (137), 14 states have internal predecessors, (137), 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 70 [2021-12-14 11:40:55,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:55,035 INFO L225 Difference]: With dead ends: 1970 [2021-12-14 11:40:55,036 INFO L226 Difference]: Without dead ends: 1085 [2021-12-14 11:40:55,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2021-12-14 11:40:55,037 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 243 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:55,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 552 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:40:55,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2021-12-14 11:40:55,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 688. [2021-12-14 11:40:55,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 687 states have (on average 1.2925764192139737) internal successors, (888), 687 states have internal predecessors, (888), 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-12-14 11:40:55,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 888 transitions. [2021-12-14 11:40:55,072 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 888 transitions. Word has length 70 [2021-12-14 11:40:55,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:55,073 INFO L470 AbstractCegarLoop]: Abstraction has 688 states and 888 transitions. [2021-12-14 11:40:55,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.785714285714286) internal successors, (137), 14 states have internal predecessors, (137), 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-12-14 11:40:55,073 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 888 transitions. [2021-12-14 11:40:55,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-14 11:40:55,074 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:55,074 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2021-12-14 11:40:55,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-14 11:40:55,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:40:55,283 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:55,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:55,284 INFO L85 PathProgramCache]: Analyzing trace with hash 605183798, now seen corresponding path program 2 times [2021-12-14 11:40:55,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:40:55,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546670562] [2021-12-14 11:40:55,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:55,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:40:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 11:40:55,325 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 11:40:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 11:40:55,377 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 11:40:55,377 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 11:40:55,378 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 11:40:55,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-14 11:40:55,382 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:40:55,384 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 11:40:55,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 11:40:55 BoogieIcfgContainer [2021-12-14 11:40:55,458 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 11:40:55,458 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 11:40:55,458 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 11:40:55,459 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 11:40:55,459 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:40:46" (3/4) ... [2021-12-14 11:40:55,461 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-14 11:40:55,461 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 11:40:55,462 INFO L158 Benchmark]: Toolchain (without parser) took 9659.27ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 75.9MB in the beginning and 102.1MB in the end (delta: -26.2MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2021-12-14 11:40:55,462 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 73.4MB. Free memory is still 31.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 11:40:55,462 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.01ms. Allocated memory is still 109.1MB. Free memory was 75.7MB in the beginning and 83.5MB in the end (delta: -7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 11:40:55,463 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.23ms. Allocated memory is still 109.1MB. Free memory was 83.5MB in the beginning and 81.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 11:40:55,463 INFO L158 Benchmark]: Boogie Preprocessor took 14.37ms. Allocated memory is still 109.1MB. Free memory was 81.4MB in the beginning and 80.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 11:40:55,463 INFO L158 Benchmark]: RCFGBuilder took 314.00ms. Allocated memory is still 109.1MB. Free memory was 79.8MB in the beginning and 67.8MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 11:40:55,463 INFO L158 Benchmark]: TraceAbstraction took 9084.56ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 67.3MB in the beginning and 102.1MB in the end (delta: -34.9MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2021-12-14 11:40:55,463 INFO L158 Benchmark]: Witness Printer took 2.62ms. Allocated memory is still 159.4MB. Free memory is still 102.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 11:40:55,469 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.17ms. Allocated memory is still 73.4MB. Free memory is still 31.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.01ms. Allocated memory is still 109.1MB. Free memory was 75.7MB in the beginning and 83.5MB in the end (delta: -7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.23ms. Allocated memory is still 109.1MB. Free memory was 83.5MB in the beginning and 81.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.37ms. Allocated memory is still 109.1MB. Free memory was 81.4MB in the beginning and 80.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 314.00ms. Allocated memory is still 109.1MB. Free memory was 79.8MB in the beginning and 67.8MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9084.56ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 67.3MB in the beginning and 102.1MB in the end (delta: -34.9MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * Witness Printer took 2.62ms. Allocated memory is still 159.4MB. Free memory is still 102.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 25]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 116, overapproximation of bitwiseAnd at line 96. Possible FailurePath: [L124] unsigned int a, b, r; [L126] b = __VERIFIER_nondet_uint() [L128] a = 234770789 [L130] CALL, EXPR mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, na=4] [L68] nb = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, na=4, nb=4] [L69] COND TRUE b3 == (unsigned char)0 [L70] nb = nb - 1 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, na=4, nb=3] [L71] COND TRUE b2 == (unsigned char)0 [L72] nb = nb - 1 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, na=4, nb=2] [L73] COND TRUE b1 == (unsigned char)0 [L74] nb = nb - 1 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, na=4, nb=1] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=0, na=4, nb=1] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=0, na=4, nb=1, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=0, na=4, nb=1, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=0, na=4, nb=1, partial_sum=101] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=0, na=4, nb=1, partial_sum=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=0, na=4, nb=1, partial_sum=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=0, na=4, nb=1, partial_sum=101] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=0, na=4, nb=1, partial_sum=101] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=0, na=4, nb=1, partial_sum=356] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=0, na=4, nb=1, partial_sum=356] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=0, na=4, nb=1, partial_sum=356] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=0, na=4, nb=1, partial_sum=356] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=1, i=0, na=4, nb=1] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=1, i=0, na=4, nb=1, partial_sum=20838, r0=234770790] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=1, i=0, na=4, nb=1, partial_sum=20838, r0=234770790] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=1, i=0, na=4, nb=1, partial_sum=20838, r0=234770790] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=1, i=0, na=4, nb=1, partial_sum=20838, r0=234770790] [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=1, i=1, na=4, nb=1, partial_sum=20838, r0=234770790] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=234770790] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=234770790] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=234770790] [L85] COND TRUE i == (unsigned char)1 [L85] partial_sum = partial_sum + a1 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=234770790] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=234770790] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=234770790] [L89] COND FALSE !(i < nb) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=234770790] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=234770790] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=234770790] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=234770790, r1=82] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=234770790, r1=82] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=234770790, r1=82] [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=2, na=4, nb=1, partial_sum=82, r0=234770790, r1=82] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=234770790, r1=82] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=234770790, r1=82] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=234770790, r1=82] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=234770790, r1=82] [L86] COND TRUE i == (unsigned char)2 [L86] partial_sum = partial_sum + a2 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=234770790, r1=82] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=234770790, r1=82] [L89] COND FALSE !(i < nb) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=234770790, r1=82] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=234770790, r1=82] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=234770790, r1=82] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=234770790, r1=82] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=234770790, r1=82, r2=254] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=234770790, r1=82, r2=254] [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=3, na=4, nb=1, partial_sum=254, r0=234770790, r1=82, r2=254] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=234770790, r1=82, r2=254] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=234770790, r1=82, r2=254] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=234770790, r1=82, r2=254] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=234770790, r1=82, r2=254] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=234770790, r1=82, r2=254] [L87] COND TRUE i == (unsigned char)3 [L87] partial_sum = partial_sum + a3 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254] [L89] COND FALSE !(i < nb) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254, r3=13] [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254, r3=13] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254, r3=13] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=234770789, \old(b)=255, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=234770790, r1=82, r2=254, r3=13] [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; VAL [\old(a)=234770789, \old(b)=255, \result=3, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=255, b0=-4294967041, b1=-16777216, b2=-65536, b3=-256, carry=0, i=4, na=4, nb=1, partial_sum=13, r=3, r0=234770790, r1=82, r2=254, r3=13] [L130] RET, EXPR mp_add(a, b) [L130] r = mp_add(a, b) [L132] CALL __VERIFIER_assert(r == a + b) [L24] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L25] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 18, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2314 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2314 mSDsluCounter, 3112 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 173 IncrementalHoareTripleChecker+Unchecked, 2043 mSDsCounter, 275 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3105 IncrementalHoareTripleChecker+Invalid, 3553 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 275 mSolverCounterUnsat, 1069 mSDtfsCounter, 3105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 695 GetRequests, 564 SyntacticMatches, 17 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=912occurred in iteration=16, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 2693 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1136 NumberOfCodeBlocks, 1136 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1247 ConstructedInterpolants, 26 QuantifiedInterpolants, 6493 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1029 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 27 InterpolantComputations, 14 PerfectInterpolantSequences, 1079/1138 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 could not prove your program: unable to determine feasibility of some traces [2021-12-14 11:40:55,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 11:40:57,167 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 11:40:57,170 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 11:40:57,209 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 11:40:57,209 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 11:40:57,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 11:40:57,214 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 11:40:57,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 11:40:57,221 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 11:40:57,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 11:40:57,226 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 11:40:57,229 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 11:40:57,230 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 11:40:57,232 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 11:40:57,233 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 11:40:57,236 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 11:40:57,237 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 11:40:57,237 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 11:40:57,238 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 11:40:57,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 11:40:57,239 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 11:40:57,240 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 11:40:57,241 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 11:40:57,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 11:40:57,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 11:40:57,246 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 11:40:57,246 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 11:40:57,247 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 11:40:57,247 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 11:40:57,248 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 11:40:57,248 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 11:40:57,249 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 11:40:57,250 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 11:40:57,250 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 11:40:57,251 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 11:40:57,251 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 11:40:57,252 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 11:40:57,252 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 11:40:57,252 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 11:40:57,253 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 11:40:57,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 11:40:57,256 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-14 11:40:57,279 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 11:40:57,280 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 11:40:57,280 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 11:40:57,280 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 11:40:57,281 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 11:40:57,281 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 11:40:57,282 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 11:40:57,282 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 11:40:57,282 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 11:40:57,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 11:40:57,283 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 11:40:57,283 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 11:40:57,283 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 11:40:57,283 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 11:40:57,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 11:40:57,284 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 11:40:57,284 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 11:40:57,284 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-14 11:40:57,284 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-14 11:40:57,284 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 11:40:57,284 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 11:40:57,284 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 11:40:57,284 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 11:40:57,292 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 11:40:57,292 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 11:40:57,293 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 11:40:57,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:40:57,293 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 11:40:57,293 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 11:40:57,293 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 11:40:57,293 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-14 11:40:57,293 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-14 11:40:57,294 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 11:40:57,294 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 11:40:57,294 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 11:40:57,294 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 11:40:57,294 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-14 11:40:57,295 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 [2021-12-14 11:40:57,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 11:40:57,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 11:40:57,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 11:40:57,569 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 11:40:57,570 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 11:40:57,571 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-1.i [2021-12-14 11:40:57,624 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f158e3a16/a655d5fe6400440f99fb60a255d0de10/FLAG947e80a5a [2021-12-14 11:40:57,934 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 11:40:57,937 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i [2021-12-14 11:40:57,944 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f158e3a16/a655d5fe6400440f99fb60a255d0de10/FLAG947e80a5a [2021-12-14 11:40:58,367 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f158e3a16/a655d5fe6400440f99fb60a255d0de10 [2021-12-14 11:40:58,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 11:40:58,371 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 11:40:58,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 11:40:58,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 11:40:58,377 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 11:40:58,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:40:58" (1/1) ... [2021-12-14 11:40:58,379 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f9b363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:58, skipping insertion in model container [2021-12-14 11:40:58,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:40:58" (1/1) ... [2021-12-14 11:40:58,385 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 11:40:58,410 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 11:40:58,519 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i[1168,1181] [2021-12-14 11:40:58,554 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:40:58,569 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 11:40:58,586 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i[1168,1181] [2021-12-14 11:40:58,635 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:40:58,646 INFO L208 MainTranslator]: Completed translation [2021-12-14 11:40:58,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:58 WrapperNode [2021-12-14 11:40:58,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 11:40:58,648 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 11:40:58,648 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 11:40:58,648 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 11:40:58,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:58" (1/1) ... [2021-12-14 11:40:58,668 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:58" (1/1) ... [2021-12-14 11:40:58,695 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2021-12-14 11:40:58,698 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 11:40:58,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 11:40:58,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 11:40:58,699 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 11:40:58,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:58" (1/1) ... [2021-12-14 11:40:58,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:58" (1/1) ... [2021-12-14 11:40:58,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:58" (1/1) ... [2021-12-14 11:40:58,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:58" (1/1) ... [2021-12-14 11:40:58,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:58" (1/1) ... [2021-12-14 11:40:58,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:58" (1/1) ... [2021-12-14 11:40:58,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:58" (1/1) ... [2021-12-14 11:40:58,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 11:40:58,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 11:40:58,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 11:40:58,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 11:40:58,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:58" (1/1) ... [2021-12-14 11:40:58,752 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:40:58,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:40:58,801 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 11:40:58,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 11:40:58,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 11:40:58,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-14 11:40:58,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 11:40:58,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 11:40:58,923 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 11:40:58,924 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 11:40:59,074 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 11:40:59,078 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 11:40:59,078 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-14 11:40:59,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:40:59 BoogieIcfgContainer [2021-12-14 11:40:59,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 11:40:59,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 11:40:59,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 11:40:59,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 11:40:59,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:40:58" (1/3) ... [2021-12-14 11:40:59,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@391192ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:40:59, skipping insertion in model container [2021-12-14 11:40:59,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:40:58" (2/3) ... [2021-12-14 11:40:59,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@391192ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:40:59, skipping insertion in model container [2021-12-14 11:40:59,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:40:59" (3/3) ... [2021-12-14 11:40:59,084 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add_1-1.i [2021-12-14 11:40:59,087 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 11:40:59,087 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 11:40:59,114 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 11:40:59,118 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, mAutomataTypeConcurrency=PETRI_NET, 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-12-14 11:40:59,118 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 11:40:59,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 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-12-14 11:40:59,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 11:40:59,130 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:59,130 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:40:59,131 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:59,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:59,134 INFO L85 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2021-12-14 11:40:59,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:40:59,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647734379] [2021-12-14 11:40:59,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:59,141 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:40:59,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:40:59,145 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:40:59,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-14 11:40:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:59,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-14 11:40:59,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:40:59,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:40:59,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:40:59,254 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:40:59,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647734379] [2021-12-14 11:40:59,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647734379] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:59,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:40:59,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 11:40:59,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354264826] [2021-12-14 11:40:59,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:59,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 11:40:59,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:40:59,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 11:40:59,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 11:40:59,285 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:59,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:59,304 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2021-12-14 11:40:59,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 11:40:59,306 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-14 11:40:59,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:59,315 INFO L225 Difference]: With dead ends: 57 [2021-12-14 11:40:59,315 INFO L226 Difference]: Without dead ends: 38 [2021-12-14 11:40:59,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 11:40:59,323 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:59,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:40:59,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-14 11:40:59,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-12-14 11:40:59,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 37 states have internal predecessors, (64), 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-12-14 11:40:59,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2021-12-14 11:40:59,357 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2021-12-14 11:40:59,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:59,357 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2021-12-14 11:40:59,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:59,359 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2021-12-14 11:40:59,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 11:40:59,360 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:59,360 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:40:59,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-14 11:40:59,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:40:59,568 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:40:59,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:40:59,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2021-12-14 11:40:59,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:40:59,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423299144] [2021-12-14 11:40:59,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:40:59,570 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:40:59,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:40:59,572 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:40:59,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-14 11:40:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:40:59,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 11:40:59,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:40:59,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:40:59,677 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:40:59,677 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:40:59,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423299144] [2021-12-14 11:40:59,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423299144] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:40:59,678 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:40:59,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 11:40:59,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833879073] [2021-12-14 11:40:59,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:40:59,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:40:59,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:40:59,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:40:59,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 11:40:59,682 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:59,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:40:59,839 INFO L93 Difference]: Finished difference Result 116 states and 201 transitions. [2021-12-14 11:40:59,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 11:40:59,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-14 11:40:59,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:40:59,840 INFO L225 Difference]: With dead ends: 116 [2021-12-14 11:40:59,840 INFO L226 Difference]: Without dead ends: 88 [2021-12-14 11:40:59,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 11:40:59,841 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 66 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:40:59,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 152 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:40:59,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-14 11:40:59,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2021-12-14 11:40:59,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.625) internal successors, (130), 80 states have internal predecessors, (130), 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-12-14 11:40:59,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 130 transitions. [2021-12-14 11:40:59,848 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 130 transitions. Word has length 12 [2021-12-14 11:40:59,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:40:59,848 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 130 transitions. [2021-12-14 11:40:59,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:40:59,849 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 130 transitions. [2021-12-14 11:40:59,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-14 11:40:59,849 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:40:59,849 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:40:59,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-14 11:41:00,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:41:00,057 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:00,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:00,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1087802014, now seen corresponding path program 1 times [2021-12-14 11:41:00,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:41:00,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083180758] [2021-12-14 11:41:00,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:00,059 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:41:00,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:41:00,060 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:41:00,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-14 11:41:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:41:00,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 11:41:00,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:41:00,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:00,130 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:41:00,131 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:41:00,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083180758] [2021-12-14 11:41:00,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083180758] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:41:00,132 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:41:00,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 11:41:00,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60972304] [2021-12-14 11:41:00,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:41:00,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 11:41:00,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:41:00,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 11:41:00,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:41:00,137 INFO L87 Difference]: Start difference. First operand 81 states and 130 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:00,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:41:00,240 INFO L93 Difference]: Finished difference Result 164 states and 271 transitions. [2021-12-14 11:41:00,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 11:41:00,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-14 11:41:00,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:41:00,241 INFO L225 Difference]: With dead ends: 164 [2021-12-14 11:41:00,241 INFO L226 Difference]: Without dead ends: 136 [2021-12-14 11:41:00,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:41:00,242 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 141 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:41:00,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 284 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:41:00,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-14 11:41:00,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 81. [2021-12-14 11:41:00,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.625) internal successors, (130), 80 states have internal predecessors, (130), 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-12-14 11:41:00,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 130 transitions. [2021-12-14 11:41:00,249 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 130 transitions. Word has length 13 [2021-12-14 11:41:00,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:41:00,249 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 130 transitions. [2021-12-14 11:41:00,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:00,250 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 130 transitions. [2021-12-14 11:41:00,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-14 11:41:00,250 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:00,250 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:41:00,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-14 11:41:00,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:41:00,462 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:00,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:00,462 INFO L85 PathProgramCache]: Analyzing trace with hash 583572890, now seen corresponding path program 1 times [2021-12-14 11:41:00,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:41:00,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209174490] [2021-12-14 11:41:00,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:00,463 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:41:00,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:41:00,464 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:41:00,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-14 11:41:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:41:00,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 11:41:00,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:41:00,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:00,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:41:00,542 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:41:00,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209174490] [2021-12-14 11:41:00,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209174490] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:41:00,544 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:41:00,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 11:41:00,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102780042] [2021-12-14 11:41:00,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:41:00,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 11:41:00,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:41:00,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 11:41:00,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:41:00,546 INFO L87 Difference]: Start difference. First operand 81 states and 130 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:00,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:41:00,745 INFO L93 Difference]: Finished difference Result 212 states and 341 transitions. [2021-12-14 11:41:00,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 11:41:00,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-14 11:41:00,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:41:00,746 INFO L225 Difference]: With dead ends: 212 [2021-12-14 11:41:00,746 INFO L226 Difference]: Without dead ends: 184 [2021-12-14 11:41:00,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:41:00,747 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 166 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:41:00,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 559 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:41:00,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-12-14 11:41:00,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 81. [2021-12-14 11:41:00,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.625) internal successors, (130), 80 states have internal predecessors, (130), 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-12-14 11:41:00,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 130 transitions. [2021-12-14 11:41:00,765 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 130 transitions. Word has length 14 [2021-12-14 11:41:00,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:41:00,765 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 130 transitions. [2021-12-14 11:41:00,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:00,765 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 130 transitions. [2021-12-14 11:41:00,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-14 11:41:00,766 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:00,766 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:41:00,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-14 11:41:00,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:41:00,995 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:00,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:00,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1392919516, now seen corresponding path program 1 times [2021-12-14 11:41:00,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:41:00,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465521369] [2021-12-14 11:41:00,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:00,997 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:41:00,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:41:00,997 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:41:00,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-14 11:41:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:41:01,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 11:41:01,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:41:01,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:01,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:41:01,080 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:41:01,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465521369] [2021-12-14 11:41:01,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465521369] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:41:01,081 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:41:01,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 11:41:01,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183732811] [2021-12-14 11:41:01,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:41:01,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 11:41:01,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:41:01,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 11:41:01,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:41:01,082 INFO L87 Difference]: Start difference. First operand 81 states and 130 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:01,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:41:01,195 INFO L93 Difference]: Finished difference Result 227 states and 354 transitions. [2021-12-14 11:41:01,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 11:41:01,195 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-14 11:41:01,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:41:01,196 INFO L225 Difference]: With dead ends: 227 [2021-12-14 11:41:01,196 INFO L226 Difference]: Without dead ends: 199 [2021-12-14 11:41:01,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:41:01,197 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 233 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:41:01,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 683 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:41:01,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-12-14 11:41:01,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 87. [2021-12-14 11:41:01,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.5) internal successors, (129), 86 states have internal predecessors, (129), 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-12-14 11:41:01,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2021-12-14 11:41:01,205 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 14 [2021-12-14 11:41:01,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:41:01,205 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2021-12-14 11:41:01,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:01,205 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2021-12-14 11:41:01,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 11:41:01,206 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:01,206 INFO L514 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-12-14 11:41:01,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-14 11:41:01,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:41:01,416 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:01,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:01,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1480128500, now seen corresponding path program 1 times [2021-12-14 11:41:01,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:41:01,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378875031] [2021-12-14 11:41:01,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:01,419 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:41:01,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:41:01,420 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:41:01,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-14 11:41:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:41:01,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 11:41:01,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:41:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:01,488 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:41:01,488 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:41:01,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378875031] [2021-12-14 11:41:01,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378875031] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:41:01,489 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:41:01,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 11:41:01,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744964526] [2021-12-14 11:41:01,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:41:01,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:41:01,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:41:01,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:41:01,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 11:41:01,490 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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-12-14 11:41:01,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:41:01,580 INFO L93 Difference]: Finished difference Result 243 states and 358 transitions. [2021-12-14 11:41:01,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 11:41:01,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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 25 [2021-12-14 11:41:01,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:41:01,581 INFO L225 Difference]: With dead ends: 243 [2021-12-14 11:41:01,581 INFO L226 Difference]: Without dead ends: 173 [2021-12-14 11:41:01,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 11:41:01,585 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 70 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:41:01,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 161 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:41:01,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-12-14 11:41:01,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 97. [2021-12-14 11:41:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.4791666666666667) internal successors, (142), 96 states have internal predecessors, (142), 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-12-14 11:41:01,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 142 transitions. [2021-12-14 11:41:01,601 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 142 transitions. Word has length 25 [2021-12-14 11:41:01,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:41:01,602 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 142 transitions. [2021-12-14 11:41:01,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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-12-14 11:41:01,602 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 142 transitions. [2021-12-14 11:41:01,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 11:41:01,602 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:01,602 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:41:01,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-14 11:41:01,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:41:01,803 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:01,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:01,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1384042382, now seen corresponding path program 1 times [2021-12-14 11:41:01,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:41:01,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272784078] [2021-12-14 11:41:01,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:01,806 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:41:01,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:41:01,807 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:41:01,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-14 11:41:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:41:01,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 11:41:01,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:41:01,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 11:41:01,879 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:41:01,879 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:41:01,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272784078] [2021-12-14 11:41:01,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272784078] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:41:01,880 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:41:01,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:41:01,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383967900] [2021-12-14 11:41:01,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:41:01,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:41:01,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:41:01,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:41:01,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:41:01,881 INFO L87 Difference]: Start difference. First operand 97 states and 142 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-12-14 11:41:01,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:41:01,886 INFO L93 Difference]: Finished difference Result 169 states and 248 transitions. [2021-12-14 11:41:01,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:41:01,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2021-12-14 11:41:01,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:41:01,887 INFO L225 Difference]: With dead ends: 169 [2021-12-14 11:41:01,887 INFO L226 Difference]: Without dead ends: 85 [2021-12-14 11:41:01,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:41:01,888 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 57 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:41:01,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 58 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:41:01,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-14 11:41:01,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2021-12-14 11:41:01,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 84 states have internal predecessors, (122), 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-12-14 11:41:01,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 122 transitions. [2021-12-14 11:41:01,891 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 122 transitions. Word has length 26 [2021-12-14 11:41:01,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:41:01,892 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 122 transitions. [2021-12-14 11:41:01,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-12-14 11:41:01,892 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 122 transitions. [2021-12-14 11:41:01,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 11:41:01,893 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:01,893 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:41:01,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-14 11:41:02,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:41:02,099 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:02,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:02,099 INFO L85 PathProgramCache]: Analyzing trace with hash 221982208, now seen corresponding path program 1 times [2021-12-14 11:41:02,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:41:02,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141798846] [2021-12-14 11:41:02,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:02,100 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:41:02,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:41:02,101 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:41:02,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-14 11:41:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:41:02,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 11:41:02,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:41:02,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:02,212 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:41:02,213 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:41:02,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141798846] [2021-12-14 11:41:02,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141798846] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:41:02,213 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:41:02,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 11:41:02,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504947159] [2021-12-14 11:41:02,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:41:02,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 11:41:02,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:41:02,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 11:41:02,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:41:02,216 INFO L87 Difference]: Start difference. First operand 85 states and 122 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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-12-14 11:41:02,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:41:02,274 INFO L93 Difference]: Finished difference Result 150 states and 213 transitions. [2021-12-14 11:41:02,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 11:41:02,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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 29 [2021-12-14 11:41:02,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:41:02,275 INFO L225 Difference]: With dead ends: 150 [2021-12-14 11:41:02,275 INFO L226 Difference]: Without dead ends: 136 [2021-12-14 11:41:02,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:41:02,276 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 60 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:41:02,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 115 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 45 Unchecked, 0.1s Time] [2021-12-14 11:41:02,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-14 11:41:02,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 121. [2021-12-14 11:41:02,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.4583333333333333) internal successors, (175), 120 states have internal predecessors, (175), 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-12-14 11:41:02,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 175 transitions. [2021-12-14 11:41:02,285 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 175 transitions. Word has length 29 [2021-12-14 11:41:02,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:41:02,285 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 175 transitions. [2021-12-14 11:41:02,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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-12-14 11:41:02,286 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 175 transitions. [2021-12-14 11:41:02,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 11:41:02,289 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:02,289 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:41:02,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-14 11:41:02,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:41:02,495 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:02,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:02,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1570096335, now seen corresponding path program 1 times [2021-12-14 11:41:02,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:41:02,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835024721] [2021-12-14 11:41:02,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:02,496 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:41:02,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:41:02,497 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:41:02,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-14 11:41:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:41:02,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 11:41:02,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:41:02,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:02,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:41:02,613 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:41:02,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835024721] [2021-12-14 11:41:02,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [835024721] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:41:02,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:41:02,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 11:41:02,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071885814] [2021-12-14 11:41:02,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:41:02,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 11:41:02,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:41:02,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 11:41:02,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:41:02,614 INFO L87 Difference]: Start difference. First operand 121 states and 175 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 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-12-14 11:41:02,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:41:02,655 INFO L93 Difference]: Finished difference Result 210 states and 294 transitions. [2021-12-14 11:41:02,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 11:41:02,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 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 30 [2021-12-14 11:41:02,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:41:02,656 INFO L225 Difference]: With dead ends: 210 [2021-12-14 11:41:02,656 INFO L226 Difference]: Without dead ends: 156 [2021-12-14 11:41:02,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:41:02,657 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 84 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:41:02,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 181 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 54 Unchecked, 0.0s Time] [2021-12-14 11:41:02,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-14 11:41:02,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 142. [2021-12-14 11:41:02,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.4042553191489362) internal successors, (198), 141 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:02,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 198 transitions. [2021-12-14 11:41:02,661 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 198 transitions. Word has length 30 [2021-12-14 11:41:02,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:41:02,662 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 198 transitions. [2021-12-14 11:41:02,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 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-12-14 11:41:02,662 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 198 transitions. [2021-12-14 11:41:02,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-14 11:41:02,664 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:02,665 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:41:02,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-14 11:41:02,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:41:02,871 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:02,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:02,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1760226409, now seen corresponding path program 1 times [2021-12-14 11:41:02,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:41:02,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751621403] [2021-12-14 11:41:02,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:02,871 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:41:02,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:41:02,872 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:41:02,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-14 11:41:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:41:02,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 11:41:02,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:41:03,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:03,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:41:03,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:03,121 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:41:03,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751621403] [2021-12-14 11:41:03,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751621403] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:41:03,122 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:41:03,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-12-14 11:41:03,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593330289] [2021-12-14 11:41:03,122 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:41:03,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 11:41:03,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:41:03,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 11:41:03,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-12-14 11:41:03,123 INFO L87 Difference]: Start difference. First operand 142 states and 198 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 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-12-14 11:41:03,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:41:03,651 INFO L93 Difference]: Finished difference Result 381 states and 580 transitions. [2021-12-14 11:41:03,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 11:41:03,651 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 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 31 [2021-12-14 11:41:03,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:41:03,652 INFO L225 Difference]: With dead ends: 381 [2021-12-14 11:41:03,652 INFO L226 Difference]: Without dead ends: 305 [2021-12-14 11:41:03,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2021-12-14 11:41:03,653 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 743 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 11:41:03,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [743 Valid, 391 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 11:41:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2021-12-14 11:41:03,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 273. [2021-12-14 11:41:03,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 272 states have (on average 1.4485294117647058) internal successors, (394), 272 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:41:03,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 394 transitions. [2021-12-14 11:41:03,659 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 394 transitions. Word has length 31 [2021-12-14 11:41:03,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:41:03,660 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 394 transitions. [2021-12-14 11:41:03,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 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-12-14 11:41:03,660 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 394 transitions. [2021-12-14 11:41:03,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-14 11:41:03,660 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:03,660 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:41:03,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-14 11:41:03,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:41:03,866 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:03,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:03,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1900775019, now seen corresponding path program 1 times [2021-12-14 11:41:03,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:41:03,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [232381343] [2021-12-14 11:41:03,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:03,867 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:41:03,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:41:03,868 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:41:03,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-14 11:41:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:41:03,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 11:41:03,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:41:03,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:03,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:41:04,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:04,045 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:41:04,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [232381343] [2021-12-14 11:41:04,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [232381343] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:41:04,046 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:41:04,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-14 11:41:04,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480744435] [2021-12-14 11:41:04,046 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:41:04,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 11:41:04,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:41:04,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 11:41:04,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:41:04,048 INFO L87 Difference]: Start difference. First operand 273 states and 394 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 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-12-14 11:41:04,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:41:04,218 INFO L93 Difference]: Finished difference Result 732 states and 1124 transitions. [2021-12-14 11:41:04,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 11:41:04,218 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 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 31 [2021-12-14 11:41:04,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:41:04,220 INFO L225 Difference]: With dead ends: 732 [2021-12-14 11:41:04,220 INFO L226 Difference]: Without dead ends: 498 [2021-12-14 11:41:04,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-12-14 11:41:04,221 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 405 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:41:04,221 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [405 Valid, 69 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:41:04,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2021-12-14 11:41:04,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 396. [2021-12-14 11:41:04,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.440506329113924) internal successors, (569), 395 states have internal predecessors, (569), 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-12-14 11:41:04,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 569 transitions. [2021-12-14 11:41:04,236 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 569 transitions. Word has length 31 [2021-12-14 11:41:04,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:41:04,236 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 569 transitions. [2021-12-14 11:41:04,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 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-12-14 11:41:04,236 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 569 transitions. [2021-12-14 11:41:04,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-14 11:41:04,237 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:04,237 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2021-12-14 11:41:04,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-14 11:41:04,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:41:04,443 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:04,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:04,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1235829048, now seen corresponding path program 1 times [2021-12-14 11:41:04,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:41:04,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596671346] [2021-12-14 11:41:04,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:04,444 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:41:04,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:41:04,445 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:41:04,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-14 11:41:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:41:04,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 11:41:04,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:41:04,604 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 53 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-14 11:41:04,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:41:04,734 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-12-14 11:41:04,735 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:41:04,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596671346] [2021-12-14 11:41:04,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [596671346] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:41:04,735 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:41:04,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-14 11:41:04,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873437938] [2021-12-14 11:41:04,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:41:04,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 11:41:04,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:41:04,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 11:41:04,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-12-14 11:41:04,737 INFO L87 Difference]: Start difference. First operand 396 states and 569 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 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-12-14 11:41:04,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:41:04,950 INFO L93 Difference]: Finished difference Result 1331 states and 1910 transitions. [2021-12-14 11:41:04,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 11:41:04,951 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 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 70 [2021-12-14 11:41:04,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:41:04,955 INFO L225 Difference]: With dead ends: 1331 [2021-12-14 11:41:04,955 INFO L226 Difference]: Without dead ends: 958 [2021-12-14 11:41:04,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2021-12-14 11:41:04,956 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 280 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:41:04,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 400 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:41:04,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2021-12-14 11:41:04,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 599. [2021-12-14 11:41:04,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 1.4866220735785953) internal successors, (889), 598 states have internal predecessors, (889), 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-12-14 11:41:04,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 889 transitions. [2021-12-14 11:41:04,979 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 889 transitions. Word has length 70 [2021-12-14 11:41:04,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:41:04,979 INFO L470 AbstractCegarLoop]: Abstraction has 599 states and 889 transitions. [2021-12-14 11:41:04,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 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-12-14 11:41:04,980 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 889 transitions. [2021-12-14 11:41:04,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-14 11:41:04,981 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:04,981 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2021-12-14 11:41:04,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-14 11:41:05,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:41:05,190 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:05,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:05,190 INFO L85 PathProgramCache]: Analyzing trace with hash 464635188, now seen corresponding path program 1 times [2021-12-14 11:41:05,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:41:05,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1727787343] [2021-12-14 11:41:05,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:05,191 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:41:05,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:41:05,196 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:41:05,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-14 11:41:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:41:05,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 11:41:05,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:41:05,375 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 11:41:05,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:41:05,488 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 11:41:05,488 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:41:05,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1727787343] [2021-12-14 11:41:05,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1727787343] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:41:05,488 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:41:05,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2021-12-14 11:41:05,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858953385] [2021-12-14 11:41:05,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:41:05,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 11:41:05,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:41:05,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 11:41:05,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-14 11:41:05,489 INFO L87 Difference]: Start difference. First operand 599 states and 889 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-12-14 11:41:05,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:41:05,670 INFO L93 Difference]: Finished difference Result 1536 states and 2181 transitions. [2021-12-14 11:41:05,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 11:41:05,671 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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 70 [2021-12-14 11:41:05,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:41:05,674 INFO L225 Difference]: With dead ends: 1536 [2021-12-14 11:41:05,674 INFO L226 Difference]: Without dead ends: 960 [2021-12-14 11:41:05,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-12-14 11:41:05,676 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 235 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:41:05,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 364 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:41:05,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2021-12-14 11:41:05,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 540. [2021-12-14 11:41:05,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 539 states have (on average 1.4267161410018554) internal successors, (769), 539 states have internal predecessors, (769), 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-12-14 11:41:05,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 769 transitions. [2021-12-14 11:41:05,699 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 769 transitions. Word has length 70 [2021-12-14 11:41:05,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:41:05,700 INFO L470 AbstractCegarLoop]: Abstraction has 540 states and 769 transitions. [2021-12-14 11:41:05,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-12-14 11:41:05,700 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 769 transitions. [2021-12-14 11:41:05,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-14 11:41:05,701 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:05,701 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2021-12-14 11:41:05,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-14 11:41:05,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:41:05,911 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:05,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:05,912 INFO L85 PathProgramCache]: Analyzing trace with hash 605183798, now seen corresponding path program 2 times [2021-12-14 11:41:05,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:41:05,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657550785] [2021-12-14 11:41:05,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 11:41:05,912 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:41:05,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:41:05,913 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:41:05,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-14 11:41:05,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 11:41:05,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 11:41:05,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-14 11:41:05,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:41:08,341 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:08,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:41:10,407 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:10,407 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:41:10,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657550785] [2021-12-14 11:41:10,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657550785] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:41:10,407 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:41:10,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2021-12-14 11:41:10,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477252424] [2021-12-14 11:41:10,408 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:41:10,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-12-14 11:41:10,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:41:10,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-12-14 11:41:10,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1750, Unknown=0, NotChecked=0, Total=1892 [2021-12-14 11:41:10,410 INFO L87 Difference]: Start difference. First operand 540 states and 769 transitions. Second operand has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 states have internal predecessors, (138), 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-12-14 11:41:22,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:41:22,042 INFO L93 Difference]: Finished difference Result 1608 states and 2176 transitions. [2021-12-14 11:41:22,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2021-12-14 11:41:22,043 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 states have internal predecessors, (138), 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 70 [2021-12-14 11:41:22,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:41:22,046 INFO L225 Difference]: With dead ends: 1608 [2021-12-14 11:41:22,046 INFO L226 Difference]: Without dead ends: 1500 [2021-12-14 11:41:22,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3336 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=2709, Invalid=13547, Unknown=0, NotChecked=0, Total=16256 [2021-12-14 11:41:22,050 INFO L933 BasicCegarLoop]: 450 mSDtfsCounter, 2317 mSDsluCounter, 8944 mSDsCounter, 0 mSdLazyCounter, 5454 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2317 SdHoareTripleChecker+Valid, 9394 SdHoareTripleChecker+Invalid, 5779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 5454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-12-14 11:41:22,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2317 Valid, 9394 Invalid, 5779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 5454 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2021-12-14 11:41:22,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2021-12-14 11:41:22,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 895. [2021-12-14 11:41:22,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 894 states have (on average 1.4407158836689038) internal successors, (1288), 894 states have internal predecessors, (1288), 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-12-14 11:41:22,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1288 transitions. [2021-12-14 11:41:22,074 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1288 transitions. Word has length 70 [2021-12-14 11:41:22,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:41:22,074 INFO L470 AbstractCegarLoop]: Abstraction has 895 states and 1288 transitions. [2021-12-14 11:41:22,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.1363636363636362) internal successors, (138), 44 states have internal predecessors, (138), 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-12-14 11:41:22,074 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1288 transitions. [2021-12-14 11:41:22,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-14 11:41:22,075 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:22,075 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2021-12-14 11:41:22,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-14 11:41:22,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:41:22,282 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:22,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:22,282 INFO L85 PathProgramCache]: Analyzing trace with hash 824038516, now seen corresponding path program 1 times [2021-12-14 11:41:22,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:41:22,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519295347] [2021-12-14 11:41:22,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:22,283 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:41:22,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:41:22,284 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:41:22,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-14 11:41:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:41:22,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 11:41:22,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:41:22,506 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 58 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 11:41:22,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:41:22,602 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 58 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 11:41:22,602 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:41:22,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519295347] [2021-12-14 11:41:22,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519295347] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:41:22,603 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:41:22,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-12-14 11:41:22,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27379657] [2021-12-14 11:41:22,603 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:41:22,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 11:41:22,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:41:22,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 11:41:22,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:41:22,604 INFO L87 Difference]: Start difference. First operand 895 states and 1288 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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-12-14 11:41:22,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:41:22,696 INFO L93 Difference]: Finished difference Result 1867 states and 2705 transitions. [2021-12-14 11:41:22,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 11:41:22,696 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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 70 [2021-12-14 11:41:22,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:41:22,704 INFO L225 Difference]: With dead ends: 1867 [2021-12-14 11:41:22,704 INFO L226 Difference]: Without dead ends: 992 [2021-12-14 11:41:22,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 132 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:41:22,705 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 25 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:41:22,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 84 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 110 Invalid, 0 Unknown, 116 Unchecked, 0.1s Time] [2021-12-14 11:41:22,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2021-12-14 11:41:22,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 840. [2021-12-14 11:41:22,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 839 states have (on average 1.4159713945172825) internal successors, (1188), 839 states have internal predecessors, (1188), 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-12-14 11:41:22,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1188 transitions. [2021-12-14 11:41:22,727 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1188 transitions. Word has length 70 [2021-12-14 11:41:22,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:41:22,728 INFO L470 AbstractCegarLoop]: Abstraction has 840 states and 1188 transitions. [2021-12-14 11:41:22,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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-12-14 11:41:22,728 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1188 transitions. [2021-12-14 11:41:22,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-14 11:41:22,729 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:41:22,729 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1] [2021-12-14 11:41:22,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-14 11:41:22,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 11:41:22,935 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:41:22,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:41:22,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1235371034, now seen corresponding path program 1 times [2021-12-14 11:41:22,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 11:41:22,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322980851] [2021-12-14 11:41:22,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:41:22,936 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 11:41:22,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 11:41:22,937 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 11:41:22,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-14 11:41:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:41:22,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-14 11:41:22,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:41:25,448 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:25,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:41:28,006 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:41:28,007 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 11:41:28,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322980851] [2021-12-14 11:41:28,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322980851] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:41:28,007 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 11:41:28,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2021-12-14 11:41:28,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425181443] [2021-12-14 11:41:28,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 11:41:28,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-14 11:41:28,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 11:41:28,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-14 11:41:28,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1921, Unknown=0, NotChecked=0, Total=2070 [2021-12-14 11:41:28,008 INFO L87 Difference]: Start difference. First operand 840 states and 1188 transitions. Second operand has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 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)