./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/Mono3_1.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/Mono3_1.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 0756a7f5fb7c80ee6b59c75ec6cf9015a96d2c6a2bbe84a426dbe33a7087e683 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 10:15:23,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 10:15:23,360 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 10:15:23,422 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 10:15:23,422 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 10:15:23,425 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 10:15:23,426 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 10:15:23,428 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 10:15:23,430 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 10:15:23,434 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 10:15:23,435 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 10:15:23,436 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 10:15:23,436 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 10:15:23,438 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 10:15:23,439 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 10:15:23,444 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 10:15:23,445 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 10:15:23,446 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 10:15:23,447 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 10:15:23,450 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 10:15:23,452 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 10:15:23,453 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 10:15:23,454 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 10:15:23,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 10:15:23,458 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 10:15:23,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 10:15:23,458 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 10:15:23,459 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 10:15:23,460 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 10:15:23,460 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 10:15:23,460 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 10:15:23,461 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 10:15:23,462 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 10:15:23,463 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 10:15:23,464 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 10:15:23,464 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 10:15:23,464 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 10:15:23,465 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 10:15:23,465 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 10:15:23,465 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 10:15:23,466 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 10:15:23,467 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:15:23,491 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 10:15:23,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 10:15:23,492 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 10:15:23,492 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 10:15:23,493 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 10:15:23,493 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 10:15:23,493 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 10:15:23,494 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 10:15:23,494 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 10:15:23,494 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 10:15:23,495 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 10:15:23,495 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 10:15:23,495 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 10:15:23,495 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 10:15:23,495 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 10:15:23,495 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 10:15:23,496 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 10:15:23,496 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 10:15:23,496 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 10:15:23,496 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 10:15:23,496 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 10:15:23,496 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 10:15:23,497 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 10:15:23,497 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 10:15:23,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 10:15:23,497 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 10:15:23,497 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 10:15:23,498 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 10:15:23,499 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 10:15:23,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 10:15:23,499 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 10:15:23,499 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 10:15:23,499 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 10:15:23,499 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 10:15:23,499 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 -> 0756a7f5fb7c80ee6b59c75ec6cf9015a96d2c6a2bbe84a426dbe33a7087e683 [2021-12-17 10:15:23,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 10:15:23,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 10:15:23,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 10:15:23,676 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 10:15:23,676 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 10:15:23,677 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/Mono3_1.c [2021-12-17 10:15:23,726 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d893a3c46/57211f46c2f549a8a659f030ba0c7033/FLAG9579b3a33 [2021-12-17 10:15:24,076 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 10:15:24,077 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/Mono3_1.c [2021-12-17 10:15:24,080 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d893a3c46/57211f46c2f549a8a659f030ba0c7033/FLAG9579b3a33 [2021-12-17 10:15:24,089 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d893a3c46/57211f46c2f549a8a659f030ba0c7033 [2021-12-17 10:15:24,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 10:15:24,091 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 10:15:24,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 10:15:24,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 10:15:24,094 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 10:15:24,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:15:24" (1/1) ... [2021-12-17 10:15:24,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d877592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:15:24, skipping insertion in model container [2021-12-17 10:15:24,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:15:24" (1/1) ... [2021-12-17 10:15:24,100 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 10:15:24,107 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 10:15:24,212 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/Mono3_1.c[311,324] [2021-12-17 10:15:24,231 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 10:15:24,240 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 10:15:24,251 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/Mono3_1.c[311,324] [2021-12-17 10:15:24,255 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 10:15:24,266 INFO L208 MainTranslator]: Completed translation [2021-12-17 10:15:24,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:15:24 WrapperNode [2021-12-17 10:15:24,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 10:15:24,268 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 10:15:24,268 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 10:15:24,269 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 10:15:24,275 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:15:24" (1/1) ... [2021-12-17 10:15:24,281 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:15:24" (1/1) ... [2021-12-17 10:15:24,294 INFO L137 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2021-12-17 10:15:24,294 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 10:15:24,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 10:15:24,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 10:15:24,295 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 10:15:24,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:15:24" (1/1) ... [2021-12-17 10:15:24,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:15:24" (1/1) ... [2021-12-17 10:15:24,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:15:24" (1/1) ... [2021-12-17 10:15:24,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:15:24" (1/1) ... [2021-12-17 10:15:24,306 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:15:24" (1/1) ... [2021-12-17 10:15:24,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:15:24" (1/1) ... [2021-12-17 10:15:24,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:15:24" (1/1) ... [2021-12-17 10:15:24,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 10:15:24,316 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 10:15:24,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 10:15:24,316 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 10:15:24,317 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:15:24" (1/1) ... [2021-12-17 10:15:24,322 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 10:15:24,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:15:24,344 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:15:24,359 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:15:24,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 10:15:24,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 10:15:24,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 10:15:24,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 10:15:24,416 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 10:15:24,417 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 10:15:24,512 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 10:15:24,516 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 10:15:24,516 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 10:15:24,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:15:24 BoogieIcfgContainer [2021-12-17 10:15:24,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 10:15:24,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 10:15:24,519 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 10:15:24,522 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 10:15:24,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 10:15:24" (1/3) ... [2021-12-17 10:15:24,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@699a362a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:15:24, skipping insertion in model container [2021-12-17 10:15:24,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:15:24" (2/3) ... [2021-12-17 10:15:24,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@699a362a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:15:24, skipping insertion in model container [2021-12-17 10:15:24,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:15:24" (3/3) ... [2021-12-17 10:15:24,524 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono3_1.c [2021-12-17 10:15:24,527 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 10:15:24,527 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 10:15:24,585 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 10:15:24,590 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:15:24,603 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 10:15:24,610 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:15:24,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-17 10:15:24,613 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:15:24,614 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-17 10:15:24,614 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:15:24,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:15:24,631 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2021-12-17 10:15:24,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:15:24,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288807008] [2021-12-17 10:15:24,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:15:24,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:15:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:15:24,742 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:15:24,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:15:24,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288807008] [2021-12-17 10:15:24,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288807008] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 10:15:24,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 10:15:24,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 10:15:24,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199930811] [2021-12-17 10:15:24,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 10:15:24,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 10:15:24,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:15:24,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 10:15:24,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 10:15:24,772 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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:15:24,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:15:24,781 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2021-12-17 10:15:24,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 10:15:24,782 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:15:24,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:15:24,787 INFO L225 Difference]: With dead ends: 21 [2021-12-17 10:15:24,788 INFO L226 Difference]: Without dead ends: 9 [2021-12-17 10:15:24,790 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:15:24,794 INFO L933 BasicCegarLoop]: 14 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, 14 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:15:24,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 10:15:24,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2021-12-17 10:15:24,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-12-17 10:15:24,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:15:24,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2021-12-17 10:15:24,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2021-12-17 10:15:24,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:15:24,818 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-12-17 10:15:24,818 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:15:24,818 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2021-12-17 10:15:24,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-17 10:15:24,819 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:15:24,819 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-17 10:15:24,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 10:15:24,820 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:15:24,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:15:24,823 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2021-12-17 10:15:24,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:15:24,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906438981] [2021-12-17 10:15:24,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:15:24,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:15:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:15:24,895 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:15:24,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:15:24,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906438981] [2021-12-17 10:15:24,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906438981] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 10:15:24,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 10:15:24,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 10:15:24,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367331908] [2021-12-17 10:15:24,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 10:15:24,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 10:15:24,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:15:24,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 10:15:24,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 10:15:24,902 INFO L87 Difference]: Start difference. First operand 9 states and 10 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:15:24,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:15:24,920 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2021-12-17 10:15:24,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 10:15:24,921 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:15:24,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:15:24,922 INFO L225 Difference]: With dead ends: 19 [2021-12-17 10:15:24,922 INFO L226 Difference]: Without dead ends: 12 [2021-12-17 10:15:24,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 10:15:24,924 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 10:15:24,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 10:15:24,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-12-17 10:15:24,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2021-12-17 10:15:24,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:15:24,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2021-12-17 10:15:24,929 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2021-12-17 10:15:24,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:15:24,930 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2021-12-17 10:15:24,930 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:15:24,930 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2021-12-17 10:15:24,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-17 10:15:24,931 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:15:24,931 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 10:15:24,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 10:15:24,932 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:15:24,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:15:24,933 INFO L85 PathProgramCache]: Analyzing trace with hash 584467323, now seen corresponding path program 1 times [2021-12-17 10:15:24,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:15:24,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545951550] [2021-12-17 10:15:24,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:15:24,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:15:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:15:25,015 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:15:25,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:15:25,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545951550] [2021-12-17 10:15:25,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545951550] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 10:15:25,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36963006] [2021-12-17 10:15:25,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:15:25,017 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:15:25,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:15:25,018 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:15:25,026 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:15:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:15:25,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-17 10:15:25,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:15:25,161 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:15:25,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 10:15:25,245 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:15:25,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36963006] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 10:15:25,246 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 10:15:25,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 7] total 12 [2021-12-17 10:15:25,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354955932] [2021-12-17 10:15:25,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 10:15:25,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-17 10:15:25,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:15:25,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-17 10:15:25,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-17 10:15:25,248 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:15:25,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:15:25,429 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2021-12-17 10:15:25,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 10:15:25,430 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-17 10:15:25,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:15:25,430 INFO L225 Difference]: With dead ends: 31 [2021-12-17 10:15:25,430 INFO L226 Difference]: Without dead ends: 20 [2021-12-17 10:15:25,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-12-17 10:15:25,431 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 19 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 10:15:25,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 19 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 10:15:25,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-17 10:15:25,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2021-12-17 10:15:25,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:15:25,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2021-12-17 10:15:25,434 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 9 [2021-12-17 10:15:25,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:15:25,435 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2021-12-17 10:15:25,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:15:25,435 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2021-12-17 10:15:25,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-17 10:15:25,436 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:15:25,436 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 10:15:25,466 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:15:25,652 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:15:25,652 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:15:25,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:15:25,653 INFO L85 PathProgramCache]: Analyzing trace with hash 329880921, now seen corresponding path program 1 times [2021-12-17 10:15:25,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:15:25,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809960341] [2021-12-17 10:15:25,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:15:25,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:15:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:15:25,723 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:15:25,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:15:25,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809960341] [2021-12-17 10:15:25,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809960341] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 10:15:25,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642491003] [2021-12-17 10:15:25,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:15:25,724 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:15:25,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:15:25,738 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:15:25,751 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:15:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:15:25,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-17 10:15:25,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:15:25,832 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 10:15:25,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 10:15:25,923 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 10:15:25,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642491003] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 10:15:25,924 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 10:15:25,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 12 [2021-12-17 10:15:25,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934963500] [2021-12-17 10:15:25,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 10:15:25,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-17 10:15:25,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:15:25,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-17 10:15:25,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-12-17 10:15:25,929 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 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:15:26,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:15:26,123 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2021-12-17 10:15:26,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-17 10:15:26,124 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 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 15 [2021-12-17 10:15:26,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:15:26,124 INFO L225 Difference]: With dead ends: 56 [2021-12-17 10:15:26,124 INFO L226 Difference]: Without dead ends: 43 [2021-12-17 10:15:26,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2021-12-17 10:15:26,126 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 10:15:26,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 44 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 10:15:26,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-12-17 10:15:26,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2021-12-17 10:15:26,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:15:26,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2021-12-17 10:15:26,131 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 15 [2021-12-17 10:15:26,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:15:26,131 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2021-12-17 10:15:26,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 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:15:26,131 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2021-12-17 10:15:26,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-17 10:15:26,131 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:15:26,132 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1] [2021-12-17 10:15:26,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 10:15:26,332 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:15:26,332 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:15:26,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:15:26,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1412883461, now seen corresponding path program 2 times [2021-12-17 10:15:26,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:15:26,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376086277] [2021-12-17 10:15:26,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:15:26,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:15:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:15:26,398 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 10:15:26,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:15:26,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376086277] [2021-12-17 10:15:26,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376086277] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 10:15:26,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710769864] [2021-12-17 10:15:26,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 10:15:26,399 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:15:26,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:15:26,400 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:15:26,401 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:15:26,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 10:15:26,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 10:15:26,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-17 10:15:26,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:15:26,501 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 10:15:26,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 10:15:26,619 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 10:15:26,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710769864] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 10:15:26,620 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 10:15:26,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 15 [2021-12-17 10:15:26,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298611172] [2021-12-17 10:15:26,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 10:15:26,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-17 10:15:26,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:15:26,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-17 10:15:26,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-12-17 10:15:26,621 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 0 states have call successors, (0), 0 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:26,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:15:26,985 INFO L93 Difference]: Finished difference Result 111 states and 139 transitions. [2021-12-17 10:15:26,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-17 10:15:26,985 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-17 10:15:26,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:15:26,986 INFO L225 Difference]: With dead ends: 111 [2021-12-17 10:15:26,986 INFO L226 Difference]: Without dead ends: 81 [2021-12-17 10:15:26,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=789, Unknown=0, NotChecked=0, Total=992 [2021-12-17 10:15:26,987 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 18 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 10:15:26,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 60 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 10:15:26,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-17 10:15:26,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 54. [2021-12-17 10:15:26,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 53 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:26,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2021-12-17 10:15:26,994 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 21 [2021-12-17 10:15:26,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:15:26,995 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2021-12-17 10:15:26,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 0 states have call successors, (0), 0 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:26,995 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2021-12-17 10:15:26,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-17 10:15:26,996 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:15:26,996 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1] [2021-12-17 10:15:27,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-17 10:15:27,211 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:15:27,212 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:15:27,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:15:27,212 INFO L85 PathProgramCache]: Analyzing trace with hash -922085543, now seen corresponding path program 3 times [2021-12-17 10:15:27,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:15:27,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69640642] [2021-12-17 10:15:27,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:15:27,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:15:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:15:27,291 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 37 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-17 10:15:27,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:15:27,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69640642] [2021-12-17 10:15:27,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69640642] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 10:15:27,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905144438] [2021-12-17 10:15:27,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 10:15:27,293 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:15:27,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:15:27,294 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:15:27,295 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:15:27,346 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-12-17 10:15:27,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 10:15:27,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-17 10:15:27,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:15:27,518 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-17 10:15:27,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 10:15:27,826 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-17 10:15:27,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905144438] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 10:15:27,827 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 10:15:27,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2021-12-17 10:15:27,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617570300] [2021-12-17 10:15:27,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 10:15:27,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-17 10:15:27,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:15:27,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-17 10:15:27,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2021-12-17 10:15:27,829 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 0 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:29,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:15:29,308 INFO L93 Difference]: Finished difference Result 115 states and 156 transitions. [2021-12-17 10:15:29,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-17 10:15:29,309 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 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 27 [2021-12-17 10:15:29,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:15:29,311 INFO L225 Difference]: With dead ends: 115 [2021-12-17 10:15:29,311 INFO L226 Difference]: Without dead ends: 77 [2021-12-17 10:15:29,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=334, Invalid=596, Unknown=0, NotChecked=0, Total=930 [2021-12-17 10:15:29,312 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 98 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 10:15:29,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 34 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-17 10:15:29,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-17 10:15:29,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 52. [2021-12-17 10:15:29,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 51 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:15:29,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2021-12-17 10:15:29,322 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 27 [2021-12-17 10:15:29,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:15:29,323 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2021-12-17 10:15:29,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 0 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:29,324 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2021-12-17 10:15:29,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-17 10:15:29,325 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:15:29,326 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 9, 6, 1, 1, 1, 1, 1, 1] [2021-12-17 10:15:29,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 10:15:29,532 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:15:29,532 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:15:29,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:15:29,533 INFO L85 PathProgramCache]: Analyzing trace with hash -522566631, now seen corresponding path program 4 times [2021-12-17 10:15:29,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:15:29,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443807189] [2021-12-17 10:15:29,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:15:29,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:15:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:15:29,652 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 173 proven. 57 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-12-17 10:15:29,653 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:15:29,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443807189] [2021-12-17 10:15:29,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443807189] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 10:15:29,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63986776] [2021-12-17 10:15:29,653 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 10:15:29,653 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:15:29,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:15:29,655 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:15:29,656 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:15:29,713 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 10:15:29,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 10:15:29,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-17 10:15:29,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:15:29,938 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 313 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-17 10:15:29,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 10:15:30,228 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 313 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-17 10:15:30,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63986776] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 10:15:30,229 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 10:15:30,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 30 [2021-12-17 10:15:30,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366729068] [2021-12-17 10:15:30,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 10:15:30,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-17 10:15:30,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:15:30,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-17 10:15:30,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2021-12-17 10:15:30,231 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 30 states, 30 states have (on average 3.466666666666667) internal successors, (104), 30 states have internal predecessors, (104), 0 states have call successors, (0), 0 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:40,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:15:40,320 INFO L93 Difference]: Finished difference Result 1187 states and 1366 transitions. [2021-12-17 10:15:40,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2021-12-17 10:15:40,320 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.466666666666667) internal successors, (104), 30 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-12-17 10:15:40,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:15:40,324 INFO L225 Difference]: With dead ends: 1187 [2021-12-17 10:15:40,330 INFO L226 Difference]: Without dead ends: 1152 [2021-12-17 10:15:40,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6292 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=3209, Invalid=15151, Unknown=0, NotChecked=0, Total=18360 [2021-12-17 10:15:40,337 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 23 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-17 10:15:40,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 101 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-17 10:15:40,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2021-12-17 10:15:40,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 814. [2021-12-17 10:15:40,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 813 states have (on average 1.1832718327183271) internal successors, (962), 813 states have internal predecessors, (962), 0 states have call successors, (0), 0 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:40,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 962 transitions. [2021-12-17 10:15:40,407 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 962 transitions. Word has length 51 [2021-12-17 10:15:40,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:15:40,407 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 962 transitions. [2021-12-17 10:15:40,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.466666666666667) internal successors, (104), 30 states have internal predecessors, (104), 0 states have call successors, (0), 0 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:40,407 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 962 transitions. [2021-12-17 10:15:40,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-17 10:15:40,414 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:15:40,414 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 10, 7, 1, 1, 1, 1, 1, 1] [2021-12-17 10:15:40,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-17 10:15:40,631 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:15:40,632 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:15:40,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:15:40,632 INFO L85 PathProgramCache]: Analyzing trace with hash 617649339, now seen corresponding path program 5 times [2021-12-17 10:15:40,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:15:40,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870230342] [2021-12-17 10:15:40,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:15:40,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:15:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:15:40,752 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 222 proven. 77 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-12-17 10:15:40,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:15:40,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870230342] [2021-12-17 10:15:40,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870230342] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 10:15:40,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002321212] [2021-12-17 10:15:40,753 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 10:15:40,753 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:15:40,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:15:40,754 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:15:40,802 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:15:41,014 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2021-12-17 10:15:41,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 10:15:41,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-17 10:15:41,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:15:41,220 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 405 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-17 10:15:41,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 10:15:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 405 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-17 10:15:41,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002321212] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 10:15:41,591 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 10:15:41,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 33 [2021-12-17 10:15:41,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789853703] [2021-12-17 10:15:41,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 10:15:41,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-17 10:15:41,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:15:41,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-17 10:15:41,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=873, Unknown=0, NotChecked=0, Total=1056 [2021-12-17 10:15:41,592 INFO L87 Difference]: Start difference. First operand 814 states and 962 transitions. Second operand has 33 states, 33 states have (on average 3.484848484848485) internal successors, (115), 33 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:16:00,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:16:00,920 INFO L93 Difference]: Finished difference Result 3117 states and 3627 transitions. [2021-12-17 10:16:00,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2021-12-17 10:16:00,920 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.484848484848485) internal successors, (115), 33 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) Word has length 57 [2021-12-17 10:16:00,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:16:00,926 INFO L225 Difference]: With dead ends: 3117 [2021-12-17 10:16:00,926 INFO L226 Difference]: Without dead ends: 2477 [2021-12-17 10:16:00,935 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10345 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=4807, Invalid=23585, Unknown=0, NotChecked=0, Total=28392 [2021-12-17 10:16:00,936 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 30 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-17 10:16:00,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 132 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-12-17 10:16:00,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2021-12-17 10:16:00,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 1128. [2021-12-17 10:16:00,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1127 states have (on average 1.18189884649512) internal successors, (1332), 1127 states have internal predecessors, (1332), 0 states have call successors, (0), 0 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:16:00,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1332 transitions. [2021-12-17 10:16:00,988 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1332 transitions. Word has length 57 [2021-12-17 10:16:00,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:16:00,989 INFO L470 AbstractCegarLoop]: Abstraction has 1128 states and 1332 transitions. [2021-12-17 10:16:00,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.484848484848485) internal successors, (115), 33 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:16:00,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1332 transitions. [2021-12-17 10:16:00,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-17 10:16:00,990 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:16:00,991 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 9, 9, 1, 1, 1, 1, 1, 1] [2021-12-17 10:16:00,996 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:16:01,195 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:16:01,195 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:16:01,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:16:01,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1480398352, now seen corresponding path program 6 times [2021-12-17 10:16:01,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:16:01,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386679956] [2021-12-17 10:16:01,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:16:01,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:16:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:16:01,352 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 251 proven. 126 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-12-17 10:16:01,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:16:01,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386679956] [2021-12-17 10:16:01,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386679956] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 10:16:01,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305156701] [2021-12-17 10:16:01,353 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-17 10:16:01,353 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:16:01,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:16:01,354 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:16:01,355 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:16:01,732 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2021-12-17 10:16:01,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 10:16:01,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-17 10:16:01,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:16:02,116 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 233 proven. 187 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-12-17 10:16:02,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 10:16:03,527 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 233 proven. 187 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-12-17 10:16:03,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305156701] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 10:16:03,528 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 10:16:03,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 16] total 40 [2021-12-17 10:16:03,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939929923] [2021-12-17 10:16:03,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 10:16:03,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-17 10:16:03,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:16:03,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-17 10:16:03,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=1090, Unknown=0, NotChecked=0, Total=1560 [2021-12-17 10:16:03,532 INFO L87 Difference]: Start difference. First operand 1128 states and 1332 transitions. Second operand has 40 states, 40 states have (on average 2.85) internal successors, (114), 40 states have internal predecessors, (114), 0 states have call successors, (0), 0 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:17:21,217 WARN L227 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 10:17:21,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:17:21,219 INFO L93 Difference]: Finished difference Result 1408 states and 1696 transitions. [2021-12-17 10:17:21,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-12-17 10:17:21,219 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.85) internal successors, (114), 40 states have internal predecessors, (114), 0 states have call successors, (0), 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 60 [2021-12-17 10:17:21,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:17:21,220 INFO L225 Difference]: With dead ends: 1408 [2021-12-17 10:17:21,220 INFO L226 Difference]: Without dead ends: 317 [2021-12-17 10:17:21,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1327 ImplicationChecksByTransitivity, 77.9s TimeCoverageRelationStatistics Valid=2476, Invalid=4833, Unknown=1, NotChecked=0, Total=7310 [2021-12-17 10:17:21,225 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 352 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-17 10:17:21,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 63 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-17 10:17:21,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-12-17 10:17:21,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 115. [2021-12-17 10:17:21,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.131578947368421) internal successors, (129), 114 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:17:21,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2021-12-17 10:17:21,232 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 60 [2021-12-17 10:17:21,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:17:21,232 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2021-12-17 10:17:21,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.85) internal successors, (114), 40 states have internal predecessors, (114), 0 states have call successors, (0), 0 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:17:21,233 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2021-12-17 10:17:21,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-12-17 10:17:21,233 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:17:21,234 INFO L514 BasicCegarLoop]: trace histogram [36, 36, 25, 11, 1, 1, 1, 1, 1, 1] [2021-12-17 10:17:21,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-17 10:17:21,438 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:17:21,438 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:17:21,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:17:21,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1998649776, now seen corresponding path program 7 times [2021-12-17 10:17:21,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:17:21,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698321354] [2021-12-17 10:17:21,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:17:21,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:17:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:17:21,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 863 proven. 187 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2021-12-17 10:17:21,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:17:21,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698321354] [2021-12-17 10:17:21,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698321354] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 10:17:21,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290756368] [2021-12-17 10:17:21,633 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-17 10:17:21,633 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:17:21,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:17:21,655 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:17:21,680 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:17:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:17:21,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-17 10:17:21,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:17:22,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 899 proven. 805 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2021-12-17 10:17:22,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 10:17:23,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 899 proven. 805 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2021-12-17 10:17:23,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290756368] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 10:17:23,887 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 10:17:23,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 26, 27] total 52 [2021-12-17 10:17:23,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664455242] [2021-12-17 10:17:23,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 10:17:23,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-12-17 10:17:23,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:17:23,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-12-17 10:17:23,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=739, Invalid=1913, Unknown=0, NotChecked=0, Total=2652 [2021-12-17 10:17:23,889 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand has 52 states, 52 states have (on average 2.980769230769231) internal successors, (155), 52 states have internal predecessors, (155), 0 states have call successors, (0), 0 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:17:40,058 WARN L227 SmtUtils]: Spent 8.34s on a formula simplification. DAG size of input: 145 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 10:18:00,490 WARN L227 SmtUtils]: Spent 8.22s on a formula simplification. DAG size of input: 139 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 10:18:10,954 WARN L227 SmtUtils]: Spent 5.26s on a formula simplification. DAG size of input: 133 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 10:20:13,912 WARN L227 SmtUtils]: Spent 12.73s on a formula simplification. DAG size of input: 147 DAG size of output: 15 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 10:20:13,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:20:13,913 INFO L93 Difference]: Finished difference Result 307 states and 372 transitions. [2021-12-17 10:20:13,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-12-17 10:20:13,913 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.980769230769231) internal successors, (155), 52 states have internal predecessors, (155), 0 states have call successors, (0), 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 114 [2021-12-17 10:20:13,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:20:13,914 INFO L225 Difference]: With dead ends: 307 [2021-12-17 10:20:13,914 INFO L226 Difference]: Without dead ends: 226 [2021-12-17 10:20:13,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 170.8s TimeCoverageRelationStatistics Valid=1987, Invalid=3712, Unknown=1, NotChecked=0, Total=5700 [2021-12-17 10:20:13,915 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 527 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-17 10:20:13,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [527 Valid, 60 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1488 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-17 10:20:13,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-12-17 10:20:13,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2021-12-17 10:20:13,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.0666666666666667) internal successors, (240), 225 states have internal predecessors, (240), 0 states have call successors, (0), 0 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:20:13,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 240 transitions. [2021-12-17 10:20:13,934 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 240 transitions. Word has length 114 [2021-12-17 10:20:13,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:20:13,936 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 240 transitions. [2021-12-17 10:20:13,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.980769230769231) internal successors, (155), 52 states have internal predecessors, (155), 0 states have call successors, (0), 0 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:20:13,936 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 240 transitions. [2021-12-17 10:20:13,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-12-17 10:20:13,941 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:20:13,941 INFO L514 BasicCegarLoop]: trace histogram [73, 73, 48, 25, 1, 1, 1, 1, 1, 1] [2021-12-17 10:20:13,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-17 10:20:14,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-17 10:20:14,159 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:20:14,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:20:14,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1880161223, now seen corresponding path program 8 times [2021-12-17 10:20:14,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:20:14,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605407636] [2021-12-17 10:20:14,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:20:14,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:20:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:20:15,445 INFO L134 CoverageAnalysis]: Checked inductivity of 7957 backedges. 3601 proven. 3480 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2021-12-17 10:20:15,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:20:15,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605407636] [2021-12-17 10:20:15,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605407636] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 10:20:15,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131475553] [2021-12-17 10:20:15,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 10:20:15,446 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:20:15,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:20:15,447 INFO L229 MonitoredProcess]: Starting monitored process 10 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:20:15,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-17 10:20:15,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 10:20:15,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 10:20:15,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 151 conjunts are in the unsatisfiable core [2021-12-17 10:20:15,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:20:18,028 INFO L134 CoverageAnalysis]: Checked inductivity of 7957 backedges. 0 proven. 7883 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2021-12-17 10:20:18,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 10:20:22,627 INFO L134 CoverageAnalysis]: Checked inductivity of 7957 backedges. 0 proven. 7883 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2021-12-17 10:20:22,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131475553] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 10:20:22,628 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 10:20:22,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 52, 52] total 150 [2021-12-17 10:20:22,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740842784] [2021-12-17 10:20:22,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 10:20:22,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 150 states [2021-12-17 10:20:22,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:20:22,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2021-12-17 10:20:22,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2720, Invalid=19630, Unknown=0, NotChecked=0, Total=22350 [2021-12-17 10:20:22,634 INFO L87 Difference]: Start difference. First operand 226 states and 240 transitions. Second operand has 150 states, 150 states have (on average 3.3466666666666667) internal successors, (502), 150 states have internal predecessors, (502), 0 states have call successors, (0), 0 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:20:31,964 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 9) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967295) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967288) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 20) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 3) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967272) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 15) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967293) 4294967296))) (not (= 0 (mod |c_ULTIMATE.start_main_~y~0#1| 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 21) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 8) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 1) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967278) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 16) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967282) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967284) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 2) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967294) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967285) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967283) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 17) 4294967296))) (<= |c_ULTIMATE.start_main_~x~0#1| 48) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 7) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967273) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 13) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 6) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967291) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 23) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 18) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967287) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967290) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967271) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967276) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967286) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 5) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967289) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967275) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967280) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 19) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967292) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 14) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 22) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967277) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 11) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 12) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967279) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967281) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967274) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 10) 4294967296))) (< 0 (+ (div |c_ULTIMATE.start_main_~x~0#1| 4294967296) 1))) is different from false [2021-12-17 10:20:33,977 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967273) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 13) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 6) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967291) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 9) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967295) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 18) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967287) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967290) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967288) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967271) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967276) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 20) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 5) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 3) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967286) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967289) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967272) 4294967296))) (not (= 0 (mod |c_ULTIMATE.start_main_~y~0#1| 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 15) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 21) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967293) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967275) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967280) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 8) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967278) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 1) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 16) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967282) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 19) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967284) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 2) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967294) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967285) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967292) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967283) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 14) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 22) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967277) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 11) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 17) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 12) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967279) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967281) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967274) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 10) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 7) 4294967296)))) is different from false [2021-12-17 10:23:19,558 WARN L227 SmtUtils]: Spent 43.95s on a formula simplification that was a NOOP. DAG size: 127 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 10:23:21,565 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967273) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 13) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 6) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967291) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 9) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967295) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 18) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967287) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967290) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967288) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967271) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967276) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 20) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 5) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 3) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967286) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967289) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967272) 4294967296))) (not (= 0 (mod |c_ULTIMATE.start_main_~y~0#1| 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 15) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 21) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967293) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967275) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967280) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 8) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967278) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 1) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 16) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967282) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 19) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967284) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 2) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967294) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967285) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967292) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967283) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 14) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967277) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 11) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 17) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 12) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967279) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967281) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967274) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 10) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 7) 4294967296)))) is different from false [2021-12-17 10:23:24,242 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 10:23:26,259 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967273) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967284) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967294) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967285) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967292) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967283) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967277) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967291) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967295) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967287) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967290) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967288) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967279) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967276) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967281) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967286) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967289) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967274) 4294967296))) (not (= 0 (mod |c_ULTIMATE.start_main_~y~0#1| 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967293) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967275) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967280) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967278) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967282) 4294967296)))) is different from false [2021-12-17 10:23:28,266 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967273) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 13) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 6) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967291) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 9) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967295) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 18) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967287) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967290) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967288) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967271) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967276) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 20) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 5) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 3) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967286) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967289) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967272) 4294967296))) (not (= 0 (mod |c_ULTIMATE.start_main_~y~0#1| 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 15) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967293) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967275) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967280) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 8) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967278) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 1) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 16) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967282) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 19) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967284) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 2) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967294) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967285) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967292) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967283) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 14) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967277) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 11) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 17) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 12) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967279) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967281) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967274) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 10) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 7) 4294967296)))) is different from false [2021-12-17 10:26:14,520 WARN L227 SmtUtils]: Spent 42.78s on a formula simplification that was a NOOP. DAG size: 117 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 10:26:16,527 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967273) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 13) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 6) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967291) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 9) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967295) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 18) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967287) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967290) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967288) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967271) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967276) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 5) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 3) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967286) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967289) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967272) 4294967296))) (not (= 0 (mod |c_ULTIMATE.start_main_~y~0#1| 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 15) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967293) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967275) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967280) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 8) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967278) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 1) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 16) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967282) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 19) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967284) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 2) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967294) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967285) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967292) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967283) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 14) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967277) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 11) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 17) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 12) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967279) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967281) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967274) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 10) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 7) 4294967296)))) is different from false [2021-12-17 10:28:26,161 WARN L227 SmtUtils]: Spent 23.21s on a formula simplification that was a NOOP. DAG size: 112 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 10:28:28,166 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967273) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 13) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 6) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967291) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 9) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967295) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 18) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967287) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967290) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967288) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967271) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967276) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 5) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 3) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967286) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967289) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967272) 4294967296))) (not (= 0 (mod |c_ULTIMATE.start_main_~y~0#1| 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 15) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967293) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967275) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967280) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 8) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967278) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 1) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 16) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967282) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967284) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 2) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967294) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967285) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967292) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967283) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 14) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967277) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 11) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 17) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 12) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967279) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967281) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967274) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 10) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 7) 4294967296)))) is different from false [2021-12-17 10:28:30,175 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967284) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967294) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967285) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967292) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967283) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967277) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967291) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967295) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967287) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967290) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967288) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967279) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967276) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967281) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967286) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967289) 4294967296))) (not (= 0 (mod |c_ULTIMATE.start_main_~y~0#1| 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967293) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967280) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967278) 4294967296))) (not (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 4294967282) 4294967296)))) is different from false Killed by 15