./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-acceleration/nested_1-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-acceleration/nested_1-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8828f6ff39cd2bcfba4fe3d04f0119d60137bcad91eabef2e2b840cbd0802b98 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 09:49:07,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 09:49:07,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 09:49:07,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 09:49:07,904 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 09:49:07,907 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 09:49:07,908 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 09:49:07,910 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 09:49:07,911 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 09:49:07,914 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 09:49:07,915 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 09:49:07,916 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 09:49:07,916 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 09:49:07,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 09:49:07,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 09:49:07,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 09:49:07,925 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 09:49:07,926 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 09:49:07,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 09:49:07,932 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 09:49:07,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 09:49:07,934 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 09:49:07,935 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 09:49:07,935 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 09:49:07,940 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 09:49:07,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 09:49:07,941 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 09:49:07,942 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 09:49:07,943 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 09:49:07,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 09:49:07,943 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 09:49:07,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 09:49:07,945 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 09:49:07,946 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 09:49:07,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 09:49:07,947 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 09:49:07,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 09:49:07,947 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 09:49:07,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 09:49:07,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 09:49:07,948 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 09:49:07,949 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 09:49:07,980 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 09:49:07,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 09:49:07,981 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 09:49:07,981 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 09:49:07,982 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 09:49:07,982 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 09:49:07,982 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 09:49:07,982 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 09:49:07,983 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 09:49:07,983 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 09:49:07,983 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 09:49:07,984 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 09:49:07,984 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 09:49:07,984 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 09:49:07,984 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 09:49:07,984 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 09:49:07,984 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 09:49:07,985 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 09:49:07,985 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 09:49:07,985 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 09:49:07,985 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 09:49:07,985 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 09:49:07,985 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 09:49:07,986 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 09:49:07,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 09:49:07,986 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 09:49:07,986 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 09:49:07,986 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 09:49:07,986 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 09:49:07,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 09:49:07,987 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 09:49:07,987 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 09:49:07,987 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 09:49:07,987 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 09:49:07,987 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 -> 8828f6ff39cd2bcfba4fe3d04f0119d60137bcad91eabef2e2b840cbd0802b98 [2021-12-17 09:49:08,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 09:49:08,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 09:49:08,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 09:49:08,187 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 09:49:08,187 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 09:49:08,188 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/nested_1-2.c [2021-12-17 09:49:08,244 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd5530ef0/111169bcfcb7460f8a8d00b6a30f9f07/FLAGbd54d9135 [2021-12-17 09:49:08,574 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 09:49:08,575 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/nested_1-2.c [2021-12-17 09:49:08,578 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd5530ef0/111169bcfcb7460f8a8d00b6a30f9f07/FLAGbd54d9135 [2021-12-17 09:49:08,588 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd5530ef0/111169bcfcb7460f8a8d00b6a30f9f07 [2021-12-17 09:49:08,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 09:49:08,591 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 09:49:08,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 09:49:08,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 09:49:08,594 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 09:49:08,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:49:08" (1/1) ... [2021-12-17 09:49:08,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63353d2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:49:08, skipping insertion in model container [2021-12-17 09:49:08,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:49:08" (1/1) ... [2021-12-17 09:49:08,599 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 09:49:08,606 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 09:49:08,711 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/loop-acceleration/nested_1-2.c[322,335] [2021-12-17 09:49:08,722 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 09:49:08,727 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 09:49:08,736 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/loop-acceleration/nested_1-2.c[322,335] [2021-12-17 09:49:08,739 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 09:49:08,747 INFO L208 MainTranslator]: Completed translation [2021-12-17 09:49:08,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:49:08 WrapperNode [2021-12-17 09:49:08,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 09:49:08,749 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 09:49:08,749 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 09:49:08,749 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 09:49:08,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:49:08" (1/1) ... [2021-12-17 09:49:08,760 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:49:08" (1/1) ... [2021-12-17 09:49:08,771 INFO L137 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2021-12-17 09:49:08,772 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 09:49:08,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 09:49:08,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 09:49:08,773 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 09:49:08,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:49:08" (1/1) ... [2021-12-17 09:49:08,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:49:08" (1/1) ... [2021-12-17 09:49:08,778 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:49:08" (1/1) ... [2021-12-17 09:49:08,779 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:49:08" (1/1) ... [2021-12-17 09:49:08,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:49:08" (1/1) ... [2021-12-17 09:49:08,782 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:49:08" (1/1) ... [2021-12-17 09:49:08,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:49:08" (1/1) ... [2021-12-17 09:49:08,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 09:49:08,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 09:49:08,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 09:49:08,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 09:49:08,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:49:08" (1/1) ... [2021-12-17 09:49:08,792 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 09:49:08,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:49:08,811 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 09:49:08,815 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 09:49:08,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 09:49:08,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 09:49:08,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 09:49:08,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 09:49:08,884 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 09:49:08,885 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 09:49:08,948 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 09:49:08,951 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 09:49:08,951 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-17 09:49:08,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:49:08 BoogieIcfgContainer [2021-12-17 09:49:08,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 09:49:08,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 09:49:08,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 09:49:08,956 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 09:49:08,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 09:49:08" (1/3) ... [2021-12-17 09:49:08,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40cd4972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:49:08, skipping insertion in model container [2021-12-17 09:49:08,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:49:08" (2/3) ... [2021-12-17 09:49:08,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40cd4972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:49:08, skipping insertion in model container [2021-12-17 09:49:08,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:49:08" (3/3) ... [2021-12-17 09:49:08,958 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_1-2.c [2021-12-17 09:49:08,961 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 09:49:08,961 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 09:49:08,988 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 09:49:08,993 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 09:49:08,993 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 09:49:09,001 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 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 09:49:09,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-17 09:49:09,004 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:49:09,005 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-17 09:49:09,005 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:49:09,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:49:09,009 INFO L85 PathProgramCache]: Analyzing trace with hash 889646744, now seen corresponding path program 1 times [2021-12-17 09:49:09,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:49:09,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983414532] [2021-12-17 09:49:09,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:49:09,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:49:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:49:09,189 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 09:49:09,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:49:09,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983414532] [2021-12-17 09:49:09,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983414532] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:49:09,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 09:49:09,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 09:49:09,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285109532] [2021-12-17 09:49:09,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:49:09,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 09:49:09,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:49:09,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 09:49:09,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 09:49:09,228 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 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) 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 09:49:09,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:49:09,243 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2021-12-17 09:49:09,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 09:49:09,245 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 09:49:09,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:49:09,252 INFO L225 Difference]: With dead ends: 27 [2021-12-17 09:49:09,252 INFO L226 Difference]: Without dead ends: 12 [2021-12-17 09:49:09,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 09:49:09,257 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:49:09,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 21 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:49:09,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-12-17 09:49:09,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2021-12-17 09:49:09,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:49:09,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2021-12-17 09:49:09,277 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2021-12-17 09:49:09,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:49:09,278 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-12-17 09:49:09,278 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 09:49:09,278 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2021-12-17 09:49:09,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-17 09:49:09,278 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:49:09,279 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:49:09,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 09:49:09,279 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:49:09,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:49:09,280 INFO L85 PathProgramCache]: Analyzing trace with hash 704531011, now seen corresponding path program 1 times [2021-12-17 09:49:09,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:49:09,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546533250] [2021-12-17 09:49:09,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:49:09,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:49:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:49:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:49:09,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:49:09,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546533250] [2021-12-17 09:49:09,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546533250] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 09:49:09,308 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 09:49:09,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 09:49:09,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005096919] [2021-12-17 09:49:09,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 09:49:09,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 09:49:09,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:49:09,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 09:49:09,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 09:49:09,311 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:49:09,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:49:09,317 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2021-12-17 09:49:09,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 09:49:09,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-17 09:49:09,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:49:09,318 INFO L225 Difference]: With dead ends: 18 [2021-12-17 09:49:09,318 INFO L226 Difference]: Without dead ends: 11 [2021-12-17 09:49:09,319 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 09:49:09,320 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:49:09,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:49:09,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2021-12-17 09:49:09,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2021-12-17 09:49:09,323 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 09:49:09,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2021-12-17 09:49:09,323 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2021-12-17 09:49:09,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:49:09,323 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2021-12-17 09:49:09,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:49:09,324 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2021-12-17 09:49:09,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-17 09:49:09,324 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:49:09,324 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 09:49:09,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 09:49:09,325 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:49:09,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:49:09,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1982141191, now seen corresponding path program 1 times [2021-12-17 09:49:09,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:49:09,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621052748] [2021-12-17 09:49:09,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:49:09,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:49:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:49:09,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 09:49:09,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:49:09,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621052748] [2021-12-17 09:49:09,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621052748] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:49:09,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797400144] [2021-12-17 09:49:09,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:49:09,367 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:49:09,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:49:09,385 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 09:49:09,407 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 09:49:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:49:09,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 09:49:09,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:49:09,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:49:09,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:49:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 09:49:09,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797400144] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:49:09,499 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:49:09,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2021-12-17 09:49:09,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733081190] [2021-12-17 09:49:09,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:49:09,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 09:49:09,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:49:09,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 09:49:09,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-17 09:49:09,501 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:49:09,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:49:09,621 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2021-12-17 09:49:09,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 09:49:09,622 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-17 09:49:09,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:49:09,623 INFO L225 Difference]: With dead ends: 35 [2021-12-17 09:49:09,623 INFO L226 Difference]: Without dead ends: 27 [2021-12-17 09:49:09,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2021-12-17 09:49:09,625 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:49:09,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 30 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:49:09,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-17 09:49:09,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-17 09:49:09,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 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 09:49:09,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-17 09:49:09,630 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 10 [2021-12-17 09:49:09,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:49:09,630 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-17 09:49:09,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:49:09,631 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-17 09:49:09,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-17 09:49:09,636 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:49:09,636 INFO L514 BasicCegarLoop]: trace histogram [8, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2021-12-17 09:49:09,656 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 09:49:09,851 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 09:49:09,852 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:49:09,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:49:09,853 INFO L85 PathProgramCache]: Analyzing trace with hash -738026408, now seen corresponding path program 2 times [2021-12-17 09:49:09,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:49:09,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681519379] [2021-12-17 09:49:09,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:49:09,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:49:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:49:09,929 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 31 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-12-17 09:49:09,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:49:09,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681519379] [2021-12-17 09:49:09,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681519379] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:49:09,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649293611] [2021-12-17 09:49:09,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:49:09,931 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:49:09,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:49:09,932 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 09:49:09,934 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 09:49:09,972 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:49:09,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:49:09,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-17 09:49:09,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:49:10,094 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-17 09:49:10,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:49:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-12-17 09:49:10,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649293611] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:49:10,199 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:49:10,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 5] total 13 [2021-12-17 09:49:10,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408516294] [2021-12-17 09:49:10,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:49:10,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-17 09:49:10,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:49:10,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-17 09:49:10,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-12-17 09:49:10,206 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 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 09:49:10,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:49:10,477 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2021-12-17 09:49:10,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-17 09:49:10,477 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-17 09:49:10,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:49:10,478 INFO L225 Difference]: With dead ends: 71 [2021-12-17 09:49:10,478 INFO L226 Difference]: Without dead ends: 48 [2021-12-17 09:49:10,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=1004, Unknown=0, NotChecked=0, Total=1190 [2021-12-17 09:49:10,479 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:49:10,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 61 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 09:49:10,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-12-17 09:49:10,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2021-12-17 09:49:10,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 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 09:49:10,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2021-12-17 09:49:10,485 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 26 [2021-12-17 09:49:10,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:49:10,486 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2021-12-17 09:49:10,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 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 09:49:10,486 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2021-12-17 09:49:10,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-17 09:49:10,486 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:49:10,487 INFO L514 BasicCegarLoop]: trace histogram [15, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2021-12-17 09:49:10,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-17 09:49:10,703 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 09:49:10,704 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:49:10,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:49:10,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1025867325, now seen corresponding path program 3 times [2021-12-17 09:49:10,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:49:10,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150499699] [2021-12-17 09:49:10,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:49:10,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:49:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:49:10,774 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2021-12-17 09:49:10,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:49:10,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150499699] [2021-12-17 09:49:10,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150499699] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:49:10,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899465401] [2021-12-17 09:49:10,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 09:49:10,775 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:49:10,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:49:10,793 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 09:49:10,794 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 09:49:10,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-17 09:49:10,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:49:10,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-17 09:49:10,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:49:10,923 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 73 proven. 6 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-17 09:49:10,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:49:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 73 proven. 6 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-17 09:49:10,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899465401] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:49:10,994 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:49:10,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2021-12-17 09:49:10,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522474072] [2021-12-17 09:49:10,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:49:10,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 09:49:10,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:49:10,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 09:49:10,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2021-12-17 09:49:10,996 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:49:11,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:49:11,087 INFO L93 Difference]: Finished difference Result 92 states and 126 transitions. [2021-12-17 09:49:11,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 09:49:11,088 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-17 09:49:11,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:49:11,089 INFO L225 Difference]: With dead ends: 92 [2021-12-17 09:49:11,089 INFO L226 Difference]: Without dead ends: 62 [2021-12-17 09:49:11,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2021-12-17 09:49:11,090 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 09:49:11,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 09:49:11,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-17 09:49:11,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-12-17 09:49:11,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.098360655737705) internal successors, (67), 61 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 09:49:11,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2021-12-17 09:49:11,099 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 36 [2021-12-17 09:49:11,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:49:11,099 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2021-12-17 09:49:11,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:49:11,099 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2021-12-17 09:49:11,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-17 09:49:11,100 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:49:11,100 INFO L514 BasicCegarLoop]: trace histogram [40, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2021-12-17 09:49:11,134 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 09:49:11,301 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 09:49:11,301 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:49:11,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:49:11,302 INFO L85 PathProgramCache]: Analyzing trace with hash 251588099, now seen corresponding path program 4 times [2021-12-17 09:49:11,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:49:11,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621815940] [2021-12-17 09:49:11,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:49:11,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:49:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:49:11,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1015 backedges. 329 proven. 36 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2021-12-17 09:49:11,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:49:11,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621815940] [2021-12-17 09:49:11,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621815940] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:49:11,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726285691] [2021-12-17 09:49:11,472 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 09:49:11,473 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:49:11,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:49:11,489 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 09:49:11,490 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 09:49:11,581 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 09:49:11,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:49:11,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-17 09:49:11,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:49:11,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1015 backedges. 663 proven. 36 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2021-12-17 09:49:11,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:49:11,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1015 backedges. 663 proven. 36 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2021-12-17 09:49:11,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726285691] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:49:11,915 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:49:11,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2021-12-17 09:49:11,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954162543] [2021-12-17 09:49:11,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:49:11,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-17 09:49:11,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:49:11,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-17 09:49:11,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2021-12-17 09:49:11,916 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 21 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:49:11,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:49:11,979 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2021-12-17 09:49:11,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 09:49:11,980 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 21 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-12-17 09:49:11,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:49:11,980 INFO L225 Difference]: With dead ends: 122 [2021-12-17 09:49:11,980 INFO L226 Difference]: Without dead ends: 72 [2021-12-17 09:49:11,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2021-12-17 09:49:11,981 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:49:11,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 09:49:11,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-17 09:49:11,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-12-17 09:49:11,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.0845070422535212) internal successors, (77), 71 states have internal predecessors, (77), 0 states have call successors, (0), 0 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 09:49:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2021-12-17 09:49:11,988 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 61 [2021-12-17 09:49:11,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:49:11,988 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2021-12-17 09:49:11,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 21 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 09:49:11,989 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2021-12-17 09:49:11,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-17 09:49:11,990 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:49:11,990 INFO L514 BasicCegarLoop]: trace histogram [50, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2021-12-17 09:49:12,019 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 09:49:12,190 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 09:49:12,190 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:49:12,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:49:12,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1313015549, now seen corresponding path program 5 times [2021-12-17 09:49:12,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:49:12,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076584965] [2021-12-17 09:49:12,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:49:12,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:49:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:49:12,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2021-12-17 09:49:12,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:49:12,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076584965] [2021-12-17 09:49:12,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076584965] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:49:12,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046970806] [2021-12-17 09:49:12,313 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 09:49:12,313 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:49:12,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:49:12,328 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 09:49:12,371 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 09:49:13,366 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2021-12-17 09:49:13,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:49:13,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-17 09:49:13,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:49:13,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2021-12-17 09:49:13,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:49:13,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2021-12-17 09:49:13,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046970806] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:49:13,802 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:49:13,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2021-12-17 09:49:13,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022385796] [2021-12-17 09:49:13,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:49:13,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-17 09:49:13,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:49:13,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-17 09:49:13,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2021-12-17 09:49:13,803 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 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 09:49:14,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:49:14,081 INFO L93 Difference]: Finished difference Result 180 states and 196 transitions. [2021-12-17 09:49:14,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 09:49:14,082 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 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 71 [2021-12-17 09:49:14,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:49:14,083 INFO L225 Difference]: With dead ends: 180 [2021-12-17 09:49:14,083 INFO L226 Difference]: Without dead ends: 176 [2021-12-17 09:49:14,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=230, Unknown=0, NotChecked=0, Total=380 [2021-12-17 09:49:14,084 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 39 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 09:49:14,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 117 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 09:49:14,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-12-17 09:49:14,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2021-12-17 09:49:14,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 1.08) internal successors, (189), 175 states have internal predecessors, (189), 0 states have call successors, (0), 0 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 09:49:14,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 189 transitions. [2021-12-17 09:49:14,099 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 189 transitions. Word has length 71 [2021-12-17 09:49:14,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:49:14,099 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 189 transitions. [2021-12-17 09:49:14,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 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 09:49:14,100 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 189 transitions. [2021-12-17 09:49:14,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-12-17 09:49:14,101 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:49:14,101 INFO L514 BasicCegarLoop]: trace histogram [130, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2021-12-17 09:49:14,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-17 09:49:14,307 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 09:49:14,307 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:49:14,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:49:14,309 INFO L85 PathProgramCache]: Analyzing trace with hash 869335427, now seen corresponding path program 6 times [2021-12-17 09:49:14,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:49:14,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345836615] [2021-12-17 09:49:14,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:49:14,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:49:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:49:14,617 INFO L134 CoverageAnalysis]: Checked inductivity of 10322 backedges. 0 proven. 9607 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2021-12-17 09:49:14,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:49:14,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345836615] [2021-12-17 09:49:14,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345836615] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:49:14,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054586329] [2021-12-17 09:49:14,618 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-17 09:49:14,619 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:49:14,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:49:14,623 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 09:49:14,624 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 09:49:20,607 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2021-12-17 09:49:20,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:49:20,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-17 09:49:20,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:49:21,099 INFO L134 CoverageAnalysis]: Checked inductivity of 10322 backedges. 0 proven. 9607 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2021-12-17 09:49:21,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:49:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 10322 backedges. 0 proven. 9607 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2021-12-17 09:49:23,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054586329] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:49:23,984 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:49:23,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 19] total 34 [2021-12-17 09:49:23,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344338695] [2021-12-17 09:49:23,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:49:23,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-17 09:49:23,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:49:23,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-17 09:49:23,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2021-12-17 09:49:23,987 INFO L87 Difference]: Start difference. First operand 176 states and 189 transitions. Second operand has 34 states, 34 states have (on average 3.411764705882353) internal successors, (116), 34 states have internal predecessors, (116), 0 states have call successors, (0), 0 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 09:50:36,512 WARN L227 SmtUtils]: Spent 35.61s on a formula simplification. DAG size of input: 85 DAG size of output: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 09:50:36,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:50:36,551 INFO L93 Difference]: Finished difference Result 401 states and 438 transitions. [2021-12-17 09:50:36,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-17 09:50:36,552 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.411764705882353) internal successors, (116), 34 states have internal predecessors, (116), 0 states have call successors, (0), 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 175 [2021-12-17 09:50:36,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:50:36,553 INFO L225 Difference]: With dead ends: 401 [2021-12-17 09:50:36,553 INFO L226 Difference]: Without dead ends: 397 [2021-12-17 09:50:36,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 332 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 73.8s TimeCoverageRelationStatistics Valid=803, Invalid=1548, Unknown=1, NotChecked=0, Total=2352 [2021-12-17 09:50:36,555 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 183 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 09:50:36,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 412 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 09:50:36,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2021-12-17 09:50:36,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 384. [2021-12-17 09:50:36,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 1.0783289817232375) internal successors, (413), 383 states have internal predecessors, (413), 0 states have call successors, (0), 0 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 09:50:36,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 413 transitions. [2021-12-17 09:50:36,577 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 413 transitions. Word has length 175 [2021-12-17 09:50:36,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:50:36,577 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 413 transitions. [2021-12-17 09:50:36,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.411764705882353) internal successors, (116), 34 states have internal predecessors, (116), 0 states have call successors, (0), 0 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 09:50:36,577 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 413 transitions. [2021-12-17 09:50:36,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2021-12-17 09:50:36,580 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:50:36,581 INFO L514 BasicCegarLoop]: trace histogram [290, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2021-12-17 09:50:36,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-17 09:50:36,781 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 09:50:36,781 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:50:36,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:50:36,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1690987901, now seen corresponding path program 7 times [2021-12-17 09:50:36,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:50:36,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608448520] [2021-12-17 09:50:36,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:50:36,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:50:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:50:37,631 INFO L134 CoverageAnalysis]: Checked inductivity of 51562 backedges. 0 proven. 49967 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2021-12-17 09:50:37,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:50:37,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608448520] [2021-12-17 09:50:37,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608448520] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:50:37,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435371249] [2021-12-17 09:50:37,633 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-17 09:50:37,633 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:50:37,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:50:37,634 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 09:50:37,635 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 09:50:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:50:37,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 1081 conjuncts, 61 conjunts are in the unsatisfiable core [2021-12-17 09:50:38,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:50:39,241 INFO L134 CoverageAnalysis]: Checked inductivity of 51562 backedges. 0 proven. 49967 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2021-12-17 09:50:39,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:50:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 51562 backedges. 0 proven. 49967 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2021-12-17 09:50:40,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435371249] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:50:40,849 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:50:40,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2021-12-17 09:50:40,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416440180] [2021-12-17 09:50:40,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:50:40,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2021-12-17 09:50:40,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:50:40,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2021-12-17 09:50:40,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=2823, Unknown=0, NotChecked=0, Total=3906 [2021-12-17 09:50:40,856 INFO L87 Difference]: Start difference. First operand 384 states and 413 transitions. Second operand has 63 states, 63 states have (on average 3.8412698412698414) internal successors, (242), 63 states have internal predecessors, (242), 0 states have call successors, (0), 0 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 09:56:26,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 09:56:26,605 INFO L93 Difference]: Finished difference Result 804 states and 880 transitions. [2021-12-17 09:56:26,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-12-17 09:56:26,605 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 3.8412698412698414) internal successors, (242), 63 states have internal predecessors, (242), 0 states have call successors, (0), 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 383 [2021-12-17 09:56:26,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 09:56:26,609 INFO L225 Difference]: With dead ends: 804 [2021-12-17 09:56:26,609 INFO L226 Difference]: Without dead ends: 800 [2021-12-17 09:56:26,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 826 GetRequests, 733 SyntacticMatches, 3 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 346.5s TimeCoverageRelationStatistics Valid=2895, Invalid=5461, Unknown=16, NotChecked=0, Total=8372 [2021-12-17 09:56:26,612 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 180 mSDsluCounter, 1914 mSDsCounter, 0 mSdLazyCounter, 1952 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1980 SdHoareTripleChecker+Invalid, 1990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-17 09:56:26,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 1980 Invalid, 1990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1952 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-17 09:56:26,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2021-12-17 09:56:26,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2021-12-17 09:56:26,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 799 states have (on average 1.0775969962453067) internal successors, (861), 799 states have internal predecessors, (861), 0 states have call successors, (0), 0 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 09:56:26,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 861 transitions. [2021-12-17 09:56:26,701 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 861 transitions. Word has length 383 [2021-12-17 09:56:26,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 09:56:26,702 INFO L470 AbstractCegarLoop]: Abstraction has 800 states and 861 transitions. [2021-12-17 09:56:26,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 3.8412698412698414) internal successors, (242), 63 states have internal predecessors, (242), 0 states have call successors, (0), 0 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 09:56:26,708 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 861 transitions. [2021-12-17 09:56:26,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 800 [2021-12-17 09:56:26,722 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 09:56:26,722 INFO L514 BasicCegarLoop]: trace histogram [610, 61, 61, 61, 1, 1, 1, 1, 1, 1] [2021-12-17 09:56:26,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-17 09:56:26,937 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 09:56:26,938 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 09:56:26,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 09:56:26,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1425060995, now seen corresponding path program 8 times [2021-12-17 09:56:26,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 09:56:26,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548195697] [2021-12-17 09:56:26,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 09:56:26,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 09:56:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 09:56:29,234 INFO L134 CoverageAnalysis]: Checked inductivity of 228506 backedges. 0 proven. 225151 refuted. 0 times theorem prover too weak. 3355 trivial. 0 not checked. [2021-12-17 09:56:29,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 09:56:29,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548195697] [2021-12-17 09:56:29,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548195697] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 09:56:29,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909525997] [2021-12-17 09:56:29,235 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 09:56:29,235 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 09:56:29,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 09:56:29,236 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 09:56:29,238 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 09:56:30,392 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 09:56:30,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 09:56:30,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 2233 conjuncts, 125 conjunts are in the unsatisfiable core [2021-12-17 09:56:30,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 09:56:32,925 INFO L134 CoverageAnalysis]: Checked inductivity of 228506 backedges. 0 proven. 225151 refuted. 0 times theorem prover too weak. 3355 trivial. 0 not checked. [2021-12-17 09:56:32,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 09:56:37,842 INFO L134 CoverageAnalysis]: Checked inductivity of 228506 backedges. 0 proven. 225151 refuted. 0 times theorem prover too weak. 3355 trivial. 0 not checked. [2021-12-17 09:56:37,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909525997] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 09:56:37,843 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 09:56:37,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2021-12-17 09:56:37,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375823648] [2021-12-17 09:56:37,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 09:56:37,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 127 states [2021-12-17 09:56:37,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 09:56:37,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2021-12-17 09:56:37,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4219, Invalid=11783, Unknown=0, NotChecked=0, Total=16002 [2021-12-17 09:56:37,848 INFO L87 Difference]: Start difference. First operand 800 states and 861 transitions. Second operand has 127 states, 127 states have (on average 3.921259842519685) internal successors, (498), 127 states have internal predecessors, (498), 0 states have call successors, (0), 0 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 09:58:16,198 WARN L227 SmtUtils]: Spent 14.77s on a formula simplification. DAG size of input: 250 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 09:58:18,208 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 23) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 54) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 19) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 55) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 7) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 41) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 58) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 56) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 53) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 59) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 57) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 268435455)) is different from false [2021-12-17 10:00:00,618 WARN L227 SmtUtils]: Spent 25.53s on a formula simplification. DAG size of input: 244 DAG size of output: 12 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 10:01:30,055 WARN L227 SmtUtils]: Spent 13.26s on a formula simplification. DAG size of input: 242 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 10:01:32,072 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 23) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 54) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 19) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 55) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 7) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 41) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 58) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 56) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 53) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 57) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 268435455)) is different from false [2021-12-17 10:01:34,083 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 23) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 54) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 19) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 55) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 7) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 41) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 58) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 56) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 53) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 57) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) 268435455)) is different from false [2021-12-17 10:01:36,095 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 23) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 54) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 19) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 55) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 7) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 41) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 56) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 53) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 57) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 268435455)) is different from false [2021-12-17 10:01:38,117 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 23) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 54) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 19) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 55) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 7) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 41) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 56) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 53) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 57) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) 268435455)) is different from false [2021-12-17 10:01:40,129 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 23) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 54) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 19) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 55) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 7) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 41) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 56) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 53) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 268435455)) is different from false [2021-12-17 10:03:30,298 WARN L227 SmtUtils]: Spent 30.05s on a formula simplification. DAG size of input: 228 DAG size of output: 12 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 10:03:32,326 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 23) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 54) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 19) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 55) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 7) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 41) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 53) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 268435455)) is different from false [2021-12-17 10:03:34,335 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 23) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 54) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 19) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 55) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 7) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 41) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 53) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) 268435455)) is different from false [2021-12-17 10:03:36,346 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 23) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 54) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 19) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 7) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 41) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 53) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 268435455)) is different from false [2021-12-17 10:03:38,355 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 23) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 54) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 19) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 7) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 41) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 53) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) 268435455)) is different from false [2021-12-17 10:03:40,378 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 23) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 19) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 7) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 41) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 40) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 53) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 268435455)) is different from false Killed by 15