./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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/loops-crafted-1/Mono1_1-2.c -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 87992b509300f030a5da432e9377be19bc7547f7933c7234d13c36c34b6235c7 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 10:14:15,254 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 10:14:15,255 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 10:14:15,276 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 10:14:15,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 10:14:15,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 10:14:15,277 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 10:14:15,279 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 10:14:15,282 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 10:14:15,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 10:14:15,286 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 10:14:15,286 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 10:14:15,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 10:14:15,287 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 10:14:15,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 10:14:15,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 10:14:15,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 10:14:15,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 10:14:15,290 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 10:14:15,291 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 10:14:15,292 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 10:14:15,293 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 10:14:15,294 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 10:14:15,294 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 10:14:15,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 10:14:15,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 10:14:15,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 10:14:15,296 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 10:14:15,297 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 10:14:15,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 10:14:15,297 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 10:14:15,298 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 10:14:15,298 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 10:14:15,299 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 10:14:15,299 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 10:14:15,299 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 10:14:15,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 10:14:15,300 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 10:14:15,300 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 10:14:15,301 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 10:14:15,301 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 10:14:15,302 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 10:14:15,315 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 10:14:15,317 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 10:14:15,317 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 10:14:15,318 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 10:14:15,318 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 10:14:15,318 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 10:14:15,319 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 10:14:15,319 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 10:14:15,319 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 10:14:15,319 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 10:14:15,319 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 10:14:15,319 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 10:14:15,319 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 10:14:15,320 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 10:14:15,320 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 10:14:15,320 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 10:14:15,320 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 10:14:15,320 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 10:14:15,320 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 10:14:15,320 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 10:14:15,320 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 10:14:15,321 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 10:14:15,321 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 10:14:15,321 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 10:14:15,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 10:14:15,321 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 10:14:15,321 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 10:14:15,321 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 10:14:15,322 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 10:14:15,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 10:14:15,322 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 10:14:15,322 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 10:14:15,322 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 10:14:15,322 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 10:14:15,322 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 -> 87992b509300f030a5da432e9377be19bc7547f7933c7234d13c36c34b6235c7 [2021-12-17 10:14:15,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 10:14:15,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 10:14:15,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 10:14:15,527 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 10:14:15,527 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 10:14:15,528 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c [2021-12-17 10:14:15,573 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5896e77cb/b93a36f67a214fc2995aa7fb45066143/FLAGfdabda7ad [2021-12-17 10:14:15,921 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 10:14:15,921 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c [2021-12-17 10:14:15,928 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5896e77cb/b93a36f67a214fc2995aa7fb45066143/FLAGfdabda7ad [2021-12-17 10:14:15,938 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5896e77cb/b93a36f67a214fc2995aa7fb45066143 [2021-12-17 10:14:15,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 10:14:15,941 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 10:14:15,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 10:14:15,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 10:14:15,946 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 10:14:15,947 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:14:15" (1/1) ... [2021-12-17 10:14:15,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7df52824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:14:15, skipping insertion in model container [2021-12-17 10:14:15,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:14:15" (1/1) ... [2021-12-17 10:14:15,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 10:14:15,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 10:14:16,072 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/loops-crafted-1/Mono1_1-2.c[313,326] [2021-12-17 10:14:16,092 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 10:14:16,099 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 10:14:16,108 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/loops-crafted-1/Mono1_1-2.c[313,326] [2021-12-17 10:14:16,113 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 10:14:16,121 INFO L208 MainTranslator]: Completed translation [2021-12-17 10:14:16,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:14:16 WrapperNode [2021-12-17 10:14:16,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 10:14:16,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 10:14:16,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 10:14:16,123 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 10:14:16,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:14:16" (1/1) ... [2021-12-17 10:14:16,133 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:14:16" (1/1) ... [2021-12-17 10:14:16,144 INFO L137 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 26 [2021-12-17 10:14:16,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 10:14:16,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 10:14:16,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 10:14:16,146 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 10:14:16,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:14:16" (1/1) ... [2021-12-17 10:14:16,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:14:16" (1/1) ... [2021-12-17 10:14:16,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:14:16" (1/1) ... [2021-12-17 10:14:16,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:14:16" (1/1) ... [2021-12-17 10:14:16,155 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:14:16" (1/1) ... [2021-12-17 10:14:16,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:14:16" (1/1) ... [2021-12-17 10:14:16,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:14:16" (1/1) ... [2021-12-17 10:14:16,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 10:14:16,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 10:14:16,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 10:14:16,165 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 10:14:16,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:14:16" (1/1) ... [2021-12-17 10:14:16,171 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 10:14:16,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:14:16,187 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-17 10:14:16,205 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-17 10:14:16,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 10:14:16,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 10:14:16,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 10:14:16,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 10:14:16,253 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 10:14:16,255 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 10:14:16,346 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 10:14:16,351 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 10:14:16,351 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 10:14:16,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:14:16 BoogieIcfgContainer [2021-12-17 10:14:16,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 10:14:16,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 10:14:16,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 10:14:16,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 10:14:16,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 10:14:15" (1/3) ... [2021-12-17 10:14:16,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1846843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:14:16, skipping insertion in model container [2021-12-17 10:14:16,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:14:16" (2/3) ... [2021-12-17 10:14:16,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1846843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:14:16, skipping insertion in model container [2021-12-17 10:14:16,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:14:16" (3/3) ... [2021-12-17 10:14:16,360 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono1_1-2.c [2021-12-17 10:14:16,364 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 10:14:16,364 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 10:14:16,402 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 10:14:16,408 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-17 10:14:16,409 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 10:14:16,422 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:14:16,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-17 10:14:16,429 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:14:16,429 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-17 10:14:16,430 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:14:16,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:14:16,434 INFO L85 PathProgramCache]: Analyzing trace with hash 889937703, now seen corresponding path program 1 times [2021-12-17 10:14:16,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:14:16,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701412116] [2021-12-17 10:14:16,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:14:16,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:14:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:14:16,544 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-17 10:14:16,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:14:16,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701412116] [2021-12-17 10:14:16,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701412116] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 10:14:16,546 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 10:14:16,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 10:14:16,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238224028] [2021-12-17 10:14:16,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 10:14:16,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 10:14:16,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:14:16,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 10:14:16,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 10:14:16,574 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-17 10:14:16,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:14:16,582 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2021-12-17 10:14:16,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 10:14:16,583 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2021-12-17 10:14:16,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:14:16,592 INFO L225 Difference]: With dead ends: 20 [2021-12-17 10:14:16,592 INFO L226 Difference]: Without dead ends: 8 [2021-12-17 10:14:16,594 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-17 10:14:16,597 INFO L933 BasicCegarLoop]: 13 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, 13 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-17 10:14:16,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 10:14:16,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-12-17 10:14:16,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-12-17 10:14:16,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:14:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2021-12-17 10:14:16,625 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2021-12-17 10:14:16,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:14:16,628 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-12-17 10:14:16,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-17 10:14:16,628 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2021-12-17 10:14:16,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-17 10:14:16,629 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:14:16,629 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-17 10:14:16,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 10:14:16,630 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:14:16,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:14:16,631 INFO L85 PathProgramCache]: Analyzing trace with hash 889639793, now seen corresponding path program 1 times [2021-12-17 10:14:16,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:14:16,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657413873] [2021-12-17 10:14:16,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:14:16,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:14:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:14:16,724 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-17 10:14:16,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:14:16,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657413873] [2021-12-17 10:14:16,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657413873] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 10:14:16,725 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 10:14:16,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 10:14:16,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696997769] [2021-12-17 10:14:16,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 10:14:16,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 10:14:16,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:14:16,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 10:14:16,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 10:14:16,728 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-17 10:14:16,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:14:16,744 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2021-12-17 10:14:16,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 10:14:16,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2021-12-17 10:14:16,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:14:16,745 INFO L225 Difference]: With dead ends: 16 [2021-12-17 10:14:16,745 INFO L226 Difference]: Without dead ends: 10 [2021-12-17 10:14:16,745 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-17 10:14:16,746 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 10:14:16,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 10 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 10:14:16,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2021-12-17 10:14:16,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2021-12-17 10:14:16,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:14:16,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2021-12-17 10:14:16,757 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2021-12-17 10:14:16,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:14:16,771 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-12-17 10:14:16,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-17 10:14:16,771 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2021-12-17 10:14:16,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-17 10:14:16,772 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:14:16,772 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 10:14:16,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 10:14:16,772 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:14:16,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:14:16,773 INFO L85 PathProgramCache]: Analyzing trace with hash 295691924, now seen corresponding path program 1 times [2021-12-17 10:14:16,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:14:16,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064570231] [2021-12-17 10:14:16,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:14:16,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:14:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:14:16,824 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-17 10:14:16,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:14:16,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064570231] [2021-12-17 10:14:16,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064570231] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 10:14:16,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582729528] [2021-12-17 10:14:16,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:14:16,825 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:14:16,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:14:16,827 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-17 10:14:16,828 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-17 10:14:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:14:16,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 10:14:16,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:14:16,900 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-17 10:14:16,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 10:14:16,966 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-17 10:14:16,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582729528] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 10:14:16,967 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 10:14:16,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-17 10:14:16,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258822249] [2021-12-17 10:14:16,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 10:14:16,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 10:14:16,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:14:16,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 10:14:16,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-12-17 10:14:16,969 INFO L87 Difference]: Start difference. First operand 10 states and 11 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-17 10:14:17,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:14:17,004 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2021-12-17 10:14:17,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 10:14:17,005 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 8 [2021-12-17 10:14:17,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:14:17,005 INFO L225 Difference]: With dead ends: 20 [2021-12-17 10:14:17,006 INFO L226 Difference]: Without dead ends: 14 [2021-12-17 10:14:17,006 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2021-12-17 10:14:17,007 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 10:14:17,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 15 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 10:14:17,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-12-17 10:14:17,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2021-12-17 10:14:17,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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-17 10:14:17,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2021-12-17 10:14:17,010 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 8 [2021-12-17 10:14:17,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:14:17,010 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-12-17 10:14:17,010 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-17 10:14:17,010 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2021-12-17 10:14:17,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-17 10:14:17,011 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:14:17,011 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 10:14:17,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 10:14:17,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:14:17,228 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:14:17,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:14:17,228 INFO L85 PathProgramCache]: Analyzing trace with hash 572634524, now seen corresponding path program 1 times [2021-12-17 10:14:17,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:14:17,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958148659] [2021-12-17 10:14:17,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:14:17,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:14:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:14:17,296 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:14:17,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:14:17,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958148659] [2021-12-17 10:14:17,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958148659] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 10:14:17,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306111388] [2021-12-17 10:14:17,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:14:17,297 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:14:17,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:14:17,304 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-17 10:14:17,306 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-17 10:14:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:14:17,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 10:14:17,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:14:17,410 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:14:17,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 10:14:17,493 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:14:17,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306111388] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 10:14:17,494 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 10:14:17,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 10 [2021-12-17 10:14:17,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268304542] [2021-12-17 10:14:17,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 10:14:17,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 10:14:17,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:14:17,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 10:14:17,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2021-12-17 10:14:17,496 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:14:17,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:14:17,626 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2021-12-17 10:14:17,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 10:14:17,628 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-17 10:14:17,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:14:17,629 INFO L225 Difference]: With dead ends: 28 [2021-12-17 10:14:17,629 INFO L226 Difference]: Without dead ends: 21 [2021-12-17 10:14:17,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2021-12-17 10:14:17,630 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 15 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 10:14:17,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 17 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 10:14:17,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-12-17 10:14:17,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-12-17 10:14:17,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:14:17,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2021-12-17 10:14:17,633 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 12 [2021-12-17 10:14:17,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:14:17,633 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-12-17 10:14:17,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:14:17,633 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2021-12-17 10:14:17,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-17 10:14:17,634 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:14:17,634 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 10:14:17,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-17 10:14:17,842 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,SelfDestructingSolverStorable3 [2021-12-17 10:14:17,843 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:14:17,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:14:17,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1634475176, now seen corresponding path program 2 times [2021-12-17 10:14:17,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:14:17,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256723051] [2021-12-17 10:14:17,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:14:17,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:14:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:14:17,965 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:14:17,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:14:17,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256723051] [2021-12-17 10:14:17,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256723051] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 10:14:17,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629803664] [2021-12-17 10:14:17,969 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 10:14:17,969 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:14:17,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:14:17,970 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-17 10:14:17,971 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-17 10:14:17,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 10:14:17,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 10:14:18,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-17 10:14:18,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:14:18,126 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:14:18,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 10:14:18,336 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:14:18,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629803664] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 10:14:18,336 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 10:14:18,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 18 [2021-12-17 10:14:18,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214464832] [2021-12-17 10:14:18,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 10:14:18,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-17 10:14:18,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:14:18,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-17 10:14:18,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2021-12-17 10:14:18,338 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:14:19,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:14:19,461 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2021-12-17 10:14:19,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-17 10:14:19,462 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-17 10:14:19,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:14:19,462 INFO L225 Difference]: With dead ends: 44 [2021-12-17 10:14:19,462 INFO L226 Difference]: Without dead ends: 37 [2021-12-17 10:14:19,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=231, Invalid=369, Unknown=0, NotChecked=0, Total=600 [2021-12-17 10:14:19,463 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 35 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 10:14:19,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 19 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 10:14:19,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-17 10:14:19,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-12-17 10:14:19,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:14:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2021-12-17 10:14:19,468 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 20 [2021-12-17 10:14:19,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:14:19,468 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2021-12-17 10:14:19,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:14:19,469 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2021-12-17 10:14:19,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-17 10:14:19,469 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:14:19,469 INFO L514 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 10:14:19,485 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-17 10:14:19,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:14:19,683 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:14:19,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:14:19,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1104705856, now seen corresponding path program 3 times [2021-12-17 10:14:19,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:14:19,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143120454] [2021-12-17 10:14:19,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:14:19,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:14:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:14:19,915 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 15 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:14:19,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:14:19,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143120454] [2021-12-17 10:14:19,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143120454] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 10:14:19,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282559189] [2021-12-17 10:14:19,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 10:14:19,916 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:14:19,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:14:19,919 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-17 10:14:19,921 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-17 10:14:19,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-17 10:14:19,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 10:14:19,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-17 10:14:19,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:14:20,022 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2021-12-17 10:14:20,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 10:14:20,178 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2021-12-17 10:14:20,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282559189] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 10:14:20,179 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 10:14:20,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 4, 6] total 23 [2021-12-17 10:14:20,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104371086] [2021-12-17 10:14:20,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 10:14:20,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-17 10:14:20,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:14:20,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-17 10:14:20,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2021-12-17 10:14:20,182 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:14:20,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:14:20,504 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2021-12-17 10:14:20,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-17 10:14:20,504 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-17 10:14:20,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:14:20,505 INFO L225 Difference]: With dead ends: 56 [2021-12-17 10:14:20,505 INFO L226 Difference]: Without dead ends: 47 [2021-12-17 10:14:20,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=522, Unknown=0, NotChecked=0, Total=702 [2021-12-17 10:14:20,506 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 36 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 10:14:20,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 16 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 10:14:20,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-17 10:14:20,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2021-12-17 10:14:20,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:14:20,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2021-12-17 10:14:20,511 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 36 [2021-12-17 10:14:20,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:14:20,511 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2021-12-17 10:14:20,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:14:20,512 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2021-12-17 10:14:20,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-17 10:14:20,512 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:14:20,513 INFO L514 BasicCegarLoop]: trace histogram [19, 15, 4, 1, 1, 1, 1, 1, 1] [2021-12-17 10:14:20,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-17 10:14:20,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:14:20,728 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:14:20,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:14:20,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1664138286, now seen corresponding path program 4 times [2021-12-17 10:14:20,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:14:20,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477497182] [2021-12-17 10:14:20,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:14:20,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:14:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:14:20,981 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 112 proven. 240 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-17 10:14:20,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:14:20,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477497182] [2021-12-17 10:14:20,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477497182] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 10:14:20,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158749348] [2021-12-17 10:14:20,982 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 10:14:20,982 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:14:20,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:14:20,983 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-17 10:14:20,984 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-17 10:14:21,011 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 10:14:21,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 10:14:21,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-17 10:14:21,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:14:21,240 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:14:21,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 10:14:21,902 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:14:21,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158749348] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 10:14:21,902 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 10:14:21,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 22] total 43 [2021-12-17 10:14:21,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652102235] [2021-12-17 10:14:21,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 10:14:21,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-17 10:14:21,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:14:21,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-17 10:14:21,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=1287, Unknown=0, NotChecked=0, Total=1806 [2021-12-17 10:14:21,906 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 43 states have internal predecessors, (90), 0 states have call successors, (0), 0 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-17 10:14:42,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:14:42,748 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2021-12-17 10:14:42,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-17 10:14:42,749 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 43 states have internal predecessors, (90), 0 states have call successors, (0), 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-17 10:14:42,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:14:42,750 INFO L225 Difference]: With dead ends: 76 [2021-12-17 10:14:42,750 INFO L226 Difference]: Without dead ends: 63 [2021-12-17 10:14:42,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=939, Invalid=1922, Unknown=1, NotChecked=0, Total=2862 [2021-12-17 10:14:42,752 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 28 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-17 10:14:42,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 66 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-17 10:14:42,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-17 10:14:42,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-12-17 10:14:42,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 62 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-17 10:14:42,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2021-12-17 10:14:42,764 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 44 [2021-12-17 10:14:42,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:14:42,764 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2021-12-17 10:14:42,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 43 states have internal predecessors, (90), 0 states have call successors, (0), 0 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-17 10:14:42,765 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2021-12-17 10:14:42,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-17 10:14:42,767 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:14:42,767 INFO L514 BasicCegarLoop]: trace histogram [28, 16, 12, 1, 1, 1, 1, 1, 1] [2021-12-17 10:14:42,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-17 10:14:42,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:14:42,968 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:14:42,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:14:42,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1269144285, now seen corresponding path program 5 times [2021-12-17 10:14:42,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:14:42,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478334408] [2021-12-17 10:14:42,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:14:42,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:14:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:14:43,225 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 391 proven. 272 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2021-12-17 10:14:43,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:14:43,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478334408] [2021-12-17 10:14:43,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478334408] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 10:14:43,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741985174] [2021-12-17 10:14:43,225 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 10:14:43,225 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:14:43,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:14:43,227 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-17 10:14:43,229 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-17 10:14:43,760 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2021-12-17 10:14:43,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 10:14:43,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-17 10:14:43,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:14:44,026 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 361 proven. 342 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-17 10:14:44,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 10:14:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 361 proven. 342 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-17 10:14:44,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741985174] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 10:14:44,953 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 10:14:44,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 22] total 42 [2021-12-17 10:14:44,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837329866] [2021-12-17 10:14:44,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 10:14:44,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-12-17 10:14:44,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:14:44,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-12-17 10:14:44,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=1223, Unknown=0, NotChecked=0, Total=1722 [2021-12-17 10:14:44,954 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 42 states have internal predecessors, (88), 0 states have call successors, (0), 0 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-17 10:15:45,606 WARN L227 SmtUtils]: Spent 5.96s on a formula simplification. DAG size of input: 117 DAG size of output: 15 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 10:15:45,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:15:45,610 INFO L93 Difference]: Finished difference Result 132 states and 176 transitions. [2021-12-17 10:15:45,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-12-17 10:15:45,611 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 42 states have internal predecessors, (88), 0 states have call successors, (0), 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 62 [2021-12-17 10:15:45,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:15:45,611 INFO L225 Difference]: With dead ends: 132 [2021-12-17 10:15:45,611 INFO L226 Difference]: Without dead ends: 103 [2021-12-17 10:15:45,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 61.1s TimeCoverageRelationStatistics Valid=1297, Invalid=2363, Unknown=0, NotChecked=0, Total=3660 [2021-12-17 10:15:45,613 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 93 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 10:15:45,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 37 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-17 10:15:45,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-17 10:15:45,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-12-17 10:15:45,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.1274509803921569) internal successors, (115), 102 states have internal predecessors, (115), 0 states have call successors, (0), 0 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-17 10:15:45,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2021-12-17 10:15:45,626 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 62 [2021-12-17 10:15:45,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:15:45,626 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2021-12-17 10:15:45,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 42 states have internal predecessors, (88), 0 states have call successors, (0), 0 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-17 10:15:45,626 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2021-12-17 10:15:45,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-12-17 10:15:45,627 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:15:45,627 INFO L514 BasicCegarLoop]: trace histogram [48, 36, 12, 1, 1, 1, 1, 1, 1] [2021-12-17 10:15:45,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-17 10:15:45,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:15:45,832 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:15:45,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:15:45,832 INFO L85 PathProgramCache]: Analyzing trace with hash 144826137, now seen corresponding path program 6 times [2021-12-17 10:15:45,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:15:45,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687716254] [2021-12-17 10:15:45,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:15:45,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:15:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:15:46,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 851 proven. 1332 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2021-12-17 10:15:46,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:15:46,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687716254] [2021-12-17 10:15:46,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687716254] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 10:15:46,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485778336] [2021-12-17 10:15:46,548 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-17 10:15:46,548 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:15:46,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:15:46,549 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-17 10:15:46,549 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-17 10:15:52,587 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2021-12-17 10:15:52,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 10:15:52,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 61 conjunts are in the unsatisfiable core [2021-12-17 10:15:52,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:15:55,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1260 proven. 492 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2021-12-17 10:15:55,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 10:15:57,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 945 proven. 169 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2021-12-17 10:15:57,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485778336] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 10:15:57,710 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 10:15:57,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 27, 19] total 81 [2021-12-17 10:15:57,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203984840] [2021-12-17 10:15:57,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 10:15:57,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2021-12-17 10:15:57,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:15:57,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2021-12-17 10:15:57,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2021-12-17 10:15:57,720 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand has 81 states, 81 states have (on average 2.037037037037037) internal successors, (165), 81 states have internal predecessors, (165), 0 states have call successors, (0), 0 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-17 10:18:29,314 WARN L227 SmtUtils]: Spent 25.20s on a formula simplification. DAG size of input: 101 DAG size of output: 88 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 10:19:09,445 WARN L227 SmtUtils]: Spent 12.06s on a formula simplification. DAG size of input: 84 DAG size of output: 82 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 10:19:22,121 WARN L227 SmtUtils]: Spent 5.63s on a formula simplification that was a NOOP. DAG size: 78 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 10:19:34,791 WARN L227 SmtUtils]: Spent 6.09s on a formula simplification. DAG size of input: 77 DAG size of output: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 10:19:55,587 WARN L227 SmtUtils]: Spent 5.86s on a formula simplification. DAG size of input: 70 DAG size of output: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 10:20:26,496 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 10:21:39,247 WARN L227 SmtUtils]: Spent 30.06s on a formula simplification. DAG size of input: 99 DAG size of output: 88 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 10:21:39,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:21:39,318 INFO L93 Difference]: Finished difference Result 190 states and 256 transitions. [2021-12-17 10:21:39,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2021-12-17 10:21:39,319 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 2.037037037037037) internal successors, (165), 81 states have internal predecessors, (165), 0 states have call successors, (0), 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 102 [2021-12-17 10:21:39,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:21:39,320 INFO L225 Difference]: With dead ends: 190 [2021-12-17 10:21:39,320 INFO L226 Difference]: Without dead ends: 159 [2021-12-17 10:21:39,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2708 ImplicationChecksByTransitivity, 331.8s TimeCoverageRelationStatistics Valid=5044, Invalid=10956, Unknown=2, NotChecked=0, Total=16002 [2021-12-17 10:21:39,323 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 269 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 2610 mSolverCounterSat, 695 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 3305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 695 IncrementalHoareTripleChecker+Valid, 2610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2021-12-17 10:21:39,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 50 Invalid, 3305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [695 Valid, 2610 Invalid, 0 Unknown, 0 Unchecked, 14.8s Time] [2021-12-17 10:21:39,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-17 10:21:39,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 133. [2021-12-17 10:21:39,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.1136363636363635) internal successors, (147), 132 states have internal predecessors, (147), 0 states have call successors, (0), 0 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-17 10:21:39,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 147 transitions. [2021-12-17 10:21:39,331 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 147 transitions. Word has length 102 [2021-12-17 10:21:39,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:21:39,331 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 147 transitions. [2021-12-17 10:21:39,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 2.037037037037037) internal successors, (165), 81 states have internal predecessors, (165), 0 states have call successors, (0), 0 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-17 10:21:39,331 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2021-12-17 10:21:39,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-12-17 10:21:39,332 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:21:39,332 INFO L514 BasicCegarLoop]: trace histogram [63, 37, 26, 1, 1, 1, 1, 1, 1] [2021-12-17 10:21:39,358 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-17 10:21:39,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:21:39,556 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:21:39,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:21:39,556 INFO L85 PathProgramCache]: Analyzing trace with hash 687173634, now seen corresponding path program 7 times [2021-12-17 10:21:39,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:21:39,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731830631] [2021-12-17 10:21:39,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:21:39,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:21:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:21:40,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1938 proven. 1406 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2021-12-17 10:21:40,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:21:40,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731830631] [2021-12-17 10:21:40,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731830631] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 10:21:40,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50353611] [2021-12-17 10:21:40,308 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-17 10:21:40,308 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:21:40,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:21:40,309 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 10:21:40,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-17 10:21:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:21:40,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 108 conjunts are in the unsatisfiable core [2021-12-17 10:21:40,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:21:41,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1113 proven. 2756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-12-17 10:21:41,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 10:21:46,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1113 proven. 2756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-12-17 10:21:46,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50353611] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 10:21:46,879 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 10:21:46,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 55, 56] total 110 [2021-12-17 10:21:46,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142982669] [2021-12-17 10:21:46,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 10:21:46,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 110 states [2021-12-17 10:21:46,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:21:46,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2021-12-17 10:21:46,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3172, Invalid=8818, Unknown=0, NotChecked=0, Total=11990 [2021-12-17 10:21:46,883 INFO L87 Difference]: Start difference. First operand 133 states and 147 transitions. Second operand has 110 states, 110 states have (on average 2.036363636363636) internal successors, (224), 110 states have internal predecessors, (224), 0 states have call successors, (0), 0 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-17 10:21:50,245 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (< .cse0 10000000) (<= 100000000 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (<= 100000000 .cse1) (< .cse1 10000000))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (<= 100000000 .cse2) (< .cse2 10000000))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (<= 100000000 .cse3) (< .cse3 10000000))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (< .cse4 10000000) (<= 100000000 .cse4))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 53) 4294967296))) (or (<= 100000000 .cse5) (< .cse5 10000000))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (<= 100000000 .cse6) (< .cse6 10000000))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 41) 4294967296))) (or (<= 100000000 .cse7) (< .cse7 10000000))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< .cse8 10000000) (<= 100000000 .cse8))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 65) 4294967296))) (or (< .cse9 10000000) (<= 100000000 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296))) (or (< .cse10 10000000) (<= 100000000 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (<= 100000000 .cse11) (< .cse11 10000000))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 64) 4294967296))) (or (< .cse12 10000000) (<= 100000000 .cse12))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse13 10000000) (<= 100000000 .cse13))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 61) 4294967296))) (or (< .cse14 10000000) (<= 100000000 .cse14))) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 10000000) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296))) (or (< .cse15 10000000) (<= 100000000 .cse15))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (<= 100000000 .cse16) (< .cse16 10000000))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (< .cse17 10000000) (<= 100000000 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (<= 100000000 .cse18) (< .cse18 10000000))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 59) 4294967296))) (or (< .cse19 10000000) (<= 100000000 .cse19))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (<= 100000000 .cse20) (< .cse20 10000000))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296))) (or (< .cse21 10000000) (<= 100000000 .cse21))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296))) (or (< .cse22 10000000) (<= 100000000 .cse22))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 62) 4294967296))) (or (<= 100000000 .cse23) (< .cse23 10000000))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse24 10000000) (<= 100000000 .cse24))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 54) 4294967296))) (or (<= 100000000 .cse25) (< .cse25 10000000))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (<= 100000000 .cse26) (< .cse26 10000000))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (<= 100000000 .cse27) (< .cse27 10000000))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (or (<= 100000000 .cse28) (< .cse28 10000000))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (<= 100000000 .cse29) (< .cse29 10000000))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (<= 100000000 .cse30) (< .cse30 10000000))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 63) 4294967296))) (or (<= 100000000 .cse31) (< .cse31 10000000))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 56) 4294967296))) (or (< .cse32 10000000) (<= 100000000 .cse32))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (< .cse33 10000000) (<= 100000000 .cse33))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 55) 4294967296))) (or (<= 100000000 .cse34) (< .cse34 10000000))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296))) (or (<= 100000000 .cse35) (< .cse35 10000000))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (<= 100000000 .cse36) (< .cse36 10000000))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (<= 100000000 .cse37) (< .cse37 10000000))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (<= 100000000 .cse38) (< .cse38 10000000))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 58) 4294967296))) (or (< .cse39 10000000) (<= 100000000 .cse39))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (<= 100000000 .cse40) (< .cse40 10000000))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (< .cse41 10000000) (<= 100000000 .cse41))) (let ((.cse42 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (<= 100000000 .cse42) (< .cse42 10000000))) (let ((.cse43 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 57) 4294967296))) (or (<= 100000000 .cse43) (< .cse43 10000000))) (let ((.cse44 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse44 10000000) (<= 100000000 .cse44))) (let ((.cse45 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (<= 100000000 .cse45) (< .cse45 10000000))) (let ((.cse46 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 66) 4294967296))) (or (< .cse46 10000000) (<= 100000000 .cse46))) (let ((.cse47 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< .cse47 10000000) (<= 100000000 .cse47))) (let ((.cse48 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 67) 4294967296))) (or (<= 100000000 .cse48) (< .cse48 10000000))) (let ((.cse49 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< .cse49 10000000) (<= 100000000 .cse49))) (let ((.cse50 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296))) (or (<= 100000000 .cse50) (< .cse50 10000000))) (let ((.cse51 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse51 10000000) (<= 100000000 .cse51)))) is different from false [2021-12-17 10:24:26,680 WARN L227 SmtUtils]: Spent 1.09m on a formula simplification. DAG size of input: 227 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 10:26:28,735 WARN L227 SmtUtils]: Spent 47.99s on a formula simplification. DAG size of input: 239 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 10:26:30,852 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (< .cse0 10000000) (<= 100000000 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (<= 100000000 .cse1) (< .cse1 10000000))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (<= 100000000 .cse2) (< .cse2 10000000))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (<= 100000000 .cse3) (< .cse3 10000000))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (< .cse4 10000000) (<= 100000000 .cse4))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 53) 4294967296))) (or (<= 100000000 .cse5) (< .cse5 10000000))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (<= 100000000 .cse6) (< .cse6 10000000))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 41) 4294967296))) (or (<= 100000000 .cse7) (< .cse7 10000000))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< .cse8 10000000) (<= 100000000 .cse8))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 65) 4294967296))) (or (< .cse9 10000000) (<= 100000000 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296))) (or (< .cse10 10000000) (<= 100000000 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (<= 100000000 .cse11) (< .cse11 10000000))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 64) 4294967296))) (or (< .cse12 10000000) (<= 100000000 .cse12))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse13 10000000) (<= 100000000 .cse13))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 61) 4294967296))) (or (< .cse14 10000000) (<= 100000000 .cse14))) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 10000000) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296))) (or (< .cse15 10000000) (<= 100000000 .cse15))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (<= 100000000 .cse16) (< .cse16 10000000))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (< .cse17 10000000) (<= 100000000 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (<= 100000000 .cse18) (< .cse18 10000000))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 59) 4294967296))) (or (< .cse19 10000000) (<= 100000000 .cse19))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (<= 100000000 .cse20) (< .cse20 10000000))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296))) (or (< .cse21 10000000) (<= 100000000 .cse21))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296))) (or (< .cse22 10000000) (<= 100000000 .cse22))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 62) 4294967296))) (or (<= 100000000 .cse23) (< .cse23 10000000))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse24 10000000) (<= 100000000 .cse24))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 54) 4294967296))) (or (<= 100000000 .cse25) (< .cse25 10000000))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (<= 100000000 .cse26) (< .cse26 10000000))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (<= 100000000 .cse27) (< .cse27 10000000))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (or (<= 100000000 .cse28) (< .cse28 10000000))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (<= 100000000 .cse29) (< .cse29 10000000))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (<= 100000000 .cse30) (< .cse30 10000000))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 63) 4294967296))) (or (<= 100000000 .cse31) (< .cse31 10000000))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 56) 4294967296))) (or (< .cse32 10000000) (<= 100000000 .cse32))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (< .cse33 10000000) (<= 100000000 .cse33))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 55) 4294967296))) (or (<= 100000000 .cse34) (< .cse34 10000000))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296))) (or (<= 100000000 .cse35) (< .cse35 10000000))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (<= 100000000 .cse36) (< .cse36 10000000))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (<= 100000000 .cse37) (< .cse37 10000000))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (<= 100000000 .cse38) (< .cse38 10000000))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 58) 4294967296))) (or (< .cse39 10000000) (<= 100000000 .cse39))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (<= 100000000 .cse40) (< .cse40 10000000))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (< .cse41 10000000) (<= 100000000 .cse41))) (let ((.cse42 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (<= 100000000 .cse42) (< .cse42 10000000))) (let ((.cse43 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 57) 4294967296))) (or (<= 100000000 .cse43) (< .cse43 10000000))) (let ((.cse44 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse44 10000000) (<= 100000000 .cse44))) (let ((.cse45 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (<= 100000000 .cse45) (< .cse45 10000000))) (let ((.cse46 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< .cse46 10000000) (<= 100000000 .cse46))) (let ((.cse47 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< .cse47 10000000) (<= 100000000 .cse47))) (let ((.cse48 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296))) (or (<= 100000000 .cse48) (< .cse48 10000000))) (let ((.cse49 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse49 10000000) (<= 100000000 .cse49)))) is different from false [2021-12-17 10:26:32,943 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (< .cse0 10000000) (<= 100000000 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296))) (or (< .cse1 10000000) (<= 100000000 .cse1))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (<= 100000000 .cse2) (< .cse2 10000000))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296))) (or (< .cse3 10000000) (<= 100000000 .cse3))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 53) 4294967296))) (or (<= 100000000 .cse4) (< .cse4 10000000))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 62) 4294967296))) (or (<= 100000000 .cse5) (< .cse5 10000000))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (<= 100000000 .cse6) (< .cse6 10000000))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse7 10000000) (<= 100000000 .cse7))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 54) 4294967296))) (or (<= 100000000 .cse8) (< .cse8 10000000))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (<= 100000000 .cse9) (< .cse9 10000000))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (<= 100000000 .cse10) (< .cse10 10000000))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 41) 4294967296))) (or (<= 100000000 .cse11) (< .cse11 10000000))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296))) (or (<= 100000000 .cse12) (< .cse12 10000000))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (<= 100000000 .cse13) (< .cse13 10000000))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (<= 100000000 .cse14) (< .cse14 10000000))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< .cse15 10000000) (<= 100000000 .cse15))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 63) 4294967296))) (or (<= 100000000 .cse16) (< .cse16 10000000))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 65) 4294967296))) (or (< .cse17 10000000) (<= 100000000 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296))) (or (< .cse18 10000000) (<= 100000000 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (<= 100000000 .cse19) (< .cse19 10000000))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 56) 4294967296))) (or (< .cse20 10000000) (<= 100000000 .cse20))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 55) 4294967296))) (or (<= 100000000 .cse21) (< .cse21 10000000))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 64) 4294967296))) (or (< .cse22 10000000) (<= 100000000 .cse22))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296))) (or (<= 100000000 .cse23) (< .cse23 10000000))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse24 10000000) (<= 100000000 .cse24))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 61) 4294967296))) (or (< .cse25 10000000) (<= 100000000 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (<= 100000000 .cse26) (< .cse26 10000000))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296))) (or (< .cse27 10000000) (<= 100000000 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 58) 4294967296))) (or (< .cse28 10000000) (<= 100000000 .cse28))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (< .cse29 10000000) (<= 100000000 .cse29))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (<= 100000000 .cse30) (< .cse30 10000000))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 57) 4294967296))) (or (<= 100000000 .cse31) (< .cse31 10000000))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (<= 100000000 .cse32) (< .cse32 10000000))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 66) 4294967296))) (or (< .cse33 10000000) (<= 100000000 .cse33))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 67) 4294967296))) (or (<= 100000000 .cse34) (< .cse34 10000000))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< .cse35 10000000) (<= 100000000 .cse35))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296))) (or (<= 100000000 .cse36) (< .cse36 10000000))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (< .cse37 10000000) (<= 100000000 .cse37))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse38 10000000) (<= 100000000 .cse38))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 59) 4294967296))) (or (< .cse39 10000000) (<= 100000000 .cse39)))) is different from false [2021-12-17 10:28:57,369 WARN L227 SmtUtils]: Spent 43.20s on a formula simplification. DAG size of input: 215 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15