./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c --full-output -ea --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 -ea -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/fermat2-ll_unwindbound20.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 273da1ac294a352af33bb12048452a8688ebd941 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-09-13 14:27:43,193 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:27:43,195 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:27:43,222 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:27:43,223 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:27:43,225 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:27:43,226 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:27:43,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:27:43,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:27:43,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:27:43,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:27:43,242 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:27:43,242 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:27:43,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:27:43,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:27:43,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:27:43,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:27:43,249 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:27:43,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:27:43,255 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:27:43,256 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:27:43,256 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:27:43,257 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:27:43,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:27:43,263 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:27:43,263 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:27:43,263 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:27:43,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:27:43,264 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:27:43,265 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:27:43,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:27:43,266 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:27:43,267 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:27:43,267 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:27:43,268 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:27:43,268 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:27:43,269 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:27:43,269 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:27:43,269 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:27:43,270 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:27:43,270 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:27:43,273 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-09-13 14:27:43,301 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:27:43,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:27:43,302 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:27:43,302 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:27:43,303 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:27:43,304 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:27:43,304 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:27:43,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:27:43,308 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:27:43,308 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 14:27:43,309 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:27:43,309 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:27:43,309 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:27:43,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:27:43,310 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:27:43,310 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:27:43,310 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:27:43,310 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:27:43,310 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:27:43,310 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:27:43,310 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:27:43,311 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:27:43,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:27:43,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:27:43,311 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:27:43,311 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:27:43,311 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-13 14:27:43,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-13 14:27:43,312 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:27:43,312 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:27:43,312 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 -> 273da1ac294a352af33bb12048452a8688ebd941 [2021-09-13 14:27:43,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:27:43,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:27:43,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:27:43,570 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:27:43,571 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:27:43,572 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c [2021-09-13 14:27:43,616 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d452357ef/15b8045bc78b4b219e8118e247af96be/FLAG41da1f364 [2021-09-13 14:27:43,970 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:27:43,971 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c [2021-09-13 14:27:43,975 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d452357ef/15b8045bc78b4b219e8118e247af96be/FLAG41da1f364 [2021-09-13 14:27:43,985 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d452357ef/15b8045bc78b4b219e8118e247af96be [2021-09-13 14:27:43,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:27:43,988 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:27:43,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:27:43,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:27:43,991 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:27:43,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:27:43" (1/1) ... [2021-09-13 14:27:43,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bfc9a35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:27:43, skipping insertion in model container [2021-09-13 14:27:43,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:27:43" (1/1) ... [2021-09-13 14:27:43,997 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:27:44,004 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:27:44,091 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/fermat2-ll_unwindbound20.c[524,537] [2021-09-13 14:27:44,101 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:27:44,107 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:27:44,114 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/fermat2-ll_unwindbound20.c[524,537] [2021-09-13 14:27:44,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:27:44,128 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:27:44,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:27:44 WrapperNode [2021-09-13 14:27:44,129 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:27:44,130 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:27:44,130 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:27:44,130 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:27:44,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:27:44" (1/1) ... [2021-09-13 14:27:44,138 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:27:44" (1/1) ... [2021-09-13 14:27:44,174 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:27:44,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:27:44,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:27:44,175 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:27:44,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:27:44" (1/1) ... [2021-09-13 14:27:44,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:27:44" (1/1) ... [2021-09-13 14:27:44,189 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:27:44" (1/1) ... [2021-09-13 14:27:44,189 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:27:44" (1/1) ... [2021-09-13 14:27:44,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:27:44" (1/1) ... [2021-09-13 14:27:44,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:27:44" (1/1) ... [2021-09-13 14:27:44,199 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:27:44" (1/1) ... [2021-09-13 14:27:44,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:27:44,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:27:44,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:27:44,205 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:27:44,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:27:44" (1/1) ... [2021-09-13 14:27:44,210 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:27:44,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:27:44,238 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-09-13 14:27:44,273 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-09-13 14:27:44,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-13 14:27:44,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:27:44,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:27:44,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:27:44,439 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:27:44,439 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2021-09-13 14:27:44,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:27:44 BoogieIcfgContainer [2021-09-13 14:27:44,440 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:27:44,441 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:27:44,441 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:27:44,443 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:27:44,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:27:43" (1/3) ... [2021-09-13 14:27:44,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48947da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:27:44, skipping insertion in model container [2021-09-13 14:27:44,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:27:44" (2/3) ... [2021-09-13 14:27:44,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48947da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:27:44, skipping insertion in model container [2021-09-13 14:27:44,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:27:44" (3/3) ... [2021-09-13 14:27:44,445 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound20.c [2021-09-13 14:27:44,448 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:27:44,448 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-09-13 14:27:44,476 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:27:44,480 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-09-13 14:27:44,480 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-09-13 14:27:44,498 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 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-09-13 14:27:44,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-09-13 14:27:44,501 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:27:44,502 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:27:44,502 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:27:44,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:27:44,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1235340721, now seen corresponding path program 1 times [2021-09-13 14:27:44,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:27:44,511 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362531759] [2021-09-13 14:27:44,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:44,512 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:27:44,577 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:27:44,577 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1439921769] [2021-09-13 14:27:44,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:44,578 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:27:44,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:27:44,581 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-09-13 14:27:44,582 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-09-13 14:27:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:44,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 1 conjunts are in the unsatisfiable core [2021-09-13 14:27:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:44,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:27:44,726 INFO L281 TraceCheckUtils]: 0: Hoare triple {24#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {24#true} is VALID [2021-09-13 14:27:44,727 INFO L281 TraceCheckUtils]: 1: Hoare triple {24#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~A~0, main_~R~0, main_~u~0, main_~v~0, main_~r~0;havoc main_~A~0;havoc main_~R~0;havoc main_~u~0;havoc main_~v~0;havoc main_~r~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~A~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~R~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if (main_~R~0 - 1) * (main_~R~0 - 1) < main_~A~0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {24#true} is VALID [2021-09-13 14:27:44,727 INFO L281 TraceCheckUtils]: 2: Hoare triple {24#true} assume 0 == assume_abort_if_not_~cond;assume false; {25#false} is VALID [2021-09-13 14:27:44,728 INFO L281 TraceCheckUtils]: 3: Hoare triple {25#false} assume_abort_if_not_#in~cond := (if 1 == (if main_~A~0 < 0 && 0 != main_~A~0 % 2 then main_~A~0 % 2 - 2 else main_~A~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {25#false} is VALID [2021-09-13 14:27:44,728 INFO L281 TraceCheckUtils]: 4: Hoare triple {25#false} assume 0 == assume_abort_if_not_~cond;assume false; {25#false} is VALID [2021-09-13 14:27:44,728 INFO L281 TraceCheckUtils]: 5: Hoare triple {25#false} main_~u~0 := 1 + 2 * main_~R~0;main_~v~0 := 1;main_~r~0 := main_~R~0 * main_~R~0 - main_~A~0; {25#false} is VALID [2021-09-13 14:27:44,728 INFO L281 TraceCheckUtils]: 6: Hoare triple {25#false} assume !true; {25#false} is VALID [2021-09-13 14:27:44,729 INFO L281 TraceCheckUtils]: 7: Hoare triple {25#false} __VERIFIER_assert_#in~cond := (if 4 * main_~A~0 == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {25#false} is VALID [2021-09-13 14:27:44,729 INFO L281 TraceCheckUtils]: 8: Hoare triple {25#false} assume 0 == __VERIFIER_assert_~cond; {25#false} is VALID [2021-09-13 14:27:44,729 INFO L281 TraceCheckUtils]: 9: Hoare triple {25#false} assume !false; {25#false} is VALID [2021-09-13 14:27:44,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:27:44,730 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:27:44,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:27:44,731 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362531759] [2021-09-13 14:27:44,732 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:27:44,733 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439921769] [2021-09-13 14:27:44,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439921769] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:27:44,733 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:27:44,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-13 14:27:44,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681049316] [2021-09-13 14:27:44,740 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-09-13 14:27:44,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:27:44,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:44,759 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:27:44,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 14:27:44,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:27:44,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 14:27:44,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:27:44,779 INFO L87 Difference]: Start difference. First operand has 21 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:44,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:44,847 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2021-09-13 14:27:44,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 14:27:44,849 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-09-13 14:27:44,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:27:44,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:44,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2021-09-13 14:27:44,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:44,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2021-09-13 14:27:44,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2021-09-13 14:27:44,907 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:27:44,916 INFO L225 Difference]: With dead ends: 39 [2021-09-13 14:27:44,916 INFO L226 Difference]: Without dead ends: 17 [2021-09-13 14:27:44,919 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.06ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:27:44,922 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.42ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.35ms IncrementalHoareTripleChecker+Time [2021-09-13 14:27:44,928 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 23 Unknown, 0 Unchecked, 0.42ms Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 24.35ms Time] [2021-09-13 14:27:44,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-09-13 14:27:44,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-09-13 14:27:44,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:27:44,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 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-09-13 14:27:44,956 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 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-09-13 14:27:44,956 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 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-09-13 14:27:44,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:44,958 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2021-09-13 14:27:44,959 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2021-09-13 14:27:44,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:44,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:44,960 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 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) Second operand 17 states. [2021-09-13 14:27:44,960 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 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) Second operand 17 states. [2021-09-13 14:27:44,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:44,963 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2021-09-13 14:27:44,963 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2021-09-13 14:27:44,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:44,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:44,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:27:44,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:27:44,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 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-09-13 14:27:44,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2021-09-13 14:27:44,967 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2021-09-13 14:27:44,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:27:44,967 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-09-13 14:27:44,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:44,967 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2021-09-13 14:27:44,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-09-13 14:27:44,968 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:27:44,968 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:27:44,991 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-09-13 14:27:45,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2021-09-13 14:27:45,186 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:27:45,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:27:45,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1988288018, now seen corresponding path program 1 times [2021-09-13 14:27:45,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:27:45,186 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317996151] [2021-09-13 14:27:45,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:45,187 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:27:45,199 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:27:45,200 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [969945422] [2021-09-13 14:27:45,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:45,206 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:27:45,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:27:45,208 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-09-13 14:27:45,224 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-09-13 14:27:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:45,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 13 conjunts are in the unsatisfiable core [2021-09-13 14:27:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:45,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:27:45,766 INFO L281 TraceCheckUtils]: 0: Hoare triple {155#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {155#true} is VALID [2021-09-13 14:27:45,767 INFO L281 TraceCheckUtils]: 1: Hoare triple {155#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~A~0, main_~R~0, main_~u~0, main_~v~0, main_~r~0;havoc main_~A~0;havoc main_~R~0;havoc main_~u~0;havoc main_~v~0;havoc main_~r~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~A~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~R~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if (main_~R~0 - 1) * (main_~R~0 - 1) < main_~A~0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {155#true} is VALID [2021-09-13 14:27:45,767 INFO L281 TraceCheckUtils]: 2: Hoare triple {155#true} assume !(0 == assume_abort_if_not_~cond); {155#true} is VALID [2021-09-13 14:27:45,767 INFO L281 TraceCheckUtils]: 3: Hoare triple {155#true} assume_abort_if_not_#in~cond := (if 1 == (if main_~A~0 < 0 && 0 != main_~A~0 % 2 then main_~A~0 % 2 - 2 else main_~A~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {155#true} is VALID [2021-09-13 14:27:45,767 INFO L281 TraceCheckUtils]: 4: Hoare triple {155#true} assume !(0 == assume_abort_if_not_~cond); {155#true} is VALID [2021-09-13 14:27:46,330 INFO L281 TraceCheckUtils]: 5: Hoare triple {155#true} main_~u~0 := 1 + 2 * main_~R~0;main_~v~0 := 1;main_~r~0 := main_~R~0 * main_~R~0 - main_~A~0; {175#(and (= (+ ULTIMATE.start_main_~A~0 ULTIMATE.start_main_~r~0) (* (div (+ (* ULTIMATE.start_main_~u~0 (- 1)) 1) (- 2)) (div (+ (* ULTIMATE.start_main_~u~0 (- 1)) 1) (- 2)))) (= (mod (+ ULTIMATE.start_main_~u~0 1) (- 2)) 0) (= ULTIMATE.start_main_~v~0 1))} is VALID [2021-09-13 14:27:46,331 INFO L281 TraceCheckUtils]: 6: Hoare triple {175#(and (= (+ ULTIMATE.start_main_~A~0 ULTIMATE.start_main_~r~0) (* (div (+ (* ULTIMATE.start_main_~u~0 (- 1)) 1) (- 2)) (div (+ (* ULTIMATE.start_main_~u~0 (- 1)) 1) (- 2)))) (= (mod (+ ULTIMATE.start_main_~u~0 1) (- 2)) 0) (= ULTIMATE.start_main_~v~0 1))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {175#(and (= (+ ULTIMATE.start_main_~A~0 ULTIMATE.start_main_~r~0) (* (div (+ (* ULTIMATE.start_main_~u~0 (- 1)) 1) (- 2)) (div (+ (* ULTIMATE.start_main_~u~0 (- 1)) 1) (- 2)))) (= (mod (+ ULTIMATE.start_main_~u~0 1) (- 2)) 0) (= ULTIMATE.start_main_~v~0 1))} is VALID [2021-09-13 14:27:46,603 INFO L281 TraceCheckUtils]: 7: Hoare triple {175#(and (= (+ ULTIMATE.start_main_~A~0 ULTIMATE.start_main_~r~0) (* (div (+ (* ULTIMATE.start_main_~u~0 (- 1)) 1) (- 2)) (div (+ (* ULTIMATE.start_main_~u~0 (- 1)) 1) (- 2)))) (= (mod (+ ULTIMATE.start_main_~u~0 1) (- 2)) 0) (= ULTIMATE.start_main_~v~0 1))} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {182#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:27:46,604 INFO L281 TraceCheckUtils]: 8: Hoare triple {182#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {156#false} is VALID [2021-09-13 14:27:46,604 INFO L281 TraceCheckUtils]: 9: Hoare triple {156#false} assume !false; {156#false} is VALID [2021-09-13 14:27:46,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:27:46,605 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:27:46,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:27:46,605 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317996151] [2021-09-13 14:27:46,605 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:27:46,605 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969945422] [2021-09-13 14:27:46,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969945422] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:27:46,605 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:27:46,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:27:46,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970407461] [2021-09-13 14:27:46,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-09-13 14:27:46,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:27:46,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:48,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:27:48,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:27:48,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:27:48,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:27:48,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:27:48,528 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:53,419 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-09-13 14:27:53,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:53,999 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2021-09-13 14:27:53,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:27:53,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-09-13 14:27:53,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:27:53,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:54,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2021-09-13 14:27:54,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:27:54,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2021-09-13 14:27:54,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2021-09-13 14:28:01,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 37 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2021-09-13 14:28:01,434 INFO L225 Difference]: With dead ends: 34 [2021-09-13 14:28:01,434 INFO L226 Difference]: Without dead ends: 32 [2021-09-13 14:28:01,435 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 46.47ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:28:01,435 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2064.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.87ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2066.43ms IncrementalHoareTripleChecker+Time [2021-09-13 14:28:01,436 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 67 Unknown, 0 Unchecked, 0.87ms Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 2066.43ms Time] [2021-09-13 14:28:01,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-09-13 14:28:01,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 22. [2021-09-13 14:28:01,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:28:01,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 22 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 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-09-13 14:28:01,450 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 22 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 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-09-13 14:28:01,450 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 22 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 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-09-13 14:28:01,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:01,451 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2021-09-13 14:28:01,451 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2021-09-13 14:28:01,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:01,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:01,451 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 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 32 states. [2021-09-13 14:28:01,452 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 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 32 states. [2021-09-13 14:28:01,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:01,453 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2021-09-13 14:28:01,453 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2021-09-13 14:28:01,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:01,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:01,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:28:01,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:28:01,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 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-09-13 14:28:01,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2021-09-13 14:28:01,454 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 10 [2021-09-13 14:28:01,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:28:01,454 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-09-13 14:28:01,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:01,455 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2021-09-13 14:28:01,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-09-13 14:28:01,455 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:28:01,455 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:28:01,463 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-09-13 14:28:01,655 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,SelfDestructingSolverStorable1 [2021-09-13 14:28:01,656 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:28:01,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:28:01,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1507424085, now seen corresponding path program 1 times [2021-09-13 14:28:01,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:28:01,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737815370] [2021-09-13 14:28:01,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:01,657 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:28:01,663 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:28:01,663 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1828961684] [2021-09-13 14:28:01,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:01,663 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:28:01,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:28:01,664 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-09-13 14:28:01,669 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-09-13 14:28:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:01,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2021-09-13 14:28:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:01,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:28:01,761 INFO L281 TraceCheckUtils]: 0: Hoare triple {320#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {325#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:01,761 INFO L281 TraceCheckUtils]: 1: Hoare triple {325#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~A~0, main_~R~0, main_~u~0, main_~v~0, main_~r~0;havoc main_~A~0;havoc main_~R~0;havoc main_~u~0;havoc main_~v~0;havoc main_~r~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~A~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~R~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if (main_~R~0 - 1) * (main_~R~0 - 1) < main_~A~0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {325#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:01,762 INFO L281 TraceCheckUtils]: 2: Hoare triple {325#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {325#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:01,762 INFO L281 TraceCheckUtils]: 3: Hoare triple {325#(<= ~counter~0 0)} assume_abort_if_not_#in~cond := (if 1 == (if main_~A~0 < 0 && 0 != main_~A~0 % 2 then main_~A~0 % 2 - 2 else main_~A~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {325#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:01,764 INFO L281 TraceCheckUtils]: 4: Hoare triple {325#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {325#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:01,764 INFO L281 TraceCheckUtils]: 5: Hoare triple {325#(<= ~counter~0 0)} main_~u~0 := 1 + 2 * main_~R~0;main_~v~0 := 1;main_~r~0 := main_~R~0 * main_~R~0 - main_~A~0; {325#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:01,765 INFO L281 TraceCheckUtils]: 6: Hoare triple {325#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {344#(<= |ULTIMATE.start_main_#t~post9| 0)} is VALID [2021-09-13 14:28:01,765 INFO L281 TraceCheckUtils]: 7: Hoare triple {344#(<= |ULTIMATE.start_main_#t~post9| 0)} assume !(main_#t~post9 < 20);havoc main_#t~post9; {321#false} is VALID [2021-09-13 14:28:01,765 INFO L281 TraceCheckUtils]: 8: Hoare triple {321#false} __VERIFIER_assert_#in~cond := (if 4 * main_~A~0 == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {321#false} is VALID [2021-09-13 14:28:01,765 INFO L281 TraceCheckUtils]: 9: Hoare triple {321#false} assume 0 == __VERIFIER_assert_~cond; {321#false} is VALID [2021-09-13 14:28:01,766 INFO L281 TraceCheckUtils]: 10: Hoare triple {321#false} assume !false; {321#false} is VALID [2021-09-13 14:28:01,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:28:01,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:28:01,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:28:01,768 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737815370] [2021-09-13 14:28:01,768 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:28:01,768 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828961684] [2021-09-13 14:28:01,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828961684] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:28:01,769 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:28:01,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-13 14:28:01,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787628229] [2021-09-13 14:28:01,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-09-13 14:28:01,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:28:01,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:01,786 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:28:01,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:28:01,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:28:01,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:28:01,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:28:01,788 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:01,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:01,872 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2021-09-13 14:28:01,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:28:01,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-09-13 14:28:01,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:28:01,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:01,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2021-09-13 14:28:01,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:01,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2021-09-13 14:28:01,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 25 transitions. [2021-09-13 14:28:01,890 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:28:01,891 INFO L225 Difference]: With dead ends: 28 [2021-09-13 14:28:01,891 INFO L226 Difference]: Without dead ends: 24 [2021-09-13 14:28:01,891 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.26ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:28:01,892 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.10ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.67ms IncrementalHoareTripleChecker+Time [2021-09-13 14:28:01,892 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 51 Unknown, 0 Unchecked, 1.10ms Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 40.67ms Time] [2021-09-13 14:28:01,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-09-13 14:28:01,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-09-13 14:28:01,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:28:01,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:01,902 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:01,903 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:01,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:01,904 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2021-09-13 14:28:01,904 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2021-09-13 14:28:01,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:01,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:01,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 24 states. [2021-09-13 14:28:01,905 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 24 states. [2021-09-13 14:28:01,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:01,905 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2021-09-13 14:28:01,906 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2021-09-13 14:28:01,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:01,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:01,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:28:01,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:28:01,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:01,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2021-09-13 14:28:01,907 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 11 [2021-09-13 14:28:01,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:28:01,907 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2021-09-13 14:28:01,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:01,908 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2021-09-13 14:28:01,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-09-13 14:28:01,908 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:28:01,908 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:28:01,927 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-09-13 14:28:02,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:28:02,123 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:28:02,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:28:02,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1189458428, now seen corresponding path program 1 times [2021-09-13 14:28:02,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:28:02,123 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752941158] [2021-09-13 14:28:02,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:02,123 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:28:02,129 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:28:02,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [827822609] [2021-09-13 14:28:02,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:02,129 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:28:02,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:28:02,138 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-09-13 14:28:02,140 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-09-13 14:28:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:02,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2021-09-13 14:28:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:02,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:28:02,316 INFO L281 TraceCheckUtils]: 0: Hoare triple {466#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {466#true} is VALID [2021-09-13 14:28:02,317 INFO L281 TraceCheckUtils]: 1: Hoare triple {466#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~A~0, main_~R~0, main_~u~0, main_~v~0, main_~r~0;havoc main_~A~0;havoc main_~R~0;havoc main_~u~0;havoc main_~v~0;havoc main_~r~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~A~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~R~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if (main_~R~0 - 1) * (main_~R~0 - 1) < main_~A~0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {466#true} is VALID [2021-09-13 14:28:02,317 INFO L281 TraceCheckUtils]: 2: Hoare triple {466#true} assume !(0 == assume_abort_if_not_~cond); {466#true} is VALID [2021-09-13 14:28:02,317 INFO L281 TraceCheckUtils]: 3: Hoare triple {466#true} assume_abort_if_not_#in~cond := (if 1 == (if main_~A~0 < 0 && 0 != main_~A~0 % 2 then main_~A~0 % 2 - 2 else main_~A~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {466#true} is VALID [2021-09-13 14:28:02,317 INFO L281 TraceCheckUtils]: 4: Hoare triple {466#true} assume !(0 == assume_abort_if_not_~cond); {466#true} is VALID [2021-09-13 14:28:02,317 INFO L281 TraceCheckUtils]: 5: Hoare triple {466#true} main_~u~0 := 1 + 2 * main_~R~0;main_~v~0 := 1;main_~r~0 := main_~R~0 * main_~R~0 - main_~A~0; {466#true} is VALID [2021-09-13 14:28:02,317 INFO L281 TraceCheckUtils]: 6: Hoare triple {466#true} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {466#true} is VALID [2021-09-13 14:28:02,318 INFO L281 TraceCheckUtils]: 7: Hoare triple {466#true} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {492#(or (and (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= (+ (* 2 ULTIMATE.start_main_~u~0) (* 4 ULTIMATE.start_main_~A~0) (* ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~v~0) (* 4 ULTIMATE.start_main_~r~0)) (+ (* ULTIMATE.start_main_~u~0 ULTIMATE.start_main_~u~0) (* 2 ULTIMATE.start_main_~v~0)))) (and (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (not (= (+ (* 2 ULTIMATE.start_main_~u~0) (* 4 ULTIMATE.start_main_~A~0) (* ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~v~0) (* 4 ULTIMATE.start_main_~r~0)) (+ (* ULTIMATE.start_main_~u~0 ULTIMATE.start_main_~u~0) (* 2 ULTIMATE.start_main_~v~0))))))} is VALID [2021-09-13 14:28:02,319 INFO L281 TraceCheckUtils]: 8: Hoare triple {492#(or (and (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= (+ (* 2 ULTIMATE.start_main_~u~0) (* 4 ULTIMATE.start_main_~A~0) (* ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~v~0) (* 4 ULTIMATE.start_main_~r~0)) (+ (* ULTIMATE.start_main_~u~0 ULTIMATE.start_main_~u~0) (* 2 ULTIMATE.start_main_~v~0)))) (and (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (not (= (+ (* 2 ULTIMATE.start_main_~u~0) (* 4 ULTIMATE.start_main_~A~0) (* ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~v~0) (* 4 ULTIMATE.start_main_~r~0)) (+ (* ULTIMATE.start_main_~u~0 ULTIMATE.start_main_~u~0) (* 2 ULTIMATE.start_main_~v~0))))))} assume !(0 == __VERIFIER_assert_~cond); {496#(= (+ (* 2 ULTIMATE.start_main_~u~0) (* 4 ULTIMATE.start_main_~A~0) (* ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~v~0) (* 4 ULTIMATE.start_main_~r~0)) (+ (* ULTIMATE.start_main_~u~0 ULTIMATE.start_main_~u~0) (* 2 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:28:02,319 INFO L281 TraceCheckUtils]: 9: Hoare triple {496#(= (+ (* 2 ULTIMATE.start_main_~u~0) (* 4 ULTIMATE.start_main_~A~0) (* ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~v~0) (* 4 ULTIMATE.start_main_~r~0)) (+ (* ULTIMATE.start_main_~u~0 ULTIMATE.start_main_~u~0) (* 2 ULTIMATE.start_main_~v~0)))} assume !(0 != main_~r~0); {500#(= (+ (* ULTIMATE.start_main_~u~0 ULTIMATE.start_main_~u~0) (* 2 ULTIMATE.start_main_~v~0)) (+ (* 2 ULTIMATE.start_main_~u~0) (* 4 ULTIMATE.start_main_~A~0) (* ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:28:02,320 INFO L281 TraceCheckUtils]: 10: Hoare triple {500#(= (+ (* ULTIMATE.start_main_~u~0 ULTIMATE.start_main_~u~0) (* 2 ULTIMATE.start_main_~v~0)) (+ (* 2 ULTIMATE.start_main_~u~0) (* 4 ULTIMATE.start_main_~A~0) (* ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~v~0)))} __VERIFIER_assert_#in~cond := (if 4 * main_~A~0 == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {504#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:28:02,320 INFO L281 TraceCheckUtils]: 11: Hoare triple {504#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {467#false} is VALID [2021-09-13 14:28:02,320 INFO L281 TraceCheckUtils]: 12: Hoare triple {467#false} assume !false; {467#false} is VALID [2021-09-13 14:28:02,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:28:02,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:28:02,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:28:02,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752941158] [2021-09-13 14:28:02,321 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:28:02,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827822609] [2021-09-13 14:28:02,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827822609] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:28:02,322 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:28:02,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-09-13 14:28:02,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246345955] [2021-09-13 14:28:02,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-09-13 14:28:02,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:28:02,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:02,331 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:28:02,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:28:02,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:28:02,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:28:02,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:28:02,332 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:02,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:02,601 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-09-13 14:28:02,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:28:02,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-09-13 14:28:02,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:28:02,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:02,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2021-09-13 14:28:02,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:02,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2021-09-13 14:28:02,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2021-09-13 14:28:02,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:28:02,625 INFO L225 Difference]: With dead ends: 28 [2021-09-13 14:28:02,625 INFO L226 Difference]: Without dead ends: 22 [2021-09-13 14:28:02,625 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 66.87ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:28:02,626 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 17 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 101.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.74ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 102.75ms IncrementalHoareTripleChecker+Time [2021-09-13 14:28:02,626 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 0 Invalid, 75 Unknown, 0 Unchecked, 0.74ms Time], IncrementalHoareTripleChecker [13 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 102.75ms Time] [2021-09-13 14:28:02,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-09-13 14:28:02,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2021-09-13 14:28:02,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:28:02,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 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-09-13 14:28:02,641 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 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-09-13 14:28:02,641 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 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-09-13 14:28:02,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:02,642 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2021-09-13 14:28:02,642 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2021-09-13 14:28:02,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:02,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:02,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 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) Second operand 22 states. [2021-09-13 14:28:02,643 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 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) Second operand 22 states. [2021-09-13 14:28:02,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:02,644 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2021-09-13 14:28:02,644 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2021-09-13 14:28:02,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:02,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:02,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:28:02,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:28:02,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 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-09-13 14:28:02,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-09-13 14:28:02,645 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2021-09-13 14:28:02,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:28:02,646 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-09-13 14:28:02,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:02,646 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2021-09-13 14:28:02,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-09-13 14:28:02,646 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:28:02,646 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:28:02,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-09-13 14:28:02,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:28:02,849 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:28:02,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:28:02,849 INFO L82 PathProgramCache]: Analyzing trace with hash -132612007, now seen corresponding path program 1 times [2021-09-13 14:28:02,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:28:02,849 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857117417] [2021-09-13 14:28:02,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:02,850 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:28:02,856 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:28:02,856 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1046729339] [2021-09-13 14:28:02,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:02,856 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:28:02,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:28:02,860 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-09-13 14:28:02,861 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-09-13 14:28:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:02,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2021-09-13 14:28:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:02,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:28:02,997 INFO L281 TraceCheckUtils]: 0: Hoare triple {612#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {617#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:02,997 INFO L281 TraceCheckUtils]: 1: Hoare triple {617#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~A~0, main_~R~0, main_~u~0, main_~v~0, main_~r~0;havoc main_~A~0;havoc main_~R~0;havoc main_~u~0;havoc main_~v~0;havoc main_~r~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~A~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~R~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if (main_~R~0 - 1) * (main_~R~0 - 1) < main_~A~0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {617#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:02,998 INFO L281 TraceCheckUtils]: 2: Hoare triple {617#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {617#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:02,998 INFO L281 TraceCheckUtils]: 3: Hoare triple {617#(<= ~counter~0 0)} assume_abort_if_not_#in~cond := (if 1 == (if main_~A~0 < 0 && 0 != main_~A~0 % 2 then main_~A~0 % 2 - 2 else main_~A~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {617#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:02,998 INFO L281 TraceCheckUtils]: 4: Hoare triple {617#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {617#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:02,998 INFO L281 TraceCheckUtils]: 5: Hoare triple {617#(<= ~counter~0 0)} main_~u~0 := 1 + 2 * main_~R~0;main_~v~0 := 1;main_~r~0 := main_~R~0 * main_~R~0 - main_~A~0; {617#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:03,002 INFO L281 TraceCheckUtils]: 6: Hoare triple {617#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {636#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:03,002 INFO L281 TraceCheckUtils]: 7: Hoare triple {636#(<= ~counter~0 1)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {636#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:03,003 INFO L281 TraceCheckUtils]: 8: Hoare triple {636#(<= ~counter~0 1)} assume !(0 == __VERIFIER_assert_~cond); {636#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:03,003 INFO L281 TraceCheckUtils]: 9: Hoare triple {636#(<= ~counter~0 1)} assume !!(0 != main_~r~0); {636#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:03,003 INFO L281 TraceCheckUtils]: 10: Hoare triple {636#(<= ~counter~0 1)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {636#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:03,004 INFO L281 TraceCheckUtils]: 11: Hoare triple {636#(<= ~counter~0 1)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {652#(<= |ULTIMATE.start_main_#t~post9| 1)} is VALID [2021-09-13 14:28:03,005 INFO L281 TraceCheckUtils]: 12: Hoare triple {652#(<= |ULTIMATE.start_main_#t~post9| 1)} assume !(main_#t~post9 < 20);havoc main_#t~post9; {613#false} is VALID [2021-09-13 14:28:03,006 INFO L281 TraceCheckUtils]: 13: Hoare triple {613#false} __VERIFIER_assert_#in~cond := (if 4 * main_~A~0 == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {613#false} is VALID [2021-09-13 14:28:03,006 INFO L281 TraceCheckUtils]: 14: Hoare triple {613#false} assume 0 == __VERIFIER_assert_~cond; {613#false} is VALID [2021-09-13 14:28:03,006 INFO L281 TraceCheckUtils]: 15: Hoare triple {613#false} assume !false; {613#false} is VALID [2021-09-13 14:28:03,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:28:03,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:28:03,129 INFO L281 TraceCheckUtils]: 15: Hoare triple {613#false} assume !false; {613#false} is VALID [2021-09-13 14:28:03,129 INFO L281 TraceCheckUtils]: 14: Hoare triple {613#false} assume 0 == __VERIFIER_assert_~cond; {613#false} is VALID [2021-09-13 14:28:03,129 INFO L281 TraceCheckUtils]: 13: Hoare triple {613#false} __VERIFIER_assert_#in~cond := (if 4 * main_~A~0 == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {613#false} is VALID [2021-09-13 14:28:03,129 INFO L281 TraceCheckUtils]: 12: Hoare triple {674#(< |ULTIMATE.start_main_#t~post9| 20)} assume !(main_#t~post9 < 20);havoc main_#t~post9; {613#false} is VALID [2021-09-13 14:28:03,130 INFO L281 TraceCheckUtils]: 11: Hoare triple {678#(< ~counter~0 20)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {674#(< |ULTIMATE.start_main_#t~post9| 20)} is VALID [2021-09-13 14:28:03,130 INFO L281 TraceCheckUtils]: 10: Hoare triple {678#(< ~counter~0 20)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {678#(< ~counter~0 20)} is VALID [2021-09-13 14:28:03,130 INFO L281 TraceCheckUtils]: 9: Hoare triple {678#(< ~counter~0 20)} assume !!(0 != main_~r~0); {678#(< ~counter~0 20)} is VALID [2021-09-13 14:28:03,131 INFO L281 TraceCheckUtils]: 8: Hoare triple {678#(< ~counter~0 20)} assume !(0 == __VERIFIER_assert_~cond); {678#(< ~counter~0 20)} is VALID [2021-09-13 14:28:03,131 INFO L281 TraceCheckUtils]: 7: Hoare triple {678#(< ~counter~0 20)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {678#(< ~counter~0 20)} is VALID [2021-09-13 14:28:03,131 INFO L281 TraceCheckUtils]: 6: Hoare triple {694#(< ~counter~0 19)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {678#(< ~counter~0 20)} is VALID [2021-09-13 14:28:03,132 INFO L281 TraceCheckUtils]: 5: Hoare triple {694#(< ~counter~0 19)} main_~u~0 := 1 + 2 * main_~R~0;main_~v~0 := 1;main_~r~0 := main_~R~0 * main_~R~0 - main_~A~0; {694#(< ~counter~0 19)} is VALID [2021-09-13 14:28:03,132 INFO L281 TraceCheckUtils]: 4: Hoare triple {694#(< ~counter~0 19)} assume !(0 == assume_abort_if_not_~cond); {694#(< ~counter~0 19)} is VALID [2021-09-13 14:28:03,132 INFO L281 TraceCheckUtils]: 3: Hoare triple {694#(< ~counter~0 19)} assume_abort_if_not_#in~cond := (if 1 == (if main_~A~0 < 0 && 0 != main_~A~0 % 2 then main_~A~0 % 2 - 2 else main_~A~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {694#(< ~counter~0 19)} is VALID [2021-09-13 14:28:03,133 INFO L281 TraceCheckUtils]: 2: Hoare triple {694#(< ~counter~0 19)} assume !(0 == assume_abort_if_not_~cond); {694#(< ~counter~0 19)} is VALID [2021-09-13 14:28:03,133 INFO L281 TraceCheckUtils]: 1: Hoare triple {694#(< ~counter~0 19)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~A~0, main_~R~0, main_~u~0, main_~v~0, main_~r~0;havoc main_~A~0;havoc main_~R~0;havoc main_~u~0;havoc main_~v~0;havoc main_~r~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~A~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~R~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if (main_~R~0 - 1) * (main_~R~0 - 1) < main_~A~0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {694#(< ~counter~0 19)} is VALID [2021-09-13 14:28:03,134 INFO L281 TraceCheckUtils]: 0: Hoare triple {612#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {694#(< ~counter~0 19)} is VALID [2021-09-13 14:28:03,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:28:03,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:28:03,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857117417] [2021-09-13 14:28:03,134 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:28:03,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046729339] [2021-09-13 14:28:03,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046729339] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:28:03,134 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:28:03,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-09-13 14:28:03,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899341123] [2021-09-13 14:28:03,135 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-09-13 14:28:03,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:28:03,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:03,154 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:28:03,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 14:28:03,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:28:03,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 14:28:03,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:28:03,155 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:03,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:03,333 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2021-09-13 14:28:03,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-09-13 14:28:03,333 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-09-13 14:28:03,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:28:03,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:03,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2021-09-13 14:28:03,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:03,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2021-09-13 14:28:03,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2021-09-13 14:28:03,366 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:28:03,367 INFO L225 Difference]: With dead ends: 36 [2021-09-13 14:28:03,367 INFO L226 Difference]: Without dead ends: 32 [2021-09-13 14:28:03,367 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 64.24ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:28:03,368 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 22 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.78ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.36ms IncrementalHoareTripleChecker+Time [2021-09-13 14:28:03,368 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 0 Invalid, 82 Unknown, 0 Unchecked, 0.78ms Time], IncrementalHoareTripleChecker [6 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 55.36ms Time] [2021-09-13 14:28:03,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-09-13 14:28:03,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-09-13 14:28:03,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:28:03,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second 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-09-13 14:28:03,400 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second 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-09-13 14:28:03,400 INFO L87 Difference]: Start difference. First operand 32 states. Second 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-09-13 14:28:03,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:03,401 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2021-09-13 14:28:03,401 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-09-13 14:28:03,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:03,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:03,402 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 32 states. [2021-09-13 14:28:03,402 INFO L87 Difference]: Start difference. First 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) Second operand 32 states. [2021-09-13 14:28:03,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:03,403 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2021-09-13 14:28:03,403 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-09-13 14:28:03,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:03,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:03,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:28:03,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:28:03,403 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-09-13 14:28:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-09-13 14:28:03,404 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 16 [2021-09-13 14:28:03,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:28:03,404 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-09-13 14:28:03,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:03,404 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-09-13 14:28:03,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-09-13 14:28:03,405 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:28:03,405 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:28:03,425 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-09-13 14:28:03,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:28:03,621 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:28:03,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:28:03,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1955278293, now seen corresponding path program 2 times [2021-09-13 14:28:03,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:28:03,621 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415325698] [2021-09-13 14:28:03,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:03,622 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:28:03,635 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:28:03,635 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1241845814] [2021-09-13 14:28:03,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-09-13 14:28:03,635 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:28:03,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:28:03,637 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-09-13 14:28:03,639 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-09-13 14:28:03,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-09-13 14:28:03,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:28:03,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 11 conjunts are in the unsatisfiable core [2021-09-13 14:28:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:03,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:28:03,946 INFO L281 TraceCheckUtils]: 0: Hoare triple {868#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {873#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:03,946 INFO L281 TraceCheckUtils]: 1: Hoare triple {873#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~A~0, main_~R~0, main_~u~0, main_~v~0, main_~r~0;havoc main_~A~0;havoc main_~R~0;havoc main_~u~0;havoc main_~v~0;havoc main_~r~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~A~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~R~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if (main_~R~0 - 1) * (main_~R~0 - 1) < main_~A~0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {873#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:03,947 INFO L281 TraceCheckUtils]: 2: Hoare triple {873#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {873#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:03,947 INFO L281 TraceCheckUtils]: 3: Hoare triple {873#(<= ~counter~0 0)} assume_abort_if_not_#in~cond := (if 1 == (if main_~A~0 < 0 && 0 != main_~A~0 % 2 then main_~A~0 % 2 - 2 else main_~A~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {873#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:03,947 INFO L281 TraceCheckUtils]: 4: Hoare triple {873#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {873#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:03,948 INFO L281 TraceCheckUtils]: 5: Hoare triple {873#(<= ~counter~0 0)} main_~u~0 := 1 + 2 * main_~R~0;main_~v~0 := 1;main_~r~0 := main_~R~0 * main_~R~0 - main_~A~0; {873#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:03,948 INFO L281 TraceCheckUtils]: 6: Hoare triple {873#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {892#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:03,948 INFO L281 TraceCheckUtils]: 7: Hoare triple {892#(<= ~counter~0 1)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {892#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:03,949 INFO L281 TraceCheckUtils]: 8: Hoare triple {892#(<= ~counter~0 1)} assume !(0 == __VERIFIER_assert_~cond); {892#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:03,949 INFO L281 TraceCheckUtils]: 9: Hoare triple {892#(<= ~counter~0 1)} assume !!(0 != main_~r~0); {892#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:03,949 INFO L281 TraceCheckUtils]: 10: Hoare triple {892#(<= ~counter~0 1)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {892#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:03,950 INFO L281 TraceCheckUtils]: 11: Hoare triple {892#(<= ~counter~0 1)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {908#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:03,950 INFO L281 TraceCheckUtils]: 12: Hoare triple {908#(<= ~counter~0 2)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {908#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:03,950 INFO L281 TraceCheckUtils]: 13: Hoare triple {908#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {908#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:03,951 INFO L281 TraceCheckUtils]: 14: Hoare triple {908#(<= ~counter~0 2)} assume !!(0 != main_~r~0); {908#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:03,951 INFO L281 TraceCheckUtils]: 15: Hoare triple {908#(<= ~counter~0 2)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {908#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:03,951 INFO L281 TraceCheckUtils]: 16: Hoare triple {908#(<= ~counter~0 2)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {924#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:03,952 INFO L281 TraceCheckUtils]: 17: Hoare triple {924#(<= ~counter~0 3)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {924#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:03,952 INFO L281 TraceCheckUtils]: 18: Hoare triple {924#(<= ~counter~0 3)} assume !(0 == __VERIFIER_assert_~cond); {924#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:03,952 INFO L281 TraceCheckUtils]: 19: Hoare triple {924#(<= ~counter~0 3)} assume !!(0 != main_~r~0); {924#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:03,953 INFO L281 TraceCheckUtils]: 20: Hoare triple {924#(<= ~counter~0 3)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {924#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:03,953 INFO L281 TraceCheckUtils]: 21: Hoare triple {924#(<= ~counter~0 3)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {940#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:03,953 INFO L281 TraceCheckUtils]: 22: Hoare triple {940#(<= ~counter~0 4)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {940#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:03,954 INFO L281 TraceCheckUtils]: 23: Hoare triple {940#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {940#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:03,954 INFO L281 TraceCheckUtils]: 24: Hoare triple {940#(<= ~counter~0 4)} assume !!(0 != main_~r~0); {940#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:03,954 INFO L281 TraceCheckUtils]: 25: Hoare triple {940#(<= ~counter~0 4)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {940#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:03,955 INFO L281 TraceCheckUtils]: 26: Hoare triple {940#(<= ~counter~0 4)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {956#(<= |ULTIMATE.start_main_#t~post9| 4)} is VALID [2021-09-13 14:28:03,955 INFO L281 TraceCheckUtils]: 27: Hoare triple {956#(<= |ULTIMATE.start_main_#t~post9| 4)} assume !(main_#t~post9 < 20);havoc main_#t~post9; {869#false} is VALID [2021-09-13 14:28:03,955 INFO L281 TraceCheckUtils]: 28: Hoare triple {869#false} __VERIFIER_assert_#in~cond := (if 4 * main_~A~0 == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {869#false} is VALID [2021-09-13 14:28:03,955 INFO L281 TraceCheckUtils]: 29: Hoare triple {869#false} assume 0 == __VERIFIER_assert_~cond; {869#false} is VALID [2021-09-13 14:28:03,956 INFO L281 TraceCheckUtils]: 30: Hoare triple {869#false} assume !false; {869#false} is VALID [2021-09-13 14:28:03,956 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:28:03,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:28:04,223 INFO L281 TraceCheckUtils]: 30: Hoare triple {869#false} assume !false; {869#false} is VALID [2021-09-13 14:28:04,223 INFO L281 TraceCheckUtils]: 29: Hoare triple {869#false} assume 0 == __VERIFIER_assert_~cond; {869#false} is VALID [2021-09-13 14:28:04,223 INFO L281 TraceCheckUtils]: 28: Hoare triple {869#false} __VERIFIER_assert_#in~cond := (if 4 * main_~A~0 == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {869#false} is VALID [2021-09-13 14:28:04,224 INFO L281 TraceCheckUtils]: 27: Hoare triple {978#(< |ULTIMATE.start_main_#t~post9| 20)} assume !(main_#t~post9 < 20);havoc main_#t~post9; {869#false} is VALID [2021-09-13 14:28:04,225 INFO L281 TraceCheckUtils]: 26: Hoare triple {982#(< ~counter~0 20)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {978#(< |ULTIMATE.start_main_#t~post9| 20)} is VALID [2021-09-13 14:28:04,225 INFO L281 TraceCheckUtils]: 25: Hoare triple {982#(< ~counter~0 20)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {982#(< ~counter~0 20)} is VALID [2021-09-13 14:28:04,226 INFO L281 TraceCheckUtils]: 24: Hoare triple {982#(< ~counter~0 20)} assume !!(0 != main_~r~0); {982#(< ~counter~0 20)} is VALID [2021-09-13 14:28:04,226 INFO L281 TraceCheckUtils]: 23: Hoare triple {982#(< ~counter~0 20)} assume !(0 == __VERIFIER_assert_~cond); {982#(< ~counter~0 20)} is VALID [2021-09-13 14:28:04,226 INFO L281 TraceCheckUtils]: 22: Hoare triple {982#(< ~counter~0 20)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {982#(< ~counter~0 20)} is VALID [2021-09-13 14:28:04,227 INFO L281 TraceCheckUtils]: 21: Hoare triple {998#(< ~counter~0 19)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {982#(< ~counter~0 20)} is VALID [2021-09-13 14:28:04,227 INFO L281 TraceCheckUtils]: 20: Hoare triple {998#(< ~counter~0 19)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {998#(< ~counter~0 19)} is VALID [2021-09-13 14:28:04,228 INFO L281 TraceCheckUtils]: 19: Hoare triple {998#(< ~counter~0 19)} assume !!(0 != main_~r~0); {998#(< ~counter~0 19)} is VALID [2021-09-13 14:28:04,228 INFO L281 TraceCheckUtils]: 18: Hoare triple {998#(< ~counter~0 19)} assume !(0 == __VERIFIER_assert_~cond); {998#(< ~counter~0 19)} is VALID [2021-09-13 14:28:04,228 INFO L281 TraceCheckUtils]: 17: Hoare triple {998#(< ~counter~0 19)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {998#(< ~counter~0 19)} is VALID [2021-09-13 14:28:04,229 INFO L281 TraceCheckUtils]: 16: Hoare triple {1014#(< ~counter~0 18)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {998#(< ~counter~0 19)} is VALID [2021-09-13 14:28:04,229 INFO L281 TraceCheckUtils]: 15: Hoare triple {1014#(< ~counter~0 18)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1014#(< ~counter~0 18)} is VALID [2021-09-13 14:28:04,230 INFO L281 TraceCheckUtils]: 14: Hoare triple {1014#(< ~counter~0 18)} assume !!(0 != main_~r~0); {1014#(< ~counter~0 18)} is VALID [2021-09-13 14:28:04,230 INFO L281 TraceCheckUtils]: 13: Hoare triple {1014#(< ~counter~0 18)} assume !(0 == __VERIFIER_assert_~cond); {1014#(< ~counter~0 18)} is VALID [2021-09-13 14:28:04,230 INFO L281 TraceCheckUtils]: 12: Hoare triple {1014#(< ~counter~0 18)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1014#(< ~counter~0 18)} is VALID [2021-09-13 14:28:04,231 INFO L281 TraceCheckUtils]: 11: Hoare triple {1030#(< ~counter~0 17)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1014#(< ~counter~0 18)} is VALID [2021-09-13 14:28:04,231 INFO L281 TraceCheckUtils]: 10: Hoare triple {1030#(< ~counter~0 17)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1030#(< ~counter~0 17)} is VALID [2021-09-13 14:28:04,232 INFO L281 TraceCheckUtils]: 9: Hoare triple {1030#(< ~counter~0 17)} assume !!(0 != main_~r~0); {1030#(< ~counter~0 17)} is VALID [2021-09-13 14:28:04,232 INFO L281 TraceCheckUtils]: 8: Hoare triple {1030#(< ~counter~0 17)} assume !(0 == __VERIFIER_assert_~cond); {1030#(< ~counter~0 17)} is VALID [2021-09-13 14:28:04,233 INFO L281 TraceCheckUtils]: 7: Hoare triple {1030#(< ~counter~0 17)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1030#(< ~counter~0 17)} is VALID [2021-09-13 14:28:04,233 INFO L281 TraceCheckUtils]: 6: Hoare triple {1046#(< ~counter~0 16)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1030#(< ~counter~0 17)} is VALID [2021-09-13 14:28:04,233 INFO L281 TraceCheckUtils]: 5: Hoare triple {1046#(< ~counter~0 16)} main_~u~0 := 1 + 2 * main_~R~0;main_~v~0 := 1;main_~r~0 := main_~R~0 * main_~R~0 - main_~A~0; {1046#(< ~counter~0 16)} is VALID [2021-09-13 14:28:04,234 INFO L281 TraceCheckUtils]: 4: Hoare triple {1046#(< ~counter~0 16)} assume !(0 == assume_abort_if_not_~cond); {1046#(< ~counter~0 16)} is VALID [2021-09-13 14:28:04,234 INFO L281 TraceCheckUtils]: 3: Hoare triple {1046#(< ~counter~0 16)} assume_abort_if_not_#in~cond := (if 1 == (if main_~A~0 < 0 && 0 != main_~A~0 % 2 then main_~A~0 % 2 - 2 else main_~A~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1046#(< ~counter~0 16)} is VALID [2021-09-13 14:28:04,234 INFO L281 TraceCheckUtils]: 2: Hoare triple {1046#(< ~counter~0 16)} assume !(0 == assume_abort_if_not_~cond); {1046#(< ~counter~0 16)} is VALID [2021-09-13 14:28:04,235 INFO L281 TraceCheckUtils]: 1: Hoare triple {1046#(< ~counter~0 16)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~A~0, main_~R~0, main_~u~0, main_~v~0, main_~r~0;havoc main_~A~0;havoc main_~R~0;havoc main_~u~0;havoc main_~v~0;havoc main_~r~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~A~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~R~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if (main_~R~0 - 1) * (main_~R~0 - 1) < main_~A~0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1046#(< ~counter~0 16)} is VALID [2021-09-13 14:28:04,235 INFO L281 TraceCheckUtils]: 0: Hoare triple {868#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {1046#(< ~counter~0 16)} is VALID [2021-09-13 14:28:04,235 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:28:04,235 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:28:04,236 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415325698] [2021-09-13 14:28:04,236 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:28:04,236 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241845814] [2021-09-13 14:28:04,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241845814] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:28:04,236 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:28:04,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2021-09-13 14:28:04,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396015493] [2021-09-13 14:28:04,236 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-09-13 14:28:04,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:28:04,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-09-13 14:28:04,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:28:04,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-09-13 14:28:04,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:28:04,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-09-13 14:28:04,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2021-09-13 14:28:04,284 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-09-13 14:28:04,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:04,579 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2021-09-13 14:28:04,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-09-13 14:28:04,579 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-09-13 14:28:04,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:28:04,579 INFO L82 GeneralOperation]: Start removeUnreachable. 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-09-13 14:28:04,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 81 transitions. [2021-09-13 14:28:04,580 INFO L82 GeneralOperation]: Start removeUnreachable. 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-09-13 14:28:04,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 81 transitions. [2021-09-13 14:28:04,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 81 transitions. [2021-09-13 14:28:04,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:28:04,632 INFO L225 Difference]: With dead ends: 66 [2021-09-13 14:28:04,632 INFO L226 Difference]: Without dead ends: 62 [2021-09-13 14:28:04,633 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 117.78ms TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2021-09-13 14:28:04,633 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 47 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 65.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.02ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 66.68ms IncrementalHoareTripleChecker+Time [2021-09-13 14:28:04,633 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 0 Invalid, 114 Unknown, 0 Unchecked, 1.02ms Time], IncrementalHoareTripleChecker [13 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 66.68ms Time] [2021-09-13 14:28:04,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-09-13 14:28:04,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-09-13 14:28:04,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:28:04,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 61 states have (on average 1.180327868852459) internal successors, (72), 61 states have internal predecessors, (72), 0 states have call successors, (0), 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-09-13 14:28:04,701 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 61 states have (on average 1.180327868852459) internal successors, (72), 61 states have internal predecessors, (72), 0 states have call successors, (0), 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-09-13 14:28:04,701 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 61 states have (on average 1.180327868852459) internal successors, (72), 61 states have internal predecessors, (72), 0 states have call successors, (0), 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-09-13 14:28:04,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:04,702 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2021-09-13 14:28:04,702 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2021-09-13 14:28:04,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:04,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:04,703 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 61 states have (on average 1.180327868852459) internal successors, (72), 61 states have internal predecessors, (72), 0 states have call successors, (0), 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 62 states. [2021-09-13 14:28:04,703 INFO L87 Difference]: Start difference. First operand has 62 states, 61 states have (on average 1.180327868852459) internal successors, (72), 61 states have internal predecessors, (72), 0 states have call successors, (0), 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 62 states. [2021-09-13 14:28:04,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:04,704 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2021-09-13 14:28:04,704 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2021-09-13 14:28:04,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:04,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:04,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:28:04,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:28:04,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.180327868852459) internal successors, (72), 61 states have internal predecessors, (72), 0 states have call successors, (0), 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-09-13 14:28:04,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2021-09-13 14:28:04,706 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 31 [2021-09-13 14:28:04,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:28:04,706 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2021-09-13 14:28:04,707 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-09-13 14:28:04,707 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2021-09-13 14:28:04,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-09-13 14:28:04,708 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:28:04,708 INFO L513 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:28:04,726 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-09-13 14:28:04,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:28:04,923 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:28:04,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:28:04,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1641990037, now seen corresponding path program 3 times [2021-09-13 14:28:04,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:28:04,924 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576105462] [2021-09-13 14:28:04,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:04,924 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:28:04,930 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:28:04,930 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1055374819] [2021-09-13 14:28:04,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-09-13 14:28:04,930 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:28:04,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:28:04,933 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-09-13 14:28:04,933 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-09-13 14:28:06,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-09-13 14:28:06,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:28:06,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 23 conjunts are in the unsatisfiable core [2021-09-13 14:28:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:06,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:28:06,997 INFO L281 TraceCheckUtils]: 0: Hoare triple {1376#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {1381#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:06,998 INFO L281 TraceCheckUtils]: 1: Hoare triple {1381#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~A~0, main_~R~0, main_~u~0, main_~v~0, main_~r~0;havoc main_~A~0;havoc main_~R~0;havoc main_~u~0;havoc main_~v~0;havoc main_~r~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~A~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~R~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if (main_~R~0 - 1) * (main_~R~0 - 1) < main_~A~0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1381#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:06,998 INFO L281 TraceCheckUtils]: 2: Hoare triple {1381#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {1381#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:06,999 INFO L281 TraceCheckUtils]: 3: Hoare triple {1381#(<= ~counter~0 0)} assume_abort_if_not_#in~cond := (if 1 == (if main_~A~0 < 0 && 0 != main_~A~0 % 2 then main_~A~0 % 2 - 2 else main_~A~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1381#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:06,999 INFO L281 TraceCheckUtils]: 4: Hoare triple {1381#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {1381#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:06,999 INFO L281 TraceCheckUtils]: 5: Hoare triple {1381#(<= ~counter~0 0)} main_~u~0 := 1 + 2 * main_~R~0;main_~v~0 := 1;main_~r~0 := main_~R~0 * main_~R~0 - main_~A~0; {1381#(<= ~counter~0 0)} is VALID [2021-09-13 14:28:07,000 INFO L281 TraceCheckUtils]: 6: Hoare triple {1381#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1400#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:07,000 INFO L281 TraceCheckUtils]: 7: Hoare triple {1400#(<= ~counter~0 1)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1400#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:07,000 INFO L281 TraceCheckUtils]: 8: Hoare triple {1400#(<= ~counter~0 1)} assume !(0 == __VERIFIER_assert_~cond); {1400#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:07,001 INFO L281 TraceCheckUtils]: 9: Hoare triple {1400#(<= ~counter~0 1)} assume !!(0 != main_~r~0); {1400#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:07,001 INFO L281 TraceCheckUtils]: 10: Hoare triple {1400#(<= ~counter~0 1)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1400#(<= ~counter~0 1)} is VALID [2021-09-13 14:28:07,001 INFO L281 TraceCheckUtils]: 11: Hoare triple {1400#(<= ~counter~0 1)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1416#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:07,002 INFO L281 TraceCheckUtils]: 12: Hoare triple {1416#(<= ~counter~0 2)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1416#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:07,002 INFO L281 TraceCheckUtils]: 13: Hoare triple {1416#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {1416#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:07,002 INFO L281 TraceCheckUtils]: 14: Hoare triple {1416#(<= ~counter~0 2)} assume !!(0 != main_~r~0); {1416#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:07,002 INFO L281 TraceCheckUtils]: 15: Hoare triple {1416#(<= ~counter~0 2)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1416#(<= ~counter~0 2)} is VALID [2021-09-13 14:28:07,003 INFO L281 TraceCheckUtils]: 16: Hoare triple {1416#(<= ~counter~0 2)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1432#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:07,003 INFO L281 TraceCheckUtils]: 17: Hoare triple {1432#(<= ~counter~0 3)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1432#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:07,003 INFO L281 TraceCheckUtils]: 18: Hoare triple {1432#(<= ~counter~0 3)} assume !(0 == __VERIFIER_assert_~cond); {1432#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:07,004 INFO L281 TraceCheckUtils]: 19: Hoare triple {1432#(<= ~counter~0 3)} assume !!(0 != main_~r~0); {1432#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:07,004 INFO L281 TraceCheckUtils]: 20: Hoare triple {1432#(<= ~counter~0 3)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1432#(<= ~counter~0 3)} is VALID [2021-09-13 14:28:07,004 INFO L281 TraceCheckUtils]: 21: Hoare triple {1432#(<= ~counter~0 3)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1448#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:07,005 INFO L281 TraceCheckUtils]: 22: Hoare triple {1448#(<= ~counter~0 4)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1448#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:07,005 INFO L281 TraceCheckUtils]: 23: Hoare triple {1448#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {1448#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:07,005 INFO L281 TraceCheckUtils]: 24: Hoare triple {1448#(<= ~counter~0 4)} assume !!(0 != main_~r~0); {1448#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:07,005 INFO L281 TraceCheckUtils]: 25: Hoare triple {1448#(<= ~counter~0 4)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1448#(<= ~counter~0 4)} is VALID [2021-09-13 14:28:07,006 INFO L281 TraceCheckUtils]: 26: Hoare triple {1448#(<= ~counter~0 4)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1464#(<= ~counter~0 5)} is VALID [2021-09-13 14:28:07,006 INFO L281 TraceCheckUtils]: 27: Hoare triple {1464#(<= ~counter~0 5)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1464#(<= ~counter~0 5)} is VALID [2021-09-13 14:28:07,006 INFO L281 TraceCheckUtils]: 28: Hoare triple {1464#(<= ~counter~0 5)} assume !(0 == __VERIFIER_assert_~cond); {1464#(<= ~counter~0 5)} is VALID [2021-09-13 14:28:07,007 INFO L281 TraceCheckUtils]: 29: Hoare triple {1464#(<= ~counter~0 5)} assume !!(0 != main_~r~0); {1464#(<= ~counter~0 5)} is VALID [2021-09-13 14:28:07,007 INFO L281 TraceCheckUtils]: 30: Hoare triple {1464#(<= ~counter~0 5)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1464#(<= ~counter~0 5)} is VALID [2021-09-13 14:28:07,007 INFO L281 TraceCheckUtils]: 31: Hoare triple {1464#(<= ~counter~0 5)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1480#(<= ~counter~0 6)} is VALID [2021-09-13 14:28:07,008 INFO L281 TraceCheckUtils]: 32: Hoare triple {1480#(<= ~counter~0 6)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1480#(<= ~counter~0 6)} is VALID [2021-09-13 14:28:07,016 INFO L281 TraceCheckUtils]: 33: Hoare triple {1480#(<= ~counter~0 6)} assume !(0 == __VERIFIER_assert_~cond); {1480#(<= ~counter~0 6)} is VALID [2021-09-13 14:28:07,017 INFO L281 TraceCheckUtils]: 34: Hoare triple {1480#(<= ~counter~0 6)} assume !!(0 != main_~r~0); {1480#(<= ~counter~0 6)} is VALID [2021-09-13 14:28:07,017 INFO L281 TraceCheckUtils]: 35: Hoare triple {1480#(<= ~counter~0 6)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1480#(<= ~counter~0 6)} is VALID [2021-09-13 14:28:07,018 INFO L281 TraceCheckUtils]: 36: Hoare triple {1480#(<= ~counter~0 6)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1496#(<= ~counter~0 7)} is VALID [2021-09-13 14:28:07,018 INFO L281 TraceCheckUtils]: 37: Hoare triple {1496#(<= ~counter~0 7)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1496#(<= ~counter~0 7)} is VALID [2021-09-13 14:28:07,019 INFO L281 TraceCheckUtils]: 38: Hoare triple {1496#(<= ~counter~0 7)} assume !(0 == __VERIFIER_assert_~cond); {1496#(<= ~counter~0 7)} is VALID [2021-09-13 14:28:07,019 INFO L281 TraceCheckUtils]: 39: Hoare triple {1496#(<= ~counter~0 7)} assume !!(0 != main_~r~0); {1496#(<= ~counter~0 7)} is VALID [2021-09-13 14:28:07,019 INFO L281 TraceCheckUtils]: 40: Hoare triple {1496#(<= ~counter~0 7)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1496#(<= ~counter~0 7)} is VALID [2021-09-13 14:28:07,020 INFO L281 TraceCheckUtils]: 41: Hoare triple {1496#(<= ~counter~0 7)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1512#(<= ~counter~0 8)} is VALID [2021-09-13 14:28:07,020 INFO L281 TraceCheckUtils]: 42: Hoare triple {1512#(<= ~counter~0 8)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1512#(<= ~counter~0 8)} is VALID [2021-09-13 14:28:07,021 INFO L281 TraceCheckUtils]: 43: Hoare triple {1512#(<= ~counter~0 8)} assume !(0 == __VERIFIER_assert_~cond); {1512#(<= ~counter~0 8)} is VALID [2021-09-13 14:28:07,021 INFO L281 TraceCheckUtils]: 44: Hoare triple {1512#(<= ~counter~0 8)} assume !!(0 != main_~r~0); {1512#(<= ~counter~0 8)} is VALID [2021-09-13 14:28:07,021 INFO L281 TraceCheckUtils]: 45: Hoare triple {1512#(<= ~counter~0 8)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1512#(<= ~counter~0 8)} is VALID [2021-09-13 14:28:07,022 INFO L281 TraceCheckUtils]: 46: Hoare triple {1512#(<= ~counter~0 8)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1528#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:07,022 INFO L281 TraceCheckUtils]: 47: Hoare triple {1528#(<= ~counter~0 9)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1528#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:07,022 INFO L281 TraceCheckUtils]: 48: Hoare triple {1528#(<= ~counter~0 9)} assume !(0 == __VERIFIER_assert_~cond); {1528#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:07,023 INFO L281 TraceCheckUtils]: 49: Hoare triple {1528#(<= ~counter~0 9)} assume !!(0 != main_~r~0); {1528#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:07,023 INFO L281 TraceCheckUtils]: 50: Hoare triple {1528#(<= ~counter~0 9)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1528#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:07,023 INFO L281 TraceCheckUtils]: 51: Hoare triple {1528#(<= ~counter~0 9)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1544#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:07,024 INFO L281 TraceCheckUtils]: 52: Hoare triple {1544#(<= ~counter~0 10)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1544#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:07,024 INFO L281 TraceCheckUtils]: 53: Hoare triple {1544#(<= ~counter~0 10)} assume !(0 == __VERIFIER_assert_~cond); {1544#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:07,024 INFO L281 TraceCheckUtils]: 54: Hoare triple {1544#(<= ~counter~0 10)} assume !!(0 != main_~r~0); {1544#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:07,025 INFO L281 TraceCheckUtils]: 55: Hoare triple {1544#(<= ~counter~0 10)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1544#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:07,025 INFO L281 TraceCheckUtils]: 56: Hoare triple {1544#(<= ~counter~0 10)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1560#(<= |ULTIMATE.start_main_#t~post9| 10)} is VALID [2021-09-13 14:28:07,029 INFO L281 TraceCheckUtils]: 57: Hoare triple {1560#(<= |ULTIMATE.start_main_#t~post9| 10)} assume !(main_#t~post9 < 20);havoc main_#t~post9; {1377#false} is VALID [2021-09-13 14:28:07,029 INFO L281 TraceCheckUtils]: 58: Hoare triple {1377#false} __VERIFIER_assert_#in~cond := (if 4 * main_~A~0 == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1377#false} is VALID [2021-09-13 14:28:07,029 INFO L281 TraceCheckUtils]: 59: Hoare triple {1377#false} assume 0 == __VERIFIER_assert_~cond; {1377#false} is VALID [2021-09-13 14:28:07,029 INFO L281 TraceCheckUtils]: 60: Hoare triple {1377#false} assume !false; {1377#false} is VALID [2021-09-13 14:28:07,029 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:28:07,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:28:07,585 INFO L281 TraceCheckUtils]: 60: Hoare triple {1377#false} assume !false; {1377#false} is VALID [2021-09-13 14:28:07,586 INFO L281 TraceCheckUtils]: 59: Hoare triple {1377#false} assume 0 == __VERIFIER_assert_~cond; {1377#false} is VALID [2021-09-13 14:28:07,586 INFO L281 TraceCheckUtils]: 58: Hoare triple {1377#false} __VERIFIER_assert_#in~cond := (if 4 * main_~A~0 == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1377#false} is VALID [2021-09-13 14:28:07,586 INFO L281 TraceCheckUtils]: 57: Hoare triple {1582#(< |ULTIMATE.start_main_#t~post9| 20)} assume !(main_#t~post9 < 20);havoc main_#t~post9; {1377#false} is VALID [2021-09-13 14:28:07,586 INFO L281 TraceCheckUtils]: 56: Hoare triple {1586#(< ~counter~0 20)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1582#(< |ULTIMATE.start_main_#t~post9| 20)} is VALID [2021-09-13 14:28:07,587 INFO L281 TraceCheckUtils]: 55: Hoare triple {1586#(< ~counter~0 20)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1586#(< ~counter~0 20)} is VALID [2021-09-13 14:28:07,596 INFO L281 TraceCheckUtils]: 54: Hoare triple {1586#(< ~counter~0 20)} assume !!(0 != main_~r~0); {1586#(< ~counter~0 20)} is VALID [2021-09-13 14:28:07,597 INFO L281 TraceCheckUtils]: 53: Hoare triple {1586#(< ~counter~0 20)} assume !(0 == __VERIFIER_assert_~cond); {1586#(< ~counter~0 20)} is VALID [2021-09-13 14:28:07,597 INFO L281 TraceCheckUtils]: 52: Hoare triple {1586#(< ~counter~0 20)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1586#(< ~counter~0 20)} is VALID [2021-09-13 14:28:07,597 INFO L281 TraceCheckUtils]: 51: Hoare triple {1602#(< ~counter~0 19)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1586#(< ~counter~0 20)} is VALID [2021-09-13 14:28:07,598 INFO L281 TraceCheckUtils]: 50: Hoare triple {1602#(< ~counter~0 19)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1602#(< ~counter~0 19)} is VALID [2021-09-13 14:28:07,598 INFO L281 TraceCheckUtils]: 49: Hoare triple {1602#(< ~counter~0 19)} assume !!(0 != main_~r~0); {1602#(< ~counter~0 19)} is VALID [2021-09-13 14:28:07,598 INFO L281 TraceCheckUtils]: 48: Hoare triple {1602#(< ~counter~0 19)} assume !(0 == __VERIFIER_assert_~cond); {1602#(< ~counter~0 19)} is VALID [2021-09-13 14:28:07,599 INFO L281 TraceCheckUtils]: 47: Hoare triple {1602#(< ~counter~0 19)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1602#(< ~counter~0 19)} is VALID [2021-09-13 14:28:07,599 INFO L281 TraceCheckUtils]: 46: Hoare triple {1618#(< ~counter~0 18)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1602#(< ~counter~0 19)} is VALID [2021-09-13 14:28:07,599 INFO L281 TraceCheckUtils]: 45: Hoare triple {1618#(< ~counter~0 18)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1618#(< ~counter~0 18)} is VALID [2021-09-13 14:28:07,600 INFO L281 TraceCheckUtils]: 44: Hoare triple {1618#(< ~counter~0 18)} assume !!(0 != main_~r~0); {1618#(< ~counter~0 18)} is VALID [2021-09-13 14:28:07,600 INFO L281 TraceCheckUtils]: 43: Hoare triple {1618#(< ~counter~0 18)} assume !(0 == __VERIFIER_assert_~cond); {1618#(< ~counter~0 18)} is VALID [2021-09-13 14:28:07,600 INFO L281 TraceCheckUtils]: 42: Hoare triple {1618#(< ~counter~0 18)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1618#(< ~counter~0 18)} is VALID [2021-09-13 14:28:07,601 INFO L281 TraceCheckUtils]: 41: Hoare triple {1634#(< ~counter~0 17)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1618#(< ~counter~0 18)} is VALID [2021-09-13 14:28:07,601 INFO L281 TraceCheckUtils]: 40: Hoare triple {1634#(< ~counter~0 17)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1634#(< ~counter~0 17)} is VALID [2021-09-13 14:28:07,601 INFO L281 TraceCheckUtils]: 39: Hoare triple {1634#(< ~counter~0 17)} assume !!(0 != main_~r~0); {1634#(< ~counter~0 17)} is VALID [2021-09-13 14:28:07,601 INFO L281 TraceCheckUtils]: 38: Hoare triple {1634#(< ~counter~0 17)} assume !(0 == __VERIFIER_assert_~cond); {1634#(< ~counter~0 17)} is VALID [2021-09-13 14:28:07,602 INFO L281 TraceCheckUtils]: 37: Hoare triple {1634#(< ~counter~0 17)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1634#(< ~counter~0 17)} is VALID [2021-09-13 14:28:07,602 INFO L281 TraceCheckUtils]: 36: Hoare triple {1650#(< ~counter~0 16)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1634#(< ~counter~0 17)} is VALID [2021-09-13 14:28:07,602 INFO L281 TraceCheckUtils]: 35: Hoare triple {1650#(< ~counter~0 16)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1650#(< ~counter~0 16)} is VALID [2021-09-13 14:28:07,603 INFO L281 TraceCheckUtils]: 34: Hoare triple {1650#(< ~counter~0 16)} assume !!(0 != main_~r~0); {1650#(< ~counter~0 16)} is VALID [2021-09-13 14:28:07,603 INFO L281 TraceCheckUtils]: 33: Hoare triple {1650#(< ~counter~0 16)} assume !(0 == __VERIFIER_assert_~cond); {1650#(< ~counter~0 16)} is VALID [2021-09-13 14:28:07,603 INFO L281 TraceCheckUtils]: 32: Hoare triple {1650#(< ~counter~0 16)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1650#(< ~counter~0 16)} is VALID [2021-09-13 14:28:07,604 INFO L281 TraceCheckUtils]: 31: Hoare triple {1666#(< ~counter~0 15)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1650#(< ~counter~0 16)} is VALID [2021-09-13 14:28:07,604 INFO L281 TraceCheckUtils]: 30: Hoare triple {1666#(< ~counter~0 15)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1666#(< ~counter~0 15)} is VALID [2021-09-13 14:28:07,604 INFO L281 TraceCheckUtils]: 29: Hoare triple {1666#(< ~counter~0 15)} assume !!(0 != main_~r~0); {1666#(< ~counter~0 15)} is VALID [2021-09-13 14:28:07,605 INFO L281 TraceCheckUtils]: 28: Hoare triple {1666#(< ~counter~0 15)} assume !(0 == __VERIFIER_assert_~cond); {1666#(< ~counter~0 15)} is VALID [2021-09-13 14:28:07,605 INFO L281 TraceCheckUtils]: 27: Hoare triple {1666#(< ~counter~0 15)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1666#(< ~counter~0 15)} is VALID [2021-09-13 14:28:07,605 INFO L281 TraceCheckUtils]: 26: Hoare triple {1682#(< ~counter~0 14)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1666#(< ~counter~0 15)} is VALID [2021-09-13 14:28:07,606 INFO L281 TraceCheckUtils]: 25: Hoare triple {1682#(< ~counter~0 14)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1682#(< ~counter~0 14)} is VALID [2021-09-13 14:28:07,606 INFO L281 TraceCheckUtils]: 24: Hoare triple {1682#(< ~counter~0 14)} assume !!(0 != main_~r~0); {1682#(< ~counter~0 14)} is VALID [2021-09-13 14:28:07,606 INFO L281 TraceCheckUtils]: 23: Hoare triple {1682#(< ~counter~0 14)} assume !(0 == __VERIFIER_assert_~cond); {1682#(< ~counter~0 14)} is VALID [2021-09-13 14:28:07,606 INFO L281 TraceCheckUtils]: 22: Hoare triple {1682#(< ~counter~0 14)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1682#(< ~counter~0 14)} is VALID [2021-09-13 14:28:07,607 INFO L281 TraceCheckUtils]: 21: Hoare triple {1698#(< ~counter~0 13)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1682#(< ~counter~0 14)} is VALID [2021-09-13 14:28:07,607 INFO L281 TraceCheckUtils]: 20: Hoare triple {1698#(< ~counter~0 13)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1698#(< ~counter~0 13)} is VALID [2021-09-13 14:28:07,607 INFO L281 TraceCheckUtils]: 19: Hoare triple {1698#(< ~counter~0 13)} assume !!(0 != main_~r~0); {1698#(< ~counter~0 13)} is VALID [2021-09-13 14:28:07,608 INFO L281 TraceCheckUtils]: 18: Hoare triple {1698#(< ~counter~0 13)} assume !(0 == __VERIFIER_assert_~cond); {1698#(< ~counter~0 13)} is VALID [2021-09-13 14:28:07,608 INFO L281 TraceCheckUtils]: 17: Hoare triple {1698#(< ~counter~0 13)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1698#(< ~counter~0 13)} is VALID [2021-09-13 14:28:07,613 INFO L281 TraceCheckUtils]: 16: Hoare triple {1714#(< ~counter~0 12)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1698#(< ~counter~0 13)} is VALID [2021-09-13 14:28:07,613 INFO L281 TraceCheckUtils]: 15: Hoare triple {1714#(< ~counter~0 12)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1714#(< ~counter~0 12)} is VALID [2021-09-13 14:28:07,613 INFO L281 TraceCheckUtils]: 14: Hoare triple {1714#(< ~counter~0 12)} assume !!(0 != main_~r~0); {1714#(< ~counter~0 12)} is VALID [2021-09-13 14:28:07,614 INFO L281 TraceCheckUtils]: 13: Hoare triple {1714#(< ~counter~0 12)} assume !(0 == __VERIFIER_assert_~cond); {1714#(< ~counter~0 12)} is VALID [2021-09-13 14:28:07,614 INFO L281 TraceCheckUtils]: 12: Hoare triple {1714#(< ~counter~0 12)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1714#(< ~counter~0 12)} is VALID [2021-09-13 14:28:07,614 INFO L281 TraceCheckUtils]: 11: Hoare triple {1544#(<= ~counter~0 10)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1714#(< ~counter~0 12)} is VALID [2021-09-13 14:28:07,615 INFO L281 TraceCheckUtils]: 10: Hoare triple {1544#(<= ~counter~0 10)} assume main_~r~0 > 0;main_~r~0 := main_~r~0 - main_~v~0;main_~v~0 := 2 + main_~v~0; {1544#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:07,615 INFO L281 TraceCheckUtils]: 9: Hoare triple {1544#(<= ~counter~0 10)} assume !!(0 != main_~r~0); {1544#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:07,615 INFO L281 TraceCheckUtils]: 8: Hoare triple {1544#(<= ~counter~0 10)} assume !(0 == __VERIFIER_assert_~cond); {1544#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:07,615 INFO L281 TraceCheckUtils]: 7: Hoare triple {1544#(<= ~counter~0 10)} assume !!(main_#t~post9 < 20);havoc main_#t~post9;__VERIFIER_assert_#in~cond := (if 4 * (main_~A~0 + main_~r~0) == main_~u~0 * main_~u~0 - main_~v~0 * main_~v~0 - 2 * main_~u~0 + 2 * main_~v~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1544#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:07,616 INFO L281 TraceCheckUtils]: 6: Hoare triple {1528#(<= ~counter~0 9)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1544#(<= ~counter~0 10)} is VALID [2021-09-13 14:28:07,616 INFO L281 TraceCheckUtils]: 5: Hoare triple {1528#(<= ~counter~0 9)} main_~u~0 := 1 + 2 * main_~R~0;main_~v~0 := 1;main_~r~0 := main_~R~0 * main_~R~0 - main_~A~0; {1528#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:07,618 INFO L281 TraceCheckUtils]: 4: Hoare triple {1528#(<= ~counter~0 9)} assume !(0 == assume_abort_if_not_~cond); {1528#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:07,619 INFO L281 TraceCheckUtils]: 3: Hoare triple {1528#(<= ~counter~0 9)} assume_abort_if_not_#in~cond := (if 1 == (if main_~A~0 < 0 && 0 != main_~A~0 % 2 then main_~A~0 % 2 - 2 else main_~A~0 % 2) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1528#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:07,619 INFO L281 TraceCheckUtils]: 2: Hoare triple {1528#(<= ~counter~0 9)} assume !(0 == assume_abort_if_not_~cond); {1528#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:07,619 INFO L281 TraceCheckUtils]: 1: Hoare triple {1528#(<= ~counter~0 9)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post9, main_~A~0, main_~R~0, main_~u~0, main_~v~0, main_~r~0;havoc main_~A~0;havoc main_~R~0;havoc main_~u~0;havoc main_~v~0;havoc main_~r~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~A~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~R~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if (main_~R~0 - 1) * (main_~R~0 - 1) < main_~A~0 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1528#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:07,620 INFO L281 TraceCheckUtils]: 0: Hoare triple {1376#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(13);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {1528#(<= ~counter~0 9)} is VALID [2021-09-13 14:28:07,620 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:28:07,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:28:07,620 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576105462] [2021-09-13 14:28:07,621 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:28:07,621 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055374819] [2021-09-13 14:28:07,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055374819] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:28:07,621 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:28:07,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2021-09-13 14:28:07,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442191092] [2021-09-13 14:28:07,621 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.75) internal successors, (114), 23 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-09-13 14:28:07,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:28:07,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 4.75) internal successors, (114), 23 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:07,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:28:07,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-09-13 14:28:07,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:28:07,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-09-13 14:28:07,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2021-09-13 14:28:07,698 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 24 states, 24 states have (on average 4.75) internal successors, (114), 23 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:08,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:08,247 INFO L93 Difference]: Finished difference Result 116 states and 145 transitions. [2021-09-13 14:28:08,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-09-13 14:28:08,247 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.75) internal successors, (114), 23 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-09-13 14:28:08,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:28:08,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.75) internal successors, (114), 23 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:08,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 145 transitions. [2021-09-13 14:28:08,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.75) internal successors, (114), 23 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:08,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 145 transitions. [2021-09-13 14:28:08,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 145 transitions. [2021-09-13 14:28:08,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:28:08,338 INFO L225 Difference]: With dead ends: 116 [2021-09-13 14:28:08,338 INFO L226 Difference]: Without dead ends: 112 [2021-09-13 14:28:08,339 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 367.24ms TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2021-09-13 14:28:08,342 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 55 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 119.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.12ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 120.47ms IncrementalHoareTripleChecker+Time [2021-09-13 14:28:08,343 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 0 Invalid, 186 Unknown, 0 Unchecked, 1.12ms Time], IncrementalHoareTripleChecker [2 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 120.47ms Time] [2021-09-13 14:28:08,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-09-13 14:28:08,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2021-09-13 14:28:08,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:28:08,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 112 states, 111 states have (on average 1.1891891891891893) internal successors, (132), 111 states have internal predecessors, (132), 0 states have call successors, (0), 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-09-13 14:28:08,461 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 112 states, 111 states have (on average 1.1891891891891893) internal successors, (132), 111 states have internal predecessors, (132), 0 states have call successors, (0), 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-09-13 14:28:08,461 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 112 states, 111 states have (on average 1.1891891891891893) internal successors, (132), 111 states have internal predecessors, (132), 0 states have call successors, (0), 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-09-13 14:28:08,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:08,464 INFO L93 Difference]: Finished difference Result 112 states and 132 transitions. [2021-09-13 14:28:08,464 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 132 transitions. [2021-09-13 14:28:08,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:08,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:08,467 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 111 states have (on average 1.1891891891891893) internal successors, (132), 111 states have internal predecessors, (132), 0 states have call successors, (0), 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 112 states. [2021-09-13 14:28:08,467 INFO L87 Difference]: Start difference. First operand has 112 states, 111 states have (on average 1.1891891891891893) internal successors, (132), 111 states have internal predecessors, (132), 0 states have call successors, (0), 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 112 states. [2021-09-13 14:28:08,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:08,469 INFO L93 Difference]: Finished difference Result 112 states and 132 transitions. [2021-09-13 14:28:08,469 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 132 transitions. [2021-09-13 14:28:08,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:08,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:08,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:28:08,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:28:08,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.1891891891891893) internal successors, (132), 111 states have internal predecessors, (132), 0 states have call successors, (0), 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-09-13 14:28:08,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 132 transitions. [2021-09-13 14:28:08,472 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 132 transitions. Word has length 61 [2021-09-13 14:28:08,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:28:08,474 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 132 transitions. [2021-09-13 14:28:08,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.75) internal successors, (114), 23 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:28:08,474 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 132 transitions. [2021-09-13 14:28:08,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-09-13 14:28:08,477 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:28:08,477 INFO L513 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:28:08,485 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-09-13 14:28:08,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:28:08,682 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:28:08,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:28:08,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1521977301, now seen corresponding path program 4 times [2021-09-13 14:28:08,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:28:08,683 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235841814] [2021-09-13 14:28:08,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:08,683 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:28:08,693 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:28:08,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [103442725] [2021-09-13 14:28:08,693 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-09-13 14:28:08,693 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:28:08,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:28:08,694 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-09-13 14:28:08,695 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-09-13 14:28:08,950 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-09-13 14:28:08,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-09-13 14:28:08,951 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-09-13 14:28:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-09-13 14:28:09,123 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-09-13 14:28:09,123 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-09-13 14:28:09,124 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-09-13 14:28:09,125 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-09-13 14:28:09,133 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-09-13 14:28:09,332 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,SelfDestructingSolverStorable7 [2021-09-13 14:28:09,337 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-13 14:28:09,412 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2021-09-13 14:28:09,412 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2021-09-13 14:28:09,412 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2021-09-13 14:28:09,412 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2021-09-13 14:28:09,412 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2021-09-13 14:28:09,412 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2021-09-13 14:28:09,412 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2021-09-13 14:28:09,412 WARN L170 areAnnotationChecker]: L8-1 has no Hoare annotation [2021-09-13 14:28:09,412 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2021-09-13 14:28:09,413 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2021-09-13 14:28:09,413 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2021-09-13 14:28:09,413 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2021-09-13 14:28:09,413 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2021-09-13 14:28:09,413 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2021-09-13 14:28:09,413 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2021-09-13 14:28:09,413 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2021-09-13 14:28:09,413 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2021-09-13 14:28:09,413 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2021-09-13 14:28:09,413 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2021-09-13 14:28:09,413 WARN L170 areAnnotationChecker]: L12-5 has no Hoare annotation [2021-09-13 14:28:09,413 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2021-09-13 14:28:09,414 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2021-09-13 14:28:09,414 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2021-09-13 14:28:09,414 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2021-09-13 14:28:09,414 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2021-09-13 14:28:09,414 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2021-09-13 14:28:09,414 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2021-09-13 14:28:09,414 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:28:09,414 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2021-09-13 14:28:09,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 02:28:09 BoogieIcfgContainer [2021-09-13 14:28:09,415 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-13 14:28:09,415 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-13 14:28:09,415 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-13 14:28:09,415 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-13 14:28:09,416 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:27:44" (3/4) ... [2021-09-13 14:28:09,421 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-09-13 14:28:09,506 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-09-13 14:28:09,506 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-13 14:28:09,507 INFO L158 Benchmark]: Toolchain (without parser) took 25519.74ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 48.6MB in the beginning and 57.1MB in the end (delta: -8.5MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2021-09-13 14:28:09,507 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 67.1MB. Free memory was 50.1MB in the beginning and 50.0MB in the end (delta: 45.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:28:09,508 INFO L158 Benchmark]: CACSL2BoogieTranslator took 140.91ms. Allocated memory is still 67.1MB. Free memory was 48.4MB in the beginning and 38.2MB in the end (delta: 10.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-09-13 14:28:09,508 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.06ms. Allocated memory is still 67.1MB. Free memory was 38.2MB in the beginning and 51.4MB in the end (delta: -13.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:28:09,508 INFO L158 Benchmark]: Boogie Preprocessor took 29.21ms. Allocated memory is still 67.1MB. Free memory was 51.4MB in the beginning and 50.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:28:09,508 INFO L158 Benchmark]: RCFGBuilder took 236.18ms. Allocated memory is still 67.1MB. Free memory was 50.2MB in the beginning and 40.1MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-09-13 14:28:09,508 INFO L158 Benchmark]: TraceAbstraction took 24973.53ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 39.7MB in the beginning and 34.5MB in the end (delta: 5.2MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2021-09-13 14:28:09,509 INFO L158 Benchmark]: Witness Printer took 91.37ms. Allocated memory is still 81.8MB. Free memory was 34.5MB in the beginning and 57.1MB in the end (delta: -22.7MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2021-09-13 14:28:09,510 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 67.1MB. Free memory was 50.1MB in the beginning and 50.0MB in the end (delta: 45.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 140.91ms. Allocated memory is still 67.1MB. Free memory was 48.4MB in the beginning and 38.2MB in the end (delta: 10.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.06ms. Allocated memory is still 67.1MB. Free memory was 38.2MB in the beginning and 51.4MB in the end (delta: -13.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.21ms. Allocated memory is still 67.1MB. Free memory was 51.4MB in the beginning and 50.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 236.18ms. Allocated memory is still 67.1MB. Free memory was 50.2MB in the beginning and 40.1MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 24973.53ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 39.7MB in the beginning and 34.5MB in the end (delta: 5.2MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. * Witness Printer took 91.37ms. Allocated memory is still 81.8MB. Free memory was 34.5MB in the beginning and 57.1MB in the end (delta: -22.7MB). Peak memory consumption was 15.9MB. 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: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [counter=0] [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L9] COND FALSE !(!cond) VAL [counter=0] [L9] COND FALSE !(!cond) VAL [counter=0] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [counter=0] [L34] EXPR counter++ VAL [counter=1] [L34] COND TRUE counter++<20 [L12] COND FALSE !(!(cond)) VAL [counter=1] [L36] COND FALSE !(!(r != 0)) VAL [counter=1] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=1] [L34] EXPR counter++ VAL [counter=2] [L34] COND TRUE counter++<20 [L12] COND FALSE !(!(cond)) VAL [counter=2] [L36] COND FALSE !(!(r != 0)) VAL [counter=2] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=2] [L34] EXPR counter++ VAL [counter=3] [L34] COND TRUE counter++<20 [L12] COND FALSE !(!(cond)) VAL [counter=3] [L36] COND FALSE !(!(r != 0)) VAL [counter=3] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=3] [L34] EXPR counter++ VAL [counter=4] [L34] COND TRUE counter++<20 [L12] COND FALSE !(!(cond)) VAL [counter=4] [L36] COND FALSE !(!(r != 0)) VAL [counter=4] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=4] [L34] EXPR counter++ VAL [counter=5] [L34] COND TRUE counter++<20 [L12] COND FALSE !(!(cond)) VAL [counter=5] [L36] COND FALSE !(!(r != 0)) VAL [counter=5] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=5] [L34] EXPR counter++ VAL [counter=6] [L34] COND TRUE counter++<20 [L12] COND FALSE !(!(cond)) VAL [counter=6] [L36] COND FALSE !(!(r != 0)) VAL [counter=6] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=6] [L34] EXPR counter++ VAL [counter=7] [L34] COND TRUE counter++<20 [L12] COND FALSE !(!(cond)) VAL [counter=7] [L36] COND FALSE !(!(r != 0)) VAL [counter=7] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=7] [L34] EXPR counter++ VAL [counter=8] [L34] COND TRUE counter++<20 [L12] COND FALSE !(!(cond)) VAL [counter=8] [L36] COND FALSE !(!(r != 0)) VAL [counter=8] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=8] [L34] EXPR counter++ VAL [counter=9] [L34] COND TRUE counter++<20 [L12] COND FALSE !(!(cond)) VAL [counter=9] [L36] COND FALSE !(!(r != 0)) VAL [counter=9] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=9] [L34] EXPR counter++ VAL [counter=10] [L34] COND TRUE counter++<20 [L12] COND FALSE !(!(cond)) VAL [counter=10] [L36] COND FALSE !(!(r != 0)) VAL [counter=10] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=10] [L34] EXPR counter++ VAL [counter=11] [L34] COND TRUE counter++<20 [L12] COND FALSE !(!(cond)) VAL [counter=11] [L36] COND FALSE !(!(r != 0)) VAL [counter=11] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=11] [L34] EXPR counter++ VAL [counter=12] [L34] COND TRUE counter++<20 [L12] COND FALSE !(!(cond)) VAL [counter=12] [L36] COND FALSE !(!(r != 0)) VAL [counter=12] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=12] [L34] EXPR counter++ VAL [counter=13] [L34] COND TRUE counter++<20 [L12] COND FALSE !(!(cond)) VAL [counter=13] [L36] COND FALSE !(!(r != 0)) VAL [counter=13] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=13] [L34] EXPR counter++ VAL [counter=14] [L34] COND TRUE counter++<20 [L12] COND FALSE !(!(cond)) VAL [counter=14] [L36] COND FALSE !(!(r != 0)) VAL [counter=14] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=14] [L34] EXPR counter++ VAL [counter=15] [L34] COND TRUE counter++<20 [L12] COND FALSE !(!(cond)) VAL [counter=15] [L36] COND FALSE !(!(r != 0)) VAL [counter=15] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=15] [L34] EXPR counter++ VAL [counter=16] [L34] COND TRUE counter++<20 [L12] COND FALSE !(!(cond)) VAL [counter=16] [L36] COND FALSE !(!(r != 0)) VAL [counter=16] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=16] [L34] EXPR counter++ VAL [counter=17] [L34] COND TRUE counter++<20 [L12] COND FALSE !(!(cond)) VAL [counter=17] [L36] COND FALSE !(!(r != 0)) VAL [counter=17] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=17] [L34] EXPR counter++ VAL [counter=18] [L34] COND TRUE counter++<20 [L12] COND FALSE !(!(cond)) VAL [counter=18] [L36] COND FALSE !(!(r != 0)) VAL [counter=18] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=18] [L34] EXPR counter++ VAL [counter=19] [L34] COND TRUE counter++<20 [L12] COND FALSE !(!(cond)) VAL [counter=19] [L36] COND FALSE !(!(r != 0)) VAL [counter=19] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=19] [L34] EXPR counter++ VAL [counter=20] [L34] COND TRUE counter++<20 [L12] COND FALSE !(!(cond)) VAL [counter=20] [L36] COND FALSE !(!(r != 0)) VAL [counter=20] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [counter=20] [L34] EXPR counter++ VAL [counter=21] [L34] COND FALSE !(counter++<20) [L12] COND TRUE !(cond) VAL [counter=21] [L14] reach_error() VAL [counter=21] - UnprovableResult [Line: 14]: 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, 21 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 24861.21ms, OverallIterations: 8, TraceHistogramMax: 21, EmptinessCheckTime: 20.63ms, AutomataDifference: 14694.54ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 5.89ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 154 SdHoareTripleChecker+Valid, 2476.72ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 154 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 2467.55ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 408 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 561 IncrementalHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 0 mSDtfsCounter, 561 mSolverCounterSat, 6.07ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 667.91ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=7, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 311.12ms AutomataMinimizationTime, 7 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 50.59ms SsaConstructionTime, 1806.40ms SatisfiabilityAnalysisTime, 3656.47ms InterpolantComputationTime, 263 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 798 SizeOfPredicates, 28 NumberOfNonLiveVariables, 726 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 0/570 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-09-13 14:28:09,525 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...