./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf 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/nla-digbench-scaling/bresenham-ll_unwindbound100.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 bf574373b02b845162c1d9fcb05371eb87e4c369 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-29 12:00:17,943 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-29 12:00:17,944 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-29 12:00:17,998 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-29 12:00:18,004 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-29 12:00:18,005 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-29 12:00:18,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-29 12:00:18,009 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-29 12:00:18,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-29 12:00:18,011 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-29 12:00:18,012 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-29 12:00:18,013 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-29 12:00:18,013 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-29 12:00:18,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-29 12:00:18,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-29 12:00:18,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-29 12:00:18,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-29 12:00:18,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-29 12:00:18,017 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-29 12:00:18,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-29 12:00:18,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-29 12:00:18,020 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-29 12:00:18,021 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-29 12:00:18,021 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-29 12:00:18,023 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-29 12:00:18,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-29 12:00:18,023 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-29 12:00:18,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-29 12:00:18,024 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-29 12:00:18,025 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-29 12:00:18,025 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-29 12:00:18,025 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-29 12:00:18,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-29 12:00:18,026 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-29 12:00:18,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-29 12:00:18,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-29 12:00:18,027 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-29 12:00:18,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-29 12:00:18,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-29 12:00:18,028 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-29 12:00:18,029 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-29 12:00:18,029 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-29 12:00:18,045 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-29 12:00:18,045 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-29 12:00:18,045 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-29 12:00:18,045 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-29 12:00:18,046 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-29 12:00:18,046 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-29 12:00:18,046 INFO L138 SettingsManager]: * Use SBE=true [2021-08-29 12:00:18,046 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-29 12:00:18,047 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-29 12:00:18,047 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-29 12:00:18,047 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-29 12:00:18,047 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-29 12:00:18,047 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-29 12:00:18,047 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-29 12:00:18,047 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-29 12:00:18,047 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-29 12:00:18,048 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-29 12:00:18,048 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-29 12:00:18,048 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-29 12:00:18,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-29 12:00:18,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-29 12:00:18,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-29 12:00:18,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 12:00:18,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-29 12:00:18,054 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-29 12:00:18,054 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-29 12:00:18,054 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-29 12:00:18,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-29 12:00:18,055 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-29 12:00:18,055 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-29 12:00:18,055 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 -> bf574373b02b845162c1d9fcb05371eb87e4c369 [2021-08-29 12:00:18,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-29 12:00:18,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-29 12:00:18,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-29 12:00:18,359 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-29 12:00:18,359 INFO L275 PluginConnector]: CDTParser initialized [2021-08-29 12:00:18,360 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2021-08-29 12:00:18,419 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c824472d/5324c35ec4cc43e499e25953cb6081a3/FLAG1030b0aba [2021-08-29 12:00:18,817 INFO L306 CDTParser]: Found 1 translation units. [2021-08-29 12:00:18,817 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c [2021-08-29 12:00:18,823 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c824472d/5324c35ec4cc43e499e25953cb6081a3/FLAG1030b0aba [2021-08-29 12:00:18,838 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c824472d/5324c35ec4cc43e499e25953cb6081a3 [2021-08-29 12:00:18,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-29 12:00:18,843 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-29 12:00:18,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-29 12:00:18,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-29 12:00:18,848 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-29 12:00:18,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 12:00:18" (1/1) ... [2021-08-29 12:00:18,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dfda661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 12:00:18, skipping insertion in model container [2021-08-29 12:00:18,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 12:00:18" (1/1) ... [2021-08-29 12:00:18,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-29 12:00:18,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-29 12:00:18,973 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2021-08-29 12:00:19,010 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 12:00:19,019 INFO L203 MainTranslator]: Completed pre-run [2021-08-29 12:00:19,050 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound100.c[597,610] [2021-08-29 12:00:19,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 12:00:19,073 INFO L208 MainTranslator]: Completed translation [2021-08-29 12:00:19,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 12:00:19 WrapperNode [2021-08-29 12:00:19,076 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-29 12:00:19,078 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-29 12:00:19,079 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-29 12:00:19,079 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-29 12:00:19,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 12:00:19" (1/1) ... [2021-08-29 12:00:19,091 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 12:00:19" (1/1) ... [2021-08-29 12:00:19,114 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-29 12:00:19,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-29 12:00:19,116 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-29 12:00:19,116 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-29 12:00:19,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 12:00:19" (1/1) ... [2021-08-29 12:00:19,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 12:00:19" (1/1) ... [2021-08-29 12:00:19,132 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 12:00:19" (1/1) ... [2021-08-29 12:00:19,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 12:00:19" (1/1) ... [2021-08-29 12:00:19,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 12:00:19" (1/1) ... [2021-08-29 12:00:19,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 12:00:19" (1/1) ... [2021-08-29 12:00:19,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 12:00:19" (1/1) ... [2021-08-29 12:00:19,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-29 12:00:19,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-29 12:00:19,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-29 12:00:19,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-29 12:00:19,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 12:00:19" (1/1) ... [2021-08-29 12:00:19,165 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 12:00:19,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:00:19,185 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-08-29 12:00:19,248 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-08-29 12:00:19,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-29 12:00:19,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-29 12:00:19,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-29 12:00:19,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-29 12:00:19,442 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-29 12:00:19,442 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-08-29 12:00:19,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 12:00:19 BoogieIcfgContainer [2021-08-29 12:00:19,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-29 12:00:19,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-29 12:00:19,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-29 12:00:19,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-29 12:00:19,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 12:00:18" (1/3) ... [2021-08-29 12:00:19,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f539e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 12:00:19, skipping insertion in model container [2021-08-29 12:00:19,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 12:00:19" (2/3) ... [2021-08-29 12:00:19,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f539e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 12:00:19, skipping insertion in model container [2021-08-29 12:00:19,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 12:00:19" (3/3) ... [2021-08-29 12:00:19,449 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound100.c [2021-08-29 12:00:19,453 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-29 12:00:19,453 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-29 12:00:19,493 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-29 12:00:19,500 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-29 12:00:19,500 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-08-29 12:00:19,512 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:19,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-08-29 12:00:19,516 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:00:19,517 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-08-29 12:00:19,517 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 12:00:19,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:00:19,525 INFO L82 PathProgramCache]: Analyzing trace with hash 890461031, now seen corresponding path program 1 times [2021-08-29 12:00:19,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:00:19,535 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908357351] [2021-08-29 12:00:19,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:00:19,536 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:00:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 12:00:19,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:00:19,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:00:19,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908357351] [2021-08-29 12:00:19,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908357351] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 12:00:19,719 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 12:00:19,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-29 12:00:19,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326984161] [2021-08-29 12:00:19,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-29 12:00:19,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:00:19,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-29 12:00:19,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-29 12:00:19,753 INFO L87 Difference]: Start difference. First operand has 18 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:19,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:00:19,827 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2021-08-29 12:00:19,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-29 12:00:19,830 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-08-29 12:00:19,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:00:19,835 INFO L225 Difference]: With dead ends: 34 [2021-08-29 12:00:19,847 INFO L226 Difference]: Without dead ends: 14 [2021-08-29 12:00:19,850 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.03ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-29 12:00:19,853 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.91ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.33ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 60.59ms IncrementalHoareTripleChecker+Time [2021-08-29 12:00:19,853 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 20 Unknown, 0 Unchecked, 0.33ms Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 60.59ms Time] [2021-08-29 12:00:19,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-08-29 12:00:19,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-08-29 12:00:19,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:19,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-08-29 12:00:19,890 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 6 [2021-08-29 12:00:19,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:00:19,890 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-08-29 12:00:19,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:19,890 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2021-08-29 12:00:19,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-08-29 12:00:19,891 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:00:19,891 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-08-29 12:00:19,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-29 12:00:19,891 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 12:00:19,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:00:19,892 INFO L82 PathProgramCache]: Analyzing trace with hash 889571274, now seen corresponding path program 1 times [2021-08-29 12:00:19,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:00:19,892 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268500102] [2021-08-29 12:00:19,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:00:19,892 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:00:19,905 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:00:19,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1735056499] [2021-08-29 12:00:19,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:00:19,907 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:00:19,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:00:19,908 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-08-29 12:00:19,921 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-08-29 12:00:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 12:00:19,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-29 12:00:19,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:00:20,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:00:20,130 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-29 12:00:20,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:00:20,131 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268500102] [2021-08-29 12:00:20,131 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:00:20,131 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735056499] [2021-08-29 12:00:20,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735056499] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 12:00:20,132 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 12:00:20,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 12:00:20,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046276854] [2021-08-29 12:00:20,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 12:00:20,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:00:20,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 12:00:20,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 12:00:20,135 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-08-29 12:00:20,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:00:20,202 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2021-08-29 12:00:20,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 12:00:20,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-08-29 12:00:20,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:00:20,204 INFO L225 Difference]: With dead ends: 30 [2021-08-29 12:00:20,204 INFO L226 Difference]: Without dead ends: 23 [2021-08-29 12:00:20,205 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.12ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 12:00:20,207 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.12ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.35ms IncrementalHoareTripleChecker+Time [2021-08-29 12:00:20,207 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 55 Unknown, 0 Unchecked, 1.12ms Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 47.35ms Time] [2021-08-29 12:00:20,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-08-29 12:00:20,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2021-08-29 12:00:20,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:20,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2021-08-29 12:00:20,218 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 6 [2021-08-29 12:00:20,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:00:20,219 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2021-08-29 12:00:20,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-08-29 12:00:20,220 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2021-08-29 12:00:20,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-29 12:00:20,224 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:00:20,224 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 12:00:20,252 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-08-29 12:00:20,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:00:20,426 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 12:00:20,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:00:20,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1545533000, now seen corresponding path program 1 times [2021-08-29 12:00:20,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:00:20,427 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187227855] [2021-08-29 12:00:20,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:00:20,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:00:20,437 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:00:20,439 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [548347955] [2021-08-29 12:00:20,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:00:20,440 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:00:20,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:00:20,447 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-08-29 12:00:20,451 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-08-29 12:00:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 12:00:20,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 23 conjunts are in the unsatisfiable core [2021-08-29 12:00:20,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:00:20,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:00:20,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 12:00:20,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-29 12:00:20,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:00:20,762 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187227855] [2021-08-29 12:00:20,762 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:00:20,762 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548347955] [2021-08-29 12:00:20,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548347955] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 12:00:20,762 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-29 12:00:20,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2021-08-29 12:00:20,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532268827] [2021-08-29 12:00:20,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-29 12:00:20,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:00:20,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-29 12:00:20,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-29 12:00:20,764 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:20,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:00:20,883 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2021-08-29 12:00:20,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-29 12:00:20,883 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-29 12:00:20,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:00:20,885 INFO L225 Difference]: With dead ends: 29 [2021-08-29 12:00:20,885 INFO L226 Difference]: Without dead ends: 27 [2021-08-29 12:00:20,887 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 89.61ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-08-29 12:00:20,890 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.60ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 63.80ms IncrementalHoareTripleChecker+Time [2021-08-29 12:00:20,892 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 88 Unknown, 0 Unchecked, 1.60ms Time], IncrementalHoareTripleChecker [15 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 63.80ms Time] [2021-08-29 12:00:20,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-08-29 12:00:20,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 16. [2021-08-29 12:00:20,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:20,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2021-08-29 12:00:20,900 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2021-08-29 12:00:20,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:00:20,900 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2021-08-29 12:00:20,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:20,900 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2021-08-29 12:00:20,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-29 12:00:20,901 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:00:20,901 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 12:00:20,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-29 12:00:21,105 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,SelfDestructingSolverStorable2 [2021-08-29 12:00:21,105 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 12:00:21,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:00:21,108 INFO L82 PathProgramCache]: Analyzing trace with hash -666919436, now seen corresponding path program 1 times [2021-08-29 12:00:21,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:00:21,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473044502] [2021-08-29 12:00:21,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:00:21,109 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:00:21,129 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:00:21,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [251837612] [2021-08-29 12:00:21,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:00:21,130 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:00:21,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:00:21,142 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-08-29 12:00:21,144 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-08-29 12:00:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 12:00:21,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-29 12:00:21,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:00:21,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:00:21,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 12:00:21,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:00:21,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:00:21,297 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473044502] [2021-08-29 12:00:21,297 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:00:21,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251837612] [2021-08-29 12:00:21,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251837612] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 12:00:21,298 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-29 12:00:21,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-08-29 12:00:21,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726234160] [2021-08-29 12:00:21,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-29 12:00:21,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:00:21,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-29 12:00:21,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-08-29 12:00:21,300 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:21,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:00:21,408 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2021-08-29 12:00:21,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-29 12:00:21,409 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-29 12:00:21,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:00:21,410 INFO L225 Difference]: With dead ends: 44 [2021-08-29 12:00:21,410 INFO L226 Difference]: Without dead ends: 40 [2021-08-29 12:00:21,411 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 37.90ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-29 12:00:21,412 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.51ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 76.21ms IncrementalHoareTripleChecker+Time [2021-08-29 12:00:21,412 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 90 Unknown, 0 Unchecked, 1.51ms Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 76.21ms Time] [2021-08-29 12:00:21,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-08-29 12:00:21,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2021-08-29 12:00:21,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2021-08-29 12:00:21,419 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 13 [2021-08-29 12:00:21,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:00:21,419 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2021-08-29 12:00:21,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:21,420 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2021-08-29 12:00:21,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-29 12:00:21,420 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:00:21,420 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 12:00:21,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-29 12:00:21,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:00:21,644 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 12:00:21,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:00:21,645 INFO L82 PathProgramCache]: Analyzing trace with hash -919296115, now seen corresponding path program 1 times [2021-08-29 12:00:21,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:00:21,645 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043437737] [2021-08-29 12:00:21,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:00:21,646 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:00:21,661 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:00:21,662 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2097219105] [2021-08-29 12:00:21,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:00:21,663 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:00:21,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:00:21,664 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-08-29 12:00:21,665 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-08-29 12:00:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 12:00:21,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 30 conjunts are in the unsatisfiable core [2021-08-29 12:00:21,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:00:22,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:00:22,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 12:00:22,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:00:22,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:00:22,425 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043437737] [2021-08-29 12:00:22,425 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:00:22,425 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097219105] [2021-08-29 12:00:22,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097219105] provided 1 perfect and 1 imperfect interpolant sequences [2021-08-29 12:00:22,425 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-29 12:00:22,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 15 [2021-08-29 12:00:22,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9579366] [2021-08-29 12:00:22,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-29 12:00:22,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:00:22,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-29 12:00:22,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-08-29 12:00:22,427 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:30,600 WARN L210 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 37 [2021-08-29 12:00:31,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:00:31,384 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2021-08-29 12:00:31,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-29 12:00:31,385 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-29 12:00:31,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:00:31,385 INFO L225 Difference]: With dead ends: 58 [2021-08-29 12:00:31,385 INFO L226 Difference]: Without dead ends: 54 [2021-08-29 12:00:31,386 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 8465.26ms TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2021-08-29 12:00:31,386 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 669.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.33ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 690.51ms IncrementalHoareTripleChecker+Time [2021-08-29 12:00:31,386 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 110 Unknown, 0 Unchecked, 2.33ms Time], IncrementalHoareTripleChecker [8 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 690.51ms Time] [2021-08-29 12:00:31,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-08-29 12:00:31,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2021-08-29 12:00:31,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:31,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2021-08-29 12:00:31,395 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 15 [2021-08-29 12:00:31,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:00:31,395 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2021-08-29 12:00:31,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:31,396 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2021-08-29 12:00:31,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-29 12:00:31,396 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:00:31,396 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 12:00:31,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-08-29 12:00:31,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:00:31,613 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 12:00:31,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:00:31,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1599354485, now seen corresponding path program 1 times [2021-08-29 12:00:31,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:00:31,614 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492840467] [2021-08-29 12:00:31,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:00:31,614 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:00:31,620 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:00:31,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [838301468] [2021-08-29 12:00:31,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:00:31,621 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:00:31,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:00:31,623 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-08-29 12:00:31,631 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-08-29 12:00:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 12:00:31,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-29 12:00:31,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:00:31,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-29 12:00:31,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-29 12:00:31,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:00:31,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492840467] [2021-08-29 12:00:31,755 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:00:31,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838301468] [2021-08-29 12:00:31,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838301468] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 12:00:31,755 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 12:00:31,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-29 12:00:31,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50295498] [2021-08-29 12:00:31,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-29 12:00:31,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:00:31,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-29 12:00:31,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-29 12:00:31,758 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:31,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:00:31,839 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2021-08-29 12:00:31,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-29 12:00:31,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-29 12:00:31,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:00:31,845 INFO L225 Difference]: With dead ends: 84 [2021-08-29 12:00:31,845 INFO L226 Difference]: Without dead ends: 80 [2021-08-29 12:00:31,845 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 42.96ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-29 12:00:31,846 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.45ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.35ms IncrementalHoareTripleChecker+Time [2021-08-29 12:00:31,847 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 81 Unknown, 0 Unchecked, 0.45ms Time], IncrementalHoareTripleChecker [10 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 46.35ms Time] [2021-08-29 12:00:31,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-08-29 12:00:31,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2021-08-29 12:00:31,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 65 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-08-29 12:00:31,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2021-08-29 12:00:31,859 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 15 [2021-08-29 12:00:31,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:00:31,859 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2021-08-29 12:00:31,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:31,859 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2021-08-29 12:00:31,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-29 12:00:31,860 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:00:31,860 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 12:00:31,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-29 12:00:32,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:00:32,077 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 12:00:32,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:00:32,077 INFO L82 PathProgramCache]: Analyzing trace with hash 2050020189, now seen corresponding path program 1 times [2021-08-29 12:00:32,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:00:32,077 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249535465] [2021-08-29 12:00:32,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:00:32,077 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:00:32,085 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:00:32,085 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1345663915] [2021-08-29 12:00:32,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:00:32,085 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:00:32,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:00:32,088 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-08-29 12:00:32,089 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-08-29 12:00:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 12:00:32,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-29 12:00:32,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:00:32,284 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:00:32,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 12:00:32,423 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:00:32,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:00:32,423 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249535465] [2021-08-29 12:00:32,423 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:00:32,424 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345663915] [2021-08-29 12:00:32,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345663915] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 12:00:32,424 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-29 12:00:32,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-08-29 12:00:32,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132156156] [2021-08-29 12:00:32,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-29 12:00:32,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:00:32,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-29 12:00:32,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-08-29 12:00:32,425 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:32,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:00:32,600 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2021-08-29 12:00:32,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-29 12:00:32,600 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-29 12:00:32,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:00:32,600 INFO L225 Difference]: With dead ends: 73 [2021-08-29 12:00:32,601 INFO L226 Difference]: Without dead ends: 69 [2021-08-29 12:00:32,601 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 118.69ms TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2021-08-29 12:00:32,601 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 104.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.75ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 117.14ms IncrementalHoareTripleChecker+Time [2021-08-29 12:00:32,601 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 151 Unknown, 0 Unchecked, 0.75ms Time], IncrementalHoareTripleChecker [11 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 117.14ms Time] [2021-08-29 12:00:32,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-08-29 12:00:32,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2021-08-29 12:00:32,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:32,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2021-08-29 12:00:32,607 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 21 [2021-08-29 12:00:32,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:00:32,607 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2021-08-29 12:00:32,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:32,607 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2021-08-29 12:00:32,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-29 12:00:32,607 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:00:32,607 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 12:00:32,626 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-08-29 12:00:32,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:00:32,817 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 12:00:32,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:00:32,817 INFO L82 PathProgramCache]: Analyzing trace with hash -655902801, now seen corresponding path program 2 times [2021-08-29 12:00:32,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:00:32,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511675030] [2021-08-29 12:00:32,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:00:32,817 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:00:32,823 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:00:32,824 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1388261755] [2021-08-29 12:00:32,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-29 12:00:32,824 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:00:32,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:00:32,825 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-08-29 12:00:32,826 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-08-29 12:00:32,936 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-29 12:00:32,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 12:00:32,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-29 12:00:32,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:00:33,315 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:00:33,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 12:00:33,626 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:00:33,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:00:33,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511675030] [2021-08-29 12:00:33,627 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:00:33,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388261755] [2021-08-29 12:00:33,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388261755] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 12:00:33,627 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-29 12:00:33,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-08-29 12:00:33,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425134341] [2021-08-29 12:00:33,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-29 12:00:33,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:00:33,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-29 12:00:33,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2021-08-29 12:00:33,630 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 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-08-29 12:00:34,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:00:34,567 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2021-08-29 12:00:34,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-29 12:00:34,568 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 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 27 [2021-08-29 12:00:34,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:00:34,569 INFO L225 Difference]: With dead ends: 107 [2021-08-29 12:00:34,569 INFO L226 Difference]: Without dead ends: 103 [2021-08-29 12:00:34,569 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 534.69ms TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2021-08-29 12:00:34,569 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 540.28ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.31ms SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 576.50ms IncrementalHoareTripleChecker+Time [2021-08-29 12:00:34,570 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 336 Unknown, 0 Unchecked, 2.31ms Time], IncrementalHoareTripleChecker [34 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 576.50ms Time] [2021-08-29 12:00:34,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-08-29 12:00:34,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 79. [2021-08-29 12:00:34,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 78 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:34,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2021-08-29 12:00:34,576 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 27 [2021-08-29 12:00:34,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:00:34,576 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2021-08-29 12:00:34,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 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-08-29 12:00:34,576 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2021-08-29 12:00:34,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-29 12:00:34,577 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:00:34,577 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 12:00:34,582 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-08-29 12:00:34,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:00:34,782 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 12:00:34,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:00:34,783 INFO L82 PathProgramCache]: Analyzing trace with hash 623960877, now seen corresponding path program 3 times [2021-08-29 12:00:34,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:00:34,783 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815839022] [2021-08-29 12:00:34,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:00:34,783 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:00:34,790 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:00:34,791 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1283303389] [2021-08-29 12:00:34,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-29 12:00:34,792 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:00:34,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:00:34,793 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-08-29 12:00:34,799 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-08-29 12:00:35,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-08-29 12:00:35,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 12:00:35,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-29 12:00:35,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:00:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-08-29 12:00:35,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-29 12:00:35,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:00:35,347 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815839022] [2021-08-29 12:00:35,348 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:00:35,348 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283303389] [2021-08-29 12:00:35,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283303389] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 12:00:35,348 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 12:00:35,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-29 12:00:35,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102784725] [2021-08-29 12:00:35,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-29 12:00:35,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:00:35,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-29 12:00:35,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-08-29 12:00:35,350 INFO L87 Difference]: Start difference. First operand 79 states and 92 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:35,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:00:35,561 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2021-08-29 12:00:35,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-29 12:00:35,561 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-08-29 12:00:35,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:00:35,562 INFO L225 Difference]: With dead ends: 83 [2021-08-29 12:00:35,562 INFO L226 Difference]: Without dead ends: 79 [2021-08-29 12:00:35,562 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 104.81ms TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-08-29 12:00:35,563 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 124.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.05ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 137.18ms IncrementalHoareTripleChecker+Time [2021-08-29 12:00:35,563 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 123 Unknown, 0 Unchecked, 1.05ms Time], IncrementalHoareTripleChecker [8 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 137.18ms Time] [2021-08-29 12:00:35,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-08-29 12:00:35,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 32. [2021-08-29 12:00:35,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 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-08-29 12:00:35,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-08-29 12:00:35,567 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 27 [2021-08-29 12:00:35,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:00:35,567 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-08-29 12:00:35,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:35,567 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-08-29 12:00:35,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-29 12:00:35,567 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:00:35,567 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2021-08-29 12:00:35,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-29 12:00:35,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-08-29 12:00:35,779 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 12:00:35,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:00:35,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1957613462, now seen corresponding path program 2 times [2021-08-29 12:00:35,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:00:35,780 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113569400] [2021-08-29 12:00:35,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:00:35,780 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:00:35,785 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:00:35,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [141273809] [2021-08-29 12:00:35,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-29 12:00:35,786 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:00:35,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:00:35,794 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 12:00:35,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-29 12:00:35,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-29 12:00:35,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 12:00:35,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-29 12:00:35,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:00:35,980 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:00:35,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 12:00:36,090 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:00:36,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:00:36,091 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113569400] [2021-08-29 12:00:36,091 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:00:36,091 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141273809] [2021-08-29 12:00:36,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141273809] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 12:00:36,091 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-29 12:00:36,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2021-08-29 12:00:36,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328770237] [2021-08-29 12:00:36,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-29 12:00:36,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:00:36,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-29 12:00:36,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2021-08-29 12:00:36,092 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:36,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:00:36,341 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2021-08-29 12:00:36,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-29 12:00:36,341 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-08-29 12:00:36,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:00:36,343 INFO L225 Difference]: With dead ends: 72 [2021-08-29 12:00:36,344 INFO L226 Difference]: Without dead ends: 68 [2021-08-29 12:00:36,344 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 126.87ms TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2021-08-29 12:00:36,345 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 117.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.90ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 161.82ms IncrementalHoareTripleChecker+Time [2021-08-29 12:00:36,346 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 123 Unknown, 0 Unchecked, 0.90ms Time], IncrementalHoareTripleChecker [14 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 161.82ms Time] [2021-08-29 12:00:36,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-08-29 12:00:36,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-08-29 12:00:36,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.164179104477612) internal successors, (78), 67 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:36,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2021-08-29 12:00:36,357 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 31 [2021-08-29 12:00:36,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:00:36,357 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2021-08-29 12:00:36,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:36,358 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2021-08-29 12:00:36,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-29 12:00:36,361 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:00:36,362 INFO L513 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2021-08-29 12:00:36,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-08-29 12:00:36,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-08-29 12:00:36,573 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 12:00:36,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:00:36,573 INFO L82 PathProgramCache]: Analyzing trace with hash -118005546, now seen corresponding path program 3 times [2021-08-29 12:00:36,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:00:36,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951686107] [2021-08-29 12:00:36,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:00:36,573 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:00:36,579 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:00:36,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [419018466] [2021-08-29 12:00:36,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-29 12:00:36,580 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:00:36,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:00:36,588 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 12:00:36,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-29 12:00:36,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-08-29 12:00:36,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 12:00:36,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 23 conjunts are in the unsatisfiable core [2021-08-29 12:00:36,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:00:37,004 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:00:37,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 12:00:37,270 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:00:37,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:00:37,270 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951686107] [2021-08-29 12:00:37,270 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:00:37,270 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419018466] [2021-08-29 12:00:37,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419018466] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 12:00:37,270 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-29 12:00:37,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2021-08-29 12:00:37,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669801163] [2021-08-29 12:00:37,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-08-29 12:00:37,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:00:37,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-29 12:00:37,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2021-08-29 12:00:37,272 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 26 states, 26 states have (on average 5.038461538461538) internal successors, (131), 25 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:37,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:00:37,664 INFO L93 Difference]: Finished difference Result 144 states and 177 transitions. [2021-08-29 12:00:37,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-08-29 12:00:37,664 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.038461538461538) internal successors, (131), 25 states have internal predecessors, (131), 0 states have call successors, (0), 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 67 [2021-08-29 12:00:37,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:00:37,665 INFO L225 Difference]: With dead ends: 144 [2021-08-29 12:00:37,665 INFO L226 Difference]: Without dead ends: 140 [2021-08-29 12:00:37,666 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 391.58ms TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2021-08-29 12:00:37,666 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 112 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 124.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.89ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 150.89ms IncrementalHoareTripleChecker+Time [2021-08-29 12:00:37,666 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 0 Invalid, 220 Unknown, 0 Unchecked, 1.89ms Time], IncrementalHoareTripleChecker [27 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 150.89ms Time] [2021-08-29 12:00:37,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-08-29 12:00:37,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2021-08-29 12:00:37,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.1654676258992807) internal successors, (162), 139 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:37,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 162 transitions. [2021-08-29 12:00:37,676 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 162 transitions. Word has length 67 [2021-08-29 12:00:37,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:00:37,677 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 162 transitions. [2021-08-29 12:00:37,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.038461538461538) internal successors, (131), 25 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:37,677 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 162 transitions. [2021-08-29 12:00:37,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-08-29 12:00:37,678 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:00:37,678 INFO L513 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2021-08-29 12:00:37,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-08-29 12:00:37,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-08-29 12:00:37,884 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 12:00:37,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:00:37,885 INFO L82 PathProgramCache]: Analyzing trace with hash 974024622, now seen corresponding path program 4 times [2021-08-29 12:00:37,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:00:37,885 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445044617] [2021-08-29 12:00:37,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:00:37,886 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:00:37,903 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:00:37,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [464944925] [2021-08-29 12:00:37,903 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-29 12:00:37,903 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:00:37,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:00:37,904 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 12:00:37,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-08-29 12:00:38,031 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-29 12:00:38,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 12:00:38,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 47 conjunts are in the unsatisfiable core [2021-08-29 12:00:38,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:00:38,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 0 proven. 1430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:00:38,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 12:00:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 0 proven. 1430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:00:39,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:00:39,331 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445044617] [2021-08-29 12:00:39,332 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:00:39,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464944925] [2021-08-29 12:00:39,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464944925] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 12:00:39,332 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-29 12:00:39,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2021-08-29 12:00:39,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57817793] [2021-08-29 12:00:39,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-08-29 12:00:39,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:00:39,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-08-29 12:00:39,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2021-08-29 12:00:39,334 INFO L87 Difference]: Start difference. First operand 140 states and 162 transitions. Second operand has 50 states, 50 states have (on average 5.5) internal successors, (275), 49 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:40,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:00:40,468 INFO L93 Difference]: Finished difference Result 288 states and 357 transitions. [2021-08-29 12:00:40,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-08-29 12:00:40,469 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.5) internal successors, (275), 49 states have internal predecessors, (275), 0 states have call successors, (0), 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 139 [2021-08-29 12:00:40,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:00:40,471 INFO L225 Difference]: With dead ends: 288 [2021-08-29 12:00:40,471 INFO L226 Difference]: Without dead ends: 284 [2021-08-29 12:00:40,473 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1381.79ms TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2021-08-29 12:00:40,473 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 248 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 237.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.93ms SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 312.56ms IncrementalHoareTripleChecker+Time [2021-08-29 12:00:40,474 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 0 Invalid, 420 Unknown, 0 Unchecked, 3.93ms Time], IncrementalHoareTripleChecker [51 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 312.56ms Time] [2021-08-29 12:00:40,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-08-29 12:00:40,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2021-08-29 12:00:40,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.1660777385159011) internal successors, (330), 283 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:40,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 330 transitions. [2021-08-29 12:00:40,500 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 330 transitions. Word has length 139 [2021-08-29 12:00:40,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:00:40,501 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 330 transitions. [2021-08-29 12:00:40,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.5) internal successors, (275), 49 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:00:40,502 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 330 transitions. [2021-08-29 12:00:40,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2021-08-29 12:00:40,505 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:00:40,505 INFO L513 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2021-08-29 12:00:40,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-08-29 12:00:40,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-08-29 12:00:40,723 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 12:00:40,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:00:40,723 INFO L82 PathProgramCache]: Analyzing trace with hash -962902690, now seen corresponding path program 5 times [2021-08-29 12:00:40,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:00:40,723 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411704350] [2021-08-29 12:00:40,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:00:40,723 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:00:40,733 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:00:40,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1082026543] [2021-08-29 12:00:40,733 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-29 12:00:40,734 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:00:40,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:00:40,735 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 12:00:40,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-08-29 12:01:07,755 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2021-08-29 12:01:07,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 12:01:07,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 95 conjunts are in the unsatisfiable core [2021-08-29 12:01:07,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:01:08,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6302 backedges. 0 proven. 6302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:01:08,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 12:01:11,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6302 backedges. 0 proven. 6302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:01:11,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:01:11,264 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411704350] [2021-08-29 12:01:11,264 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:01:11,264 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082026543] [2021-08-29 12:01:11,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082026543] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 12:01:11,264 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-29 12:01:11,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 97 [2021-08-29 12:01:11,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996233694] [2021-08-29 12:01:11,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2021-08-29 12:01:11,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:01:11,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2021-08-29 12:01:11,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4565, Invalid=4941, Unknown=0, NotChecked=0, Total=9506 [2021-08-29 12:01:11,268 INFO L87 Difference]: Start difference. First operand 284 states and 330 transitions. Second operand has 98 states, 98 states have (on average 5.744897959183674) internal successors, (563), 97 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:01:14,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:01:14,743 INFO L93 Difference]: Finished difference Result 576 states and 717 transitions. [2021-08-29 12:01:14,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2021-08-29 12:01:14,743 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 5.744897959183674) internal successors, (563), 97 states have internal predecessors, (563), 0 states have call successors, (0), 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 283 [2021-08-29 12:01:14,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:01:14,745 INFO L225 Difference]: With dead ends: 576 [2021-08-29 12:01:14,745 INFO L226 Difference]: Without dead ends: 572 [2021-08-29 12:01:14,751 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 468 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5452 ImplicationChecksByTransitivity, 4879.49ms TimeCoverageRelationStatistics Valid=13540, Invalid=22750, Unknown=0, NotChecked=0, Total=36290 [2021-08-29 12:01:14,752 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 522 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 474.52ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.84ms SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 635.98ms IncrementalHoareTripleChecker+Time [2021-08-29 12:01:14,752 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [522 Valid, 0 Invalid, 805 Unknown, 0 Unchecked, 6.84ms Time], IncrementalHoareTripleChecker [96 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 635.98ms Time] [2021-08-29 12:01:14,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2021-08-29 12:01:14,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2021-08-29 12:01:14,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 571 states have (on average 1.1663747810858143) internal successors, (666), 571 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:01:14,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 666 transitions. [2021-08-29 12:01:14,788 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 666 transitions. Word has length 283 [2021-08-29 12:01:14,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:01:14,789 INFO L470 AbstractCegarLoop]: Abstraction has 572 states and 666 transitions. [2021-08-29 12:01:14,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 5.744897959183674) internal successors, (563), 97 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:01:14,789 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 666 transitions. [2021-08-29 12:01:14,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2021-08-29 12:01:14,801 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:01:14,801 INFO L513 BasicCegarLoop]: trace histogram [95, 94, 94, 94, 94, 94, 1, 1, 1, 1, 1, 1] [2021-08-29 12:01:14,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-08-29 12:01:15,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-08-29 12:01:15,013 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 12:01:15,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:01:15,014 INFO L82 PathProgramCache]: Analyzing trace with hash -154152770, now seen corresponding path program 6 times [2021-08-29 12:01:15,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:01:15,014 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314295699] [2021-08-29 12:01:15,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:01:15,014 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:01:15,030 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:01:15,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [359579406] [2021-08-29 12:01:15,030 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-29 12:01:15,031 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:01:15,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:01:15,031 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 12:01:15,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-08-29 12:12:04,332 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2021-08-29 12:12:04,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-29 12:12:04,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 2131 conjuncts, 191 conjunts are in the unsatisfiable core [2021-08-29 12:12:04,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-29 12:12:07,860 INFO L134 CoverageAnalysis]: Checked inductivity of 26414 backedges. 0 proven. 26414 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:12:07,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-29 12:12:09,084 INFO L134 CoverageAnalysis]: Checked inductivity of 26414 backedges. 0 proven. 26414 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 12:12:09,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 12:12:09,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314295699] [2021-08-29 12:12:09,084 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-08-29 12:12:09,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359579406] [2021-08-29 12:12:09,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359579406] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-29 12:12:09,085 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-29 12:12:09,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 103 [2021-08-29 12:12:09,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817791115] [2021-08-29 12:12:09,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2021-08-29 12:12:09,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 12:12:09,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2021-08-29 12:12:09,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5156, Invalid=5556, Unknown=0, NotChecked=0, Total=10712 [2021-08-29 12:12:09,087 INFO L87 Difference]: Start difference. First operand 572 states and 666 transitions. Second operand has 104 states, 104 states have (on average 5.8173076923076925) internal successors, (605), 103 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:12:13,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 12:12:13,180 INFO L93 Difference]: Finished difference Result 612 states and 717 transitions. [2021-08-29 12:12:13,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2021-08-29 12:12:13,181 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 5.8173076923076925) internal successors, (605), 103 states have internal predecessors, (605), 0 states have call successors, (0), 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 571 [2021-08-29 12:12:13,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 12:12:13,183 INFO L225 Difference]: With dead ends: 612 [2021-08-29 12:12:13,183 INFO L226 Difference]: Without dead ends: 608 [2021-08-29 12:12:13,186 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 1239 GetRequests, 1037 SyntacticMatches, 1 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5055 ImplicationChecksByTransitivity, 5744.22ms TimeCoverageRelationStatistics Valid=15349, Invalid=25657, Unknown=0, NotChecked=0, Total=41006 [2021-08-29 12:12:13,186 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 403 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 437.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.77ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 578.28ms IncrementalHoareTripleChecker+Time [2021-08-29 12:12:13,189 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [403 Valid, 0 Invalid, 773 Unknown, 0 Unchecked, 3.77ms Time], IncrementalHoareTripleChecker [6 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 578.28ms Time] [2021-08-29 12:12:13,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2021-08-29 12:12:13,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2021-08-29 12:12:13,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 607 states have (on average 1.1663920922570017) internal successors, (708), 607 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:12:13,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 708 transitions. [2021-08-29 12:12:13,224 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 708 transitions. Word has length 571 [2021-08-29 12:12:13,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 12:12:13,224 INFO L470 AbstractCegarLoop]: Abstraction has 608 states and 708 transitions. [2021-08-29 12:12:13,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 5.8173076923076925) internal successors, (605), 103 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 12:12:13,225 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 708 transitions. [2021-08-29 12:12:13,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2021-08-29 12:12:13,227 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 12:12:13,228 INFO L513 BasicCegarLoop]: trace histogram [101, 100, 100, 100, 100, 100, 1, 1, 1, 1, 1, 1] [2021-08-29 12:12:13,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-08-29 12:12:13,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-08-29 12:12:13,433 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-29 12:12:13,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 12:12:13,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1421305642, now seen corresponding path program 7 times [2021-08-29 12:12:13,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 12:12:13,434 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206373329] [2021-08-29 12:12:13,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 12:12:13,434 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 12:12:13,446 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-08-29 12:12:13,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [545760423] [2021-08-29 12:12:13,446 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-29 12:12:13,446 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:12:13,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 12:12:13,448 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-29 12:12:13,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-08-29 12:12:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 12:12:14,327 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-29 12:12:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 12:12:15,612 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-29 12:12:15,612 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-08-29 12:12:15,613 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-08-29 12:12:15,616 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-08-29 12:12:15,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-08-29 12:12:15,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-29 12:12:15,834 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-29 12:12:16,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 12:12:16 BoogieIcfgContainer [2021-08-29 12:12:16,007 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-29 12:12:16,007 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-29 12:12:16,007 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-29 12:12:16,008 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-29 12:12:16,008 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 12:00:19" (3/4) ... [2021-08-29 12:12:16,009 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-29 12:12:16,153 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-29 12:12:16,153 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-29 12:12:16,154 INFO L158 Benchmark]: Toolchain (without parser) took 717311.03ms. Allocated memory was 54.5MB in the beginning and 174.1MB in the end (delta: 119.5MB). Free memory was 33.4MB in the beginning and 115.4MB in the end (delta: -82.0MB). Peak memory consumption was 112.4MB. Max. memory is 16.1GB. [2021-08-29 12:12:16,154 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 54.5MB. Free memory was 36.7MB in the beginning and 36.7MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 12:12:16,154 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.08ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 33.2MB in the beginning and 50.2MB in the end (delta: -17.0MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2021-08-29 12:12:16,154 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.63ms. Allocated memory is still 67.1MB. Free memory was 50.0MB in the beginning and 48.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 12:12:16,155 INFO L158 Benchmark]: Boogie Preprocessor took 41.71ms. Allocated memory is still 67.1MB. Free memory was 48.7MB in the beginning and 47.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 12:12:16,155 INFO L158 Benchmark]: RCFGBuilder took 285.61ms. Allocated memory is still 67.1MB. Free memory was 47.5MB in the beginning and 38.7MB in the end (delta: 8.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-08-29 12:12:16,155 INFO L158 Benchmark]: TraceAbstraction took 716562.37ms. Allocated memory was 67.1MB in the beginning and 174.1MB in the end (delta: 107.0MB). Free memory was 38.2MB in the beginning and 84.1MB in the end (delta: -45.9MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB. [2021-08-29 12:12:16,155 INFO L158 Benchmark]: Witness Printer took 145.92ms. Allocated memory is still 174.1MB. Free memory was 83.1MB in the beginning and 115.4MB in the end (delta: -32.3MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. [2021-08-29 12:12:16,156 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 54.5MB. Free memory was 36.7MB in the beginning and 36.7MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.08ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 33.2MB in the beginning and 50.2MB in the end (delta: -17.0MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.63ms. Allocated memory is still 67.1MB. Free memory was 50.0MB in the beginning and 48.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.71ms. Allocated memory is still 67.1MB. Free memory was 48.7MB in the beginning and 47.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 285.61ms. Allocated memory is still 67.1MB. Free memory was 47.5MB in the beginning and 38.7MB in the end (delta: 8.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 716562.37ms. Allocated memory was 67.1MB in the beginning and 174.1MB in the end (delta: 107.0MB). Free memory was 38.2MB in the beginning and 84.1MB in the end (delta: -45.9MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB. * Witness Printer took 145.92ms. Allocated memory is still 174.1MB. Free memory was 83.1MB in the beginning and 115.4MB in the end (delta: -32.3MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; VAL [counter=0] [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 VAL [counter=0] [L31] EXPR counter++ VAL [counter=1] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=1] [L35] COND FALSE !(!(x <= X)) VAL [counter=1] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=1] [L45] x++ VAL [counter=1] [L31] EXPR counter++ VAL [counter=2] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=2] [L35] COND FALSE !(!(x <= X)) VAL [counter=2] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=2] [L45] x++ VAL [counter=2] [L31] EXPR counter++ VAL [counter=3] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=3] [L35] COND FALSE !(!(x <= X)) VAL [counter=3] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=3] [L45] x++ VAL [counter=3] [L31] EXPR counter++ VAL [counter=4] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=4] [L35] COND FALSE !(!(x <= X)) VAL [counter=4] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=4] [L45] x++ VAL [counter=4] [L31] EXPR counter++ VAL [counter=5] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=5] [L35] COND FALSE !(!(x <= X)) VAL [counter=5] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=5] [L45] x++ VAL [counter=5] [L31] EXPR counter++ VAL [counter=6] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=6] [L35] COND FALSE !(!(x <= X)) VAL [counter=6] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=6] [L45] x++ VAL [counter=6] [L31] EXPR counter++ VAL [counter=7] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=7] [L35] COND FALSE !(!(x <= X)) VAL [counter=7] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=7] [L45] x++ VAL [counter=7] [L31] EXPR counter++ VAL [counter=8] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=8] [L35] COND FALSE !(!(x <= X)) VAL [counter=8] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=8] [L45] x++ VAL [counter=8] [L31] EXPR counter++ VAL [counter=9] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=9] [L35] COND FALSE !(!(x <= X)) VAL [counter=9] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=9] [L45] x++ VAL [counter=9] [L31] EXPR counter++ VAL [counter=10] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=10] [L35] COND FALSE !(!(x <= X)) VAL [counter=10] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=10] [L45] x++ VAL [counter=10] [L31] EXPR counter++ VAL [counter=11] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=11] [L35] COND FALSE !(!(x <= X)) VAL [counter=11] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=11] [L45] x++ VAL [counter=11] [L31] EXPR counter++ VAL [counter=12] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=12] [L35] COND FALSE !(!(x <= X)) VAL [counter=12] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=12] [L45] x++ VAL [counter=12] [L31] EXPR counter++ VAL [counter=13] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=13] [L35] COND FALSE !(!(x <= X)) VAL [counter=13] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=13] [L45] x++ VAL [counter=13] [L31] EXPR counter++ VAL [counter=14] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=14] [L35] COND FALSE !(!(x <= X)) VAL [counter=14] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=14] [L45] x++ VAL [counter=14] [L31] EXPR counter++ VAL [counter=15] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=15] [L35] COND FALSE !(!(x <= X)) VAL [counter=15] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=15] [L45] x++ VAL [counter=15] [L31] EXPR counter++ VAL [counter=16] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=16] [L35] COND FALSE !(!(x <= X)) VAL [counter=16] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=16] [L45] x++ VAL [counter=16] [L31] EXPR counter++ VAL [counter=17] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=17] [L35] COND FALSE !(!(x <= X)) VAL [counter=17] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=17] [L45] x++ VAL [counter=17] [L31] EXPR counter++ VAL [counter=18] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=18] [L35] COND FALSE !(!(x <= X)) VAL [counter=18] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=18] [L45] x++ VAL [counter=18] [L31] EXPR counter++ VAL [counter=19] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=19] [L35] COND FALSE !(!(x <= X)) VAL [counter=19] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=19] [L45] x++ VAL [counter=19] [L31] EXPR counter++ VAL [counter=20] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=20] [L35] COND FALSE !(!(x <= X)) VAL [counter=20] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=20] [L45] x++ VAL [counter=20] [L31] EXPR counter++ VAL [counter=21] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=21] [L35] COND FALSE !(!(x <= X)) VAL [counter=21] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=21] [L45] x++ VAL [counter=21] [L31] EXPR counter++ VAL [counter=22] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=22] [L35] COND FALSE !(!(x <= X)) VAL [counter=22] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=22] [L45] x++ VAL [counter=22] [L31] EXPR counter++ VAL [counter=23] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=23] [L35] COND FALSE !(!(x <= X)) VAL [counter=23] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=23] [L45] x++ VAL [counter=23] [L31] EXPR counter++ VAL [counter=24] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=24] [L35] COND FALSE !(!(x <= X)) VAL [counter=24] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=24] [L45] x++ VAL [counter=24] [L31] EXPR counter++ VAL [counter=25] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=25] [L35] COND FALSE !(!(x <= X)) VAL [counter=25] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=25] [L45] x++ VAL [counter=25] [L31] EXPR counter++ VAL [counter=26] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=26] [L35] COND FALSE !(!(x <= X)) VAL [counter=26] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=26] [L45] x++ VAL [counter=26] [L31] EXPR counter++ VAL [counter=27] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=27] [L35] COND FALSE !(!(x <= X)) VAL [counter=27] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=27] [L45] x++ VAL [counter=27] [L31] EXPR counter++ VAL [counter=28] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=28] [L35] COND FALSE !(!(x <= X)) VAL [counter=28] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=28] [L45] x++ VAL [counter=28] [L31] EXPR counter++ VAL [counter=29] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=29] [L35] COND FALSE !(!(x <= X)) VAL [counter=29] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=29] [L45] x++ VAL [counter=29] [L31] EXPR counter++ VAL [counter=30] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=30] [L35] COND FALSE !(!(x <= X)) VAL [counter=30] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=30] [L45] x++ VAL [counter=30] [L31] EXPR counter++ VAL [counter=31] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=31] [L35] COND FALSE !(!(x <= X)) VAL [counter=31] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=31] [L45] x++ VAL [counter=31] [L31] EXPR counter++ VAL [counter=32] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=32] [L35] COND FALSE !(!(x <= X)) VAL [counter=32] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=32] [L45] x++ VAL [counter=32] [L31] EXPR counter++ VAL [counter=33] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=33] [L35] COND FALSE !(!(x <= X)) VAL [counter=33] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=33] [L45] x++ VAL [counter=33] [L31] EXPR counter++ VAL [counter=34] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=34] [L35] COND FALSE !(!(x <= X)) VAL [counter=34] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=34] [L45] x++ VAL [counter=34] [L31] EXPR counter++ VAL [counter=35] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=35] [L35] COND FALSE !(!(x <= X)) VAL [counter=35] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=35] [L45] x++ VAL [counter=35] [L31] EXPR counter++ VAL [counter=36] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=36] [L35] COND FALSE !(!(x <= X)) VAL [counter=36] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=36] [L45] x++ VAL [counter=36] [L31] EXPR counter++ VAL [counter=37] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=37] [L35] COND FALSE !(!(x <= X)) VAL [counter=37] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=37] [L45] x++ VAL [counter=37] [L31] EXPR counter++ VAL [counter=38] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=38] [L35] COND FALSE !(!(x <= X)) VAL [counter=38] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=38] [L45] x++ VAL [counter=38] [L31] EXPR counter++ VAL [counter=39] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=39] [L35] COND FALSE !(!(x <= X)) VAL [counter=39] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=39] [L45] x++ VAL [counter=39] [L31] EXPR counter++ VAL [counter=40] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=40] [L35] COND FALSE !(!(x <= X)) VAL [counter=40] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=40] [L45] x++ VAL [counter=40] [L31] EXPR counter++ VAL [counter=41] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=41] [L35] COND FALSE !(!(x <= X)) VAL [counter=41] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=41] [L45] x++ VAL [counter=41] [L31] EXPR counter++ VAL [counter=42] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=42] [L35] COND FALSE !(!(x <= X)) VAL [counter=42] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=42] [L45] x++ VAL [counter=42] [L31] EXPR counter++ VAL [counter=43] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=43] [L35] COND FALSE !(!(x <= X)) VAL [counter=43] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=43] [L45] x++ VAL [counter=43] [L31] EXPR counter++ VAL [counter=44] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=44] [L35] COND FALSE !(!(x <= X)) VAL [counter=44] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=44] [L45] x++ VAL [counter=44] [L31] EXPR counter++ VAL [counter=45] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=45] [L35] COND FALSE !(!(x <= X)) VAL [counter=45] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=45] [L45] x++ VAL [counter=45] [L31] EXPR counter++ VAL [counter=46] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=46] [L35] COND FALSE !(!(x <= X)) VAL [counter=46] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=46] [L45] x++ VAL [counter=46] [L31] EXPR counter++ VAL [counter=47] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=47] [L35] COND FALSE !(!(x <= X)) VAL [counter=47] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=47] [L45] x++ VAL [counter=47] [L31] EXPR counter++ VAL [counter=48] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=48] [L35] COND FALSE !(!(x <= X)) VAL [counter=48] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=48] [L45] x++ VAL [counter=48] [L31] EXPR counter++ VAL [counter=49] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=49] [L35] COND FALSE !(!(x <= X)) VAL [counter=49] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=49] [L45] x++ VAL [counter=49] [L31] EXPR counter++ VAL [counter=50] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=50] [L35] COND FALSE !(!(x <= X)) VAL [counter=50] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=50] [L45] x++ VAL [counter=50] [L31] EXPR counter++ VAL [counter=51] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=51] [L35] COND FALSE !(!(x <= X)) VAL [counter=51] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=51] [L45] x++ VAL [counter=51] [L31] EXPR counter++ VAL [counter=52] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=52] [L35] COND FALSE !(!(x <= X)) VAL [counter=52] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=52] [L45] x++ VAL [counter=52] [L31] EXPR counter++ VAL [counter=53] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=53] [L35] COND FALSE !(!(x <= X)) VAL [counter=53] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=53] [L45] x++ VAL [counter=53] [L31] EXPR counter++ VAL [counter=54] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=54] [L35] COND FALSE !(!(x <= X)) VAL [counter=54] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=54] [L45] x++ VAL [counter=54] [L31] EXPR counter++ VAL [counter=55] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=55] [L35] COND FALSE !(!(x <= X)) VAL [counter=55] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=55] [L45] x++ VAL [counter=55] [L31] EXPR counter++ VAL [counter=56] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=56] [L35] COND FALSE !(!(x <= X)) VAL [counter=56] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=56] [L45] x++ VAL [counter=56] [L31] EXPR counter++ VAL [counter=57] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=57] [L35] COND FALSE !(!(x <= X)) VAL [counter=57] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=57] [L45] x++ VAL [counter=57] [L31] EXPR counter++ VAL [counter=58] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=58] [L35] COND FALSE !(!(x <= X)) VAL [counter=58] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=58] [L45] x++ VAL [counter=58] [L31] EXPR counter++ VAL [counter=59] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=59] [L35] COND FALSE !(!(x <= X)) VAL [counter=59] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=59] [L45] x++ VAL [counter=59] [L31] EXPR counter++ VAL [counter=60] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=60] [L35] COND FALSE !(!(x <= X)) VAL [counter=60] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=60] [L45] x++ VAL [counter=60] [L31] EXPR counter++ VAL [counter=61] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=61] [L35] COND FALSE !(!(x <= X)) VAL [counter=61] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=61] [L45] x++ VAL [counter=61] [L31] EXPR counter++ VAL [counter=62] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=62] [L35] COND FALSE !(!(x <= X)) VAL [counter=62] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=62] [L45] x++ VAL [counter=62] [L31] EXPR counter++ VAL [counter=63] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=63] [L35] COND FALSE !(!(x <= X)) VAL [counter=63] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=63] [L45] x++ VAL [counter=63] [L31] EXPR counter++ VAL [counter=64] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=64] [L35] COND FALSE !(!(x <= X)) VAL [counter=64] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=64] [L45] x++ VAL [counter=64] [L31] EXPR counter++ VAL [counter=65] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=65] [L35] COND FALSE !(!(x <= X)) VAL [counter=65] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=65] [L45] x++ VAL [counter=65] [L31] EXPR counter++ VAL [counter=66] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=66] [L35] COND FALSE !(!(x <= X)) VAL [counter=66] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=66] [L45] x++ VAL [counter=66] [L31] EXPR counter++ VAL [counter=67] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=67] [L35] COND FALSE !(!(x <= X)) VAL [counter=67] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=67] [L45] x++ VAL [counter=67] [L31] EXPR counter++ VAL [counter=68] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=68] [L35] COND FALSE !(!(x <= X)) VAL [counter=68] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=68] [L45] x++ VAL [counter=68] [L31] EXPR counter++ VAL [counter=69] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=69] [L35] COND FALSE !(!(x <= X)) VAL [counter=69] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=69] [L45] x++ VAL [counter=69] [L31] EXPR counter++ VAL [counter=70] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=70] [L35] COND FALSE !(!(x <= X)) VAL [counter=70] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=70] [L45] x++ VAL [counter=70] [L31] EXPR counter++ VAL [counter=71] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=71] [L35] COND FALSE !(!(x <= X)) VAL [counter=71] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=71] [L45] x++ VAL [counter=71] [L31] EXPR counter++ VAL [counter=72] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=72] [L35] COND FALSE !(!(x <= X)) VAL [counter=72] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=72] [L45] x++ VAL [counter=72] [L31] EXPR counter++ VAL [counter=73] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=73] [L35] COND FALSE !(!(x <= X)) VAL [counter=73] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=73] [L45] x++ VAL [counter=73] [L31] EXPR counter++ VAL [counter=74] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=74] [L35] COND FALSE !(!(x <= X)) VAL [counter=74] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=74] [L45] x++ VAL [counter=74] [L31] EXPR counter++ VAL [counter=75] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=75] [L35] COND FALSE !(!(x <= X)) VAL [counter=75] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=75] [L45] x++ VAL [counter=75] [L31] EXPR counter++ VAL [counter=76] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=76] [L35] COND FALSE !(!(x <= X)) VAL [counter=76] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=76] [L45] x++ VAL [counter=76] [L31] EXPR counter++ VAL [counter=77] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=77] [L35] COND FALSE !(!(x <= X)) VAL [counter=77] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=77] [L45] x++ VAL [counter=77] [L31] EXPR counter++ VAL [counter=78] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=78] [L35] COND FALSE !(!(x <= X)) VAL [counter=78] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=78] [L45] x++ VAL [counter=78] [L31] EXPR counter++ VAL [counter=79] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=79] [L35] COND FALSE !(!(x <= X)) VAL [counter=79] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=79] [L45] x++ VAL [counter=79] [L31] EXPR counter++ VAL [counter=80] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=80] [L35] COND FALSE !(!(x <= X)) VAL [counter=80] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=80] [L45] x++ VAL [counter=80] [L31] EXPR counter++ VAL [counter=81] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=81] [L35] COND FALSE !(!(x <= X)) VAL [counter=81] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=81] [L45] x++ VAL [counter=81] [L31] EXPR counter++ VAL [counter=82] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=82] [L35] COND FALSE !(!(x <= X)) VAL [counter=82] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=82] [L45] x++ VAL [counter=82] [L31] EXPR counter++ VAL [counter=83] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=83] [L35] COND FALSE !(!(x <= X)) VAL [counter=83] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=83] [L45] x++ VAL [counter=83] [L31] EXPR counter++ VAL [counter=84] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=84] [L35] COND FALSE !(!(x <= X)) VAL [counter=84] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=84] [L45] x++ VAL [counter=84] [L31] EXPR counter++ VAL [counter=85] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=85] [L35] COND FALSE !(!(x <= X)) VAL [counter=85] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=85] [L45] x++ VAL [counter=85] [L31] EXPR counter++ VAL [counter=86] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=86] [L35] COND FALSE !(!(x <= X)) VAL [counter=86] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=86] [L45] x++ VAL [counter=86] [L31] EXPR counter++ VAL [counter=87] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=87] [L35] COND FALSE !(!(x <= X)) VAL [counter=87] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=87] [L45] x++ VAL [counter=87] [L31] EXPR counter++ VAL [counter=88] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=88] [L35] COND FALSE !(!(x <= X)) VAL [counter=88] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=88] [L45] x++ VAL [counter=88] [L31] EXPR counter++ VAL [counter=89] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=89] [L35] COND FALSE !(!(x <= X)) VAL [counter=89] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=89] [L45] x++ VAL [counter=89] [L31] EXPR counter++ VAL [counter=90] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=90] [L35] COND FALSE !(!(x <= X)) VAL [counter=90] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=90] [L45] x++ VAL [counter=90] [L31] EXPR counter++ VAL [counter=91] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=91] [L35] COND FALSE !(!(x <= X)) VAL [counter=91] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=91] [L45] x++ VAL [counter=91] [L31] EXPR counter++ VAL [counter=92] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=92] [L35] COND FALSE !(!(x <= X)) VAL [counter=92] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=92] [L45] x++ VAL [counter=92] [L31] EXPR counter++ VAL [counter=93] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=93] [L35] COND FALSE !(!(x <= X)) VAL [counter=93] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=93] [L45] x++ VAL [counter=93] [L31] EXPR counter++ VAL [counter=94] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=94] [L35] COND FALSE !(!(x <= X)) VAL [counter=94] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=94] [L45] x++ VAL [counter=94] [L31] EXPR counter++ VAL [counter=95] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=95] [L35] COND FALSE !(!(x <= X)) VAL [counter=95] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=95] [L45] x++ VAL [counter=95] [L31] EXPR counter++ VAL [counter=96] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=96] [L35] COND FALSE !(!(x <= X)) VAL [counter=96] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=96] [L45] x++ VAL [counter=96] [L31] EXPR counter++ VAL [counter=97] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=97] [L35] COND FALSE !(!(x <= X)) VAL [counter=97] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=97] [L45] x++ VAL [counter=97] [L31] EXPR counter++ VAL [counter=98] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=98] [L35] COND FALSE !(!(x <= X)) VAL [counter=98] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=98] [L45] x++ VAL [counter=98] [L31] EXPR counter++ VAL [counter=99] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=99] [L35] COND FALSE !(!(x <= X)) VAL [counter=99] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=99] [L45] x++ VAL [counter=99] [L31] EXPR counter++ VAL [counter=100] [L31] COND TRUE counter++<100 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L14] COND FALSE !(!(cond)) VAL [counter=100] [L35] COND FALSE !(!(x <= X)) VAL [counter=100] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [counter=100] [L45] x++ VAL [counter=100] [L31] EXPR counter++ VAL [counter=101] [L31] COND FALSE !(counter++<100) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x [L14] COND TRUE !(cond) VAL [counter=101] [L16] reach_error() VAL [counter=101] - UnprovableResult [Line: 16]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 716340.19ms, OverallIterations: 15, TraceHistogramMax: 101, EmptinessCheckTime: 36.91ms, AutomataDifference: 20211.24ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 7.99ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1477 SdHoareTripleChecker+Valid, 3655.15ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1477 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 3058.55ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1847 mSDsCounter, 289 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3106 IncrementalHoareTripleChecker+Invalid, 3395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 289 mSolverCounterUnsat, 0 mSDtfsCounter, 3106 mSolverCounterSat, 28.76ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2691 GetRequests, 2041 SyntacticMatches, 3 SemanticMatches, 647 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12391 ImplicationChecksByTransitivity, 21946.01ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=608occurred in iteration=14, InterpolantAutomatonStates: 641, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 198.33ms AutomataMinimizationTime, 14 MinimizatonAttempts, 121 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 230.65ms SsaConstructionTime, 677877.79ms SatisfiabilityAnalysisTime, 12883.19ms InterpolantComputationTime, 1840 NumberOfCodeBlocks, 1828 NumberOfCodeBlocksAsserted, 169 NumberOfCheckSat, 2388 ConstructedInterpolants, 0 QuantifiedInterpolants, 8924 SizeOfPredicates, 235 NumberOfNonLiveVariables, 4953 ConjunctsInSsa, 501 ConjunctsInUnsatCore, 24 InterpolantComputations, 5 PerfectInterpolantSequences, 40/69100 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-29 12:12:16,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...