/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:22:51,199 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:22:51,200 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:22:51,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:22:51,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:22:51,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:22:51,274 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:22:51,276 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:22:51,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:22:51,282 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:22:51,282 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:22:51,283 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:22:51,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:22:51,285 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:22:51,286 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:22:51,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:22:51,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:22:51,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:22:51,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:22:51,296 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:22:51,296 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:22:51,298 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:22:51,298 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:22:51,299 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:22:51,300 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:22:51,304 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:22:51,305 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:22:51,305 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:22:51,305 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:22:51,306 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:22:51,306 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:22:51,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:22:51,308 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:22:51,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:22:51,308 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:22:51,309 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:22:51,309 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:22:51,309 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:22:51,309 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:22:51,310 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:22:51,310 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:22:51,311 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:22:51,312 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 14:22:51,334 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:22:51,335 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:22:51,335 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:22:51,335 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:22:51,335 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:22:51,336 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:22:51,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:22:51,336 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:22:51,336 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:22:51,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:22:51,337 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:22:51,337 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:22:51,337 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:22:51,337 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:22:51,337 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:22:51,337 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:22:51,337 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:22:51,337 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:22:51,337 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:22:51,338 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:22:51,338 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:22:51,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:22:51,338 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:22:51,338 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:22:51,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:22:51,338 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:22:51,338 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:22:51,338 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:22:51,338 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:22:51,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:22:51,339 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:22:51,339 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:22:51,339 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:22:51,339 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 14:22:51,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:22:51,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:22:51,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:22:51,545 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:22:51,545 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:22:51,546 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound20.c [2022-04-27 14:22:51,596 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aceceac5c/40ad4a2dfd6247bfbfe1e907f75b213a/FLAGf5bd836c8 [2022-04-27 14:22:51,944 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:22:51,944 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound20.c [2022-04-27 14:22:51,949 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aceceac5c/40ad4a2dfd6247bfbfe1e907f75b213a/FLAGf5bd836c8 [2022-04-27 14:22:51,956 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aceceac5c/40ad4a2dfd6247bfbfe1e907f75b213a [2022-04-27 14:22:51,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:22:51,959 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:22:51,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:22:51,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:22:51,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:22:51,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:22:51" (1/1) ... [2022-04-27 14:22:51,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10fd8501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:22:51, skipping insertion in model container [2022-04-27 14:22:51,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:22:51" (1/1) ... [2022-04-27 14:22:51,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:22:51,977 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:22:52,128 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound20.c[573,586] [2022-04-27 14:22:52,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:22:52,158 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:22:52,165 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound20.c[573,586] [2022-04-27 14:22:52,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:22:52,177 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:22:52,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:22:52 WrapperNode [2022-04-27 14:22:52,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:22:52,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:22:52,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:22:52,178 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:22:52,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:22:52" (1/1) ... [2022-04-27 14:22:52,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:22:52" (1/1) ... [2022-04-27 14:22:52,189 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:22:52" (1/1) ... [2022-04-27 14:22:52,189 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:22:52" (1/1) ... [2022-04-27 14:22:52,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:22:52" (1/1) ... [2022-04-27 14:22:52,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:22:52" (1/1) ... [2022-04-27 14:22:52,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:22:52" (1/1) ... [2022-04-27 14:22:52,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:22:52,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:22:52,208 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:22:52,208 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:22:52,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:22:52" (1/1) ... [2022-04-27 14:22:52,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:22:52,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:22:52,235 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) [2022-04-27 14:22:52,259 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 [2022-04-27 14:22:52,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:22:52,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:22:52,264 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:22:52,264 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:22:52,265 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:22:52,265 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:22:52,266 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:22:52,266 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:22:52,266 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:22:52,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:22:52,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 14:22:52,266 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:22:52,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:22:52,266 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:22:52,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:22:52,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:22:52,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:22:52,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:22:52,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:22:52,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:22:52,318 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:22:52,320 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:22:52,519 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:22:52,524 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:22:52,524 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:22:52,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:22:52 BoogieIcfgContainer [2022-04-27 14:22:52,525 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:22:52,526 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:22:52,526 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:22:52,530 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:22:52,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:22:51" (1/3) ... [2022-04-27 14:22:52,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f3d932f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:22:52, skipping insertion in model container [2022-04-27 14:22:52,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:22:52" (2/3) ... [2022-04-27 14:22:52,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f3d932f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:22:52, skipping insertion in model container [2022-04-27 14:22:52,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:22:52" (3/3) ... [2022-04-27 14:22:52,532 INFO L111 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound20.c [2022-04-27 14:22:52,542 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:22:52,542 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:22:52,584 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:22:52,597 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@59a6ebe2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@55157512 [2022-04-27 14:22:52,597 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:22:52,603 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:22:52,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 14:22:52,608 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:22:52,608 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:22:52,609 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:22:52,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:22:52,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 1 times [2022-04-27 14:22:52,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:22:52,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529970857] [2022-04-27 14:22:52,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:22:52,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:22:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:22:52,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:22:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:22:52,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33#true} is VALID [2022-04-27 14:22:52,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-27 14:22:52,783 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID [2022-04-27 14:22:52,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:22:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:22:52,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 14:22:52,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 14:22:52,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 14:22:52,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-27 14:22:52,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 14:22:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:22:52,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 14:22:52,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 14:22:52,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 14:22:52,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {34#false} #61#return; {34#false} is VALID [2022-04-27 14:22:52,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:22:52,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33#true} is VALID [2022-04-27 14:22:52,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-27 14:22:52,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID [2022-04-27 14:22:52,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-27 14:22:52,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {33#true} is VALID [2022-04-27 14:22:52,797 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {33#true} is VALID [2022-04-27 14:22:52,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 14:22:52,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 14:22:52,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 14:22:52,798 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-27 14:22:52,798 INFO L272 TraceCheckUtils]: 11: Hoare triple {34#false} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {33#true} is VALID [2022-04-27 14:22:52,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 14:22:52,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 14:22:52,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 14:22:52,799 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {34#false} #61#return; {34#false} is VALID [2022-04-27 14:22:52,799 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {34#false} is VALID [2022-04-27 14:22:52,799 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-27 14:22:52,799 INFO L272 TraceCheckUtils]: 18: Hoare triple {34#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {34#false} is VALID [2022-04-27 14:22:52,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-27 14:22:52,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-27 14:22:52,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-27 14:22:52,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:22:52,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:22:52,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529970857] [2022-04-27 14:22:52,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529970857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:22:52,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:22:52,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:22:52,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846436921] [2022-04-27 14:22:52,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:22:52,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 14:22:52,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:22:52,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:22:52,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:22:52,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:22:52,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:22:52,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:22:52,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:22:52,849 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:22:52,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:22:52,975 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2022-04-27 14:22:52,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:22:52,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 14:22:52,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:22:52,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:22:52,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-04-27 14:22:52,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:22:52,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-04-27 14:22:52,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2022-04-27 14:22:53,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:22:53,110 INFO L225 Difference]: With dead ends: 54 [2022-04-27 14:22:53,110 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 14:22:53,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:22:53,114 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:22:53,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:22:53,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 14:22:53,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-27 14:22:53,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:22:53,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:22:53,134 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:22:53,135 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:22:53,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:22:53,138 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-27 14:22:53,138 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-27 14:22:53,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:22:53,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:22:53,139 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 14:22:53,139 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-27 14:22:53,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:22:53,142 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-27 14:22:53,142 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-27 14:22:53,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:22:53,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:22:53,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:22:53,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:22:53,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:22:53,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-27 14:22:53,146 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-04-27 14:22:53,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:22:53,147 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-27 14:22:53,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:22:53,147 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-27 14:22:53,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 14:22:53,148 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:22:53,148 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:22:53,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:22:53,148 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:22:53,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:22:53,148 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 1 times [2022-04-27 14:22:53,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:22:53,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192627688] [2022-04-27 14:22:53,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:22:53,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:22:53,164 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:22:53,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [68681725] [2022-04-27 14:22:53,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:22:53,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:22:53,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:22:53,166 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) [2022-04-27 14:22:53,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 14:22:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:22:53,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 14:22:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:22:53,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:22:53,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {209#true} call ULTIMATE.init(); {209#true} is VALID [2022-04-27 14:22:53,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {209#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:22:53,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {217#(<= ~counter~0 0)} assume true; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:22:53,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {217#(<= ~counter~0 0)} {209#true} #67#return; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:22:53,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {217#(<= ~counter~0 0)} call #t~ret7 := main(); {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:22:53,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {217#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:22:53,376 INFO L272 TraceCheckUtils]: 6: Hoare triple {217#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:22:53,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {217#(<= ~counter~0 0)} ~cond := #in~cond; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:22:53,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {217#(<= ~counter~0 0)} assume !(0 == ~cond); {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:22:53,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {217#(<= ~counter~0 0)} assume true; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:22:53,378 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {217#(<= ~counter~0 0)} {217#(<= ~counter~0 0)} #59#return; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:22:53,378 INFO L272 TraceCheckUtils]: 11: Hoare triple {217#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:22:53,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {217#(<= ~counter~0 0)} ~cond := #in~cond; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:22:53,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {217#(<= ~counter~0 0)} assume !(0 == ~cond); {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:22:53,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {217#(<= ~counter~0 0)} assume true; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:22:53,380 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {217#(<= ~counter~0 0)} {217#(<= ~counter~0 0)} #61#return; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:22:53,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {217#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:22:53,383 INFO L290 TraceCheckUtils]: 17: Hoare triple {217#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {266#(<= |main_#t~post6| 0)} is VALID [2022-04-27 14:22:53,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {266#(<= |main_#t~post6| 0)} assume !(#t~post6 < 20);havoc #t~post6; {210#false} is VALID [2022-04-27 14:22:53,384 INFO L272 TraceCheckUtils]: 19: Hoare triple {210#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {210#false} is VALID [2022-04-27 14:22:53,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {210#false} ~cond := #in~cond; {210#false} is VALID [2022-04-27 14:22:53,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {210#false} assume 0 == ~cond; {210#false} is VALID [2022-04-27 14:22:53,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {210#false} assume !false; {210#false} is VALID [2022-04-27 14:22:53,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:22:53,384 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:22:53,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:22:53,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192627688] [2022-04-27 14:22:53,385 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:22:53,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68681725] [2022-04-27 14:22:53,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68681725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:22:53,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:22:53,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 14:22:53,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823863266] [2022-04-27 14:22:53,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:22:53,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 14:22:53,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:22:53,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:22:53,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:22:53,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 14:22:53,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:22:53,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 14:22:53,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:22:53,409 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:22:53,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:22:53,476 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 14:22:53,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 14:22:53,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 14:22:53,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:22:53,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:22:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-27 14:22:53,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:22:53,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-27 14:22:53,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-27 14:22:53,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:22:53,528 INFO L225 Difference]: With dead ends: 34 [2022-04-27 14:22:53,528 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 14:22:53,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:22:53,529 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:22:53,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:22:53,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 14:22:53,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-27 14:22:53,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:22:53,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:22:53,537 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:22:53,537 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:22:53,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:22:53,539 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 14:22:53,539 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 14:22:53,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:22:53,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:22:53,540 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-27 14:22:53,540 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-27 14:22:53,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:22:53,542 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 14:22:53,542 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 14:22:53,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:22:53,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:22:53,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:22:53,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:22:53,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:22:53,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-27 14:22:53,544 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-04-27 14:22:53,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:22:53,544 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-27 14:22:53,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:22:53,544 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 14:22:53,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 14:22:53,545 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:22:53,545 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:22:53,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 14:22:53,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:22:53,760 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:22:53,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:22:53,760 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 1 times [2022-04-27 14:22:53,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:22:53,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463194099] [2022-04-27 14:22:53,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:22:53,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:22:53,778 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:22:53,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1042381012] [2022-04-27 14:22:53,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:22:53,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:22:53,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:22:53,780 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) [2022-04-27 14:22:53,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 14:22:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:22:53,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 14:22:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:22:53,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:22:54,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {422#true} call ULTIMATE.init(); {422#true} is VALID [2022-04-27 14:22:54,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {422#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {422#true} is VALID [2022-04-27 14:22:54,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {422#true} assume true; {422#true} is VALID [2022-04-27 14:22:54,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {422#true} {422#true} #67#return; {422#true} is VALID [2022-04-27 14:22:54,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {422#true} call #t~ret7 := main(); {422#true} is VALID [2022-04-27 14:22:54,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {422#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {422#true} is VALID [2022-04-27 14:22:54,051 INFO L272 TraceCheckUtils]: 6: Hoare triple {422#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {422#true} is VALID [2022-04-27 14:22:54,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {422#true} ~cond := #in~cond; {422#true} is VALID [2022-04-27 14:22:54,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {422#true} assume !(0 == ~cond); {422#true} is VALID [2022-04-27 14:22:54,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {422#true} assume true; {422#true} is VALID [2022-04-27 14:22:54,051 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {422#true} {422#true} #59#return; {422#true} is VALID [2022-04-27 14:22:54,052 INFO L272 TraceCheckUtils]: 11: Hoare triple {422#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {422#true} is VALID [2022-04-27 14:22:54,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {422#true} ~cond := #in~cond; {463#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:22:54,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {463#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {467#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:22:54,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {467#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {467#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:22:54,054 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {467#(not (= |assume_abort_if_not_#in~cond| 0))} {422#true} #61#return; {474#(not (= main_~x2~0 0))} is VALID [2022-04-27 14:22:54,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {474#(not (= main_~x2~0 0))} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-27 14:22:54,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-27 14:22:54,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} assume !!(#t~post6 < 20);havoc #t~post6; {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-27 14:22:54,063 INFO L272 TraceCheckUtils]: 19: Hoare triple {478#(and (= main_~y2~0 0) (= main_~y1~0 0) (not (= main_~x2~0 0)) (= main_~x1~0 main_~y3~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {488#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:22:54,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {488#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {492#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:22:54,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {492#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {423#false} is VALID [2022-04-27 14:22:54,064 INFO L290 TraceCheckUtils]: 22: Hoare triple {423#false} assume !false; {423#false} is VALID [2022-04-27 14:22:54,065 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 14:22:54,065 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:22:54,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:22:54,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463194099] [2022-04-27 14:22:54,065 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:22:54,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042381012] [2022-04-27 14:22:54,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042381012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:22:54,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:22:54,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 14:22:54,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107121780] [2022-04-27 14:22:54,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:22:54,066 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 14:22:54,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:22:54,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:22:54,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:22:54,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:22:54,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:22:54,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:22:54,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:22:54,087 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:22:54,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:22:54,284 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-27 14:22:54,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:22:54,285 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 14:22:54,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:22:54,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:22:54,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-27 14:22:54,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:22:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-27 14:22:54,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-27 14:22:54,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:22:54,324 INFO L225 Difference]: With dead ends: 37 [2022-04-27 14:22:54,324 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 14:22:54,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:22:54,326 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:22:54,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 98 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:22:54,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 14:22:54,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-27 14:22:54,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:22:54,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:22:54,340 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:22:54,341 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:22:54,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:22:54,346 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-27 14:22:54,346 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-27 14:22:54,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:22:54,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:22:54,351 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-27 14:22:54,352 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-27 14:22:54,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:22:54,355 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-27 14:22:54,355 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-27 14:22:54,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:22:54,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:22:54,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:22:54,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:22:54,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:22:54,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-27 14:22:54,362 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-04-27 14:22:54,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:22:54,362 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-27 14:22:54,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 14:22:54,362 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-27 14:22:54,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 14:22:54,363 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:22:54,363 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:22:54,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 14:22:54,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 14:22:54,576 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:22:54,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:22:54,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 1 times [2022-04-27 14:22:54,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:22:54,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705285233] [2022-04-27 14:22:54,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:22:54,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:22:54,593 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:22:54,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2031491464] [2022-04-27 14:22:54,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:22:54,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:22:54,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:22:54,595 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) [2022-04-27 14:22:54,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 14:22:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:22:54,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 14:22:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:22:54,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:22:54,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {670#true} call ULTIMATE.init(); {670#true} is VALID [2022-04-27 14:22:54,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {670#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {670#true} is VALID [2022-04-27 14:22:54,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {670#true} assume true; {670#true} is VALID [2022-04-27 14:22:54,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {670#true} {670#true} #67#return; {670#true} is VALID [2022-04-27 14:22:54,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {670#true} call #t~ret7 := main(); {670#true} is VALID [2022-04-27 14:22:54,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {670#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {670#true} is VALID [2022-04-27 14:22:54,810 INFO L272 TraceCheckUtils]: 6: Hoare triple {670#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {670#true} is VALID [2022-04-27 14:22:54,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {670#true} ~cond := #in~cond; {670#true} is VALID [2022-04-27 14:22:54,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {670#true} assume !(0 == ~cond); {670#true} is VALID [2022-04-27 14:22:54,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {670#true} assume true; {670#true} is VALID [2022-04-27 14:22:54,811 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {670#true} {670#true} #59#return; {670#true} is VALID [2022-04-27 14:22:54,811 INFO L272 TraceCheckUtils]: 11: Hoare triple {670#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {670#true} is VALID [2022-04-27 14:22:54,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {670#true} ~cond := #in~cond; {670#true} is VALID [2022-04-27 14:22:54,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {670#true} assume !(0 == ~cond); {670#true} is VALID [2022-04-27 14:22:54,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {670#true} assume true; {670#true} is VALID [2022-04-27 14:22:54,811 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {670#true} {670#true} #61#return; {670#true} is VALID [2022-04-27 14:22:54,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {670#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {670#true} is VALID [2022-04-27 14:22:54,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {670#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {670#true} is VALID [2022-04-27 14:22:54,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {670#true} assume !!(#t~post6 < 20);havoc #t~post6; {670#true} is VALID [2022-04-27 14:22:54,812 INFO L272 TraceCheckUtils]: 19: Hoare triple {670#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {670#true} is VALID [2022-04-27 14:22:54,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {670#true} ~cond := #in~cond; {735#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:22:54,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {735#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {739#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:22:54,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {739#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {739#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:22:54,817 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {739#(not (= |__VERIFIER_assert_#in~cond| 0))} {670#true} #63#return; {746#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} is VALID [2022-04-27 14:22:54,818 INFO L290 TraceCheckUtils]: 24: Hoare triple {746#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} assume !(0 != ~y3~0); {750#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-27 14:22:54,819 INFO L272 TraceCheckUtils]: 25: Hoare triple {750#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {754#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:22:54,819 INFO L290 TraceCheckUtils]: 26: Hoare triple {754#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {758#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:22:54,819 INFO L290 TraceCheckUtils]: 27: Hoare triple {758#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {671#false} is VALID [2022-04-27 14:22:54,820 INFO L290 TraceCheckUtils]: 28: Hoare triple {671#false} assume !false; {671#false} is VALID [2022-04-27 14:22:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:22:54,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:22:59,602 INFO L290 TraceCheckUtils]: 28: Hoare triple {671#false} assume !false; {671#false} is VALID [2022-04-27 14:22:59,606 INFO L290 TraceCheckUtils]: 27: Hoare triple {758#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {671#false} is VALID [2022-04-27 14:22:59,607 INFO L290 TraceCheckUtils]: 26: Hoare triple {754#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {758#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:22:59,607 INFO L272 TraceCheckUtils]: 25: Hoare triple {750#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {754#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:22:59,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {777#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} assume !(0 != ~y3~0); {750#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-27 14:22:59,609 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {739#(not (= |__VERIFIER_assert_#in~cond| 0))} {670#true} #63#return; {777#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} is VALID [2022-04-27 14:22:59,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {739#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {739#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:22:59,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {790#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {739#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:22:59,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {670#true} ~cond := #in~cond; {790#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:22:59,611 INFO L272 TraceCheckUtils]: 19: Hoare triple {670#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {670#true} is VALID [2022-04-27 14:22:59,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {670#true} assume !!(#t~post6 < 20);havoc #t~post6; {670#true} is VALID [2022-04-27 14:22:59,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {670#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {670#true} is VALID [2022-04-27 14:22:59,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {670#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {670#true} is VALID [2022-04-27 14:22:59,612 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {670#true} {670#true} #61#return; {670#true} is VALID [2022-04-27 14:22:59,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {670#true} assume true; {670#true} is VALID [2022-04-27 14:22:59,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {670#true} assume !(0 == ~cond); {670#true} is VALID [2022-04-27 14:22:59,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {670#true} ~cond := #in~cond; {670#true} is VALID [2022-04-27 14:22:59,612 INFO L272 TraceCheckUtils]: 11: Hoare triple {670#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {670#true} is VALID [2022-04-27 14:22:59,612 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {670#true} {670#true} #59#return; {670#true} is VALID [2022-04-27 14:22:59,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {670#true} assume true; {670#true} is VALID [2022-04-27 14:22:59,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {670#true} assume !(0 == ~cond); {670#true} is VALID [2022-04-27 14:22:59,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {670#true} ~cond := #in~cond; {670#true} is VALID [2022-04-27 14:22:59,613 INFO L272 TraceCheckUtils]: 6: Hoare triple {670#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {670#true} is VALID [2022-04-27 14:22:59,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {670#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {670#true} is VALID [2022-04-27 14:22:59,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {670#true} call #t~ret7 := main(); {670#true} is VALID [2022-04-27 14:22:59,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {670#true} {670#true} #67#return; {670#true} is VALID [2022-04-27 14:22:59,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {670#true} assume true; {670#true} is VALID [2022-04-27 14:22:59,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {670#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {670#true} is VALID [2022-04-27 14:22:59,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {670#true} call ULTIMATE.init(); {670#true} is VALID [2022-04-27 14:22:59,613 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:22:59,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:22:59,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705285233] [2022-04-27 14:22:59,614 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:22:59,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031491464] [2022-04-27 14:22:59,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031491464] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:22:59,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:22:59,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 14:22:59,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509557382] [2022-04-27 14:22:59,614 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:22:59,615 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-27 14:22:59,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:22:59,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 14:22:59,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:22:59,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:22:59,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:22:59,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:22:59,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:22:59,640 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 14:22:59,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:22:59,851 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-27 14:22:59,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:22:59,851 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-27 14:22:59,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:22:59,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 14:22:59,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-27 14:22:59,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 14:22:59,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-27 14:22:59,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-27 14:22:59,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:22:59,881 INFO L225 Difference]: With dead ends: 39 [2022-04-27 14:22:59,881 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 14:22:59,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:22:59,882 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:22:59,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 120 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:22:59,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 14:22:59,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-04-27 14:22:59,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:22:59,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:22:59,888 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:22:59,889 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:22:59,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:22:59,890 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-27 14:22:59,890 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-27 14:22:59,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:22:59,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:22:59,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-27 14:22:59,890 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-27 14:22:59,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:22:59,895 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-27 14:22:59,895 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-27 14:22:59,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:22:59,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:22:59,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:22:59,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:22:59,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 14:22:59,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-27 14:22:59,897 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-04-27 14:22:59,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:22:59,898 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-27 14:22:59,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 14:22:59,898 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-27 14:22:59,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 14:22:59,901 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:22:59,904 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:22:59,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 14:23:00,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:23:00,122 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:23:00,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:23:00,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 1 times [2022-04-27 14:23:00,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:23:00,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891831488] [2022-04-27 14:23:00,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:23:00,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:23:00,134 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:23:00,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [606687568] [2022-04-27 14:23:00,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:23:00,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:23:00,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:23:00,143 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) [2022-04-27 14:23:00,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 14:23:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:00,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:23:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:00,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:23:00,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {1024#true} call ULTIMATE.init(); {1024#true} is VALID [2022-04-27 14:23:00,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {1024#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:00,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {1032#(<= ~counter~0 0)} assume true; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:00,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1032#(<= ~counter~0 0)} {1024#true} #67#return; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:00,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {1032#(<= ~counter~0 0)} call #t~ret7 := main(); {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:00,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {1032#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:00,312 INFO L272 TraceCheckUtils]: 6: Hoare triple {1032#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:00,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {1032#(<= ~counter~0 0)} ~cond := #in~cond; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:00,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {1032#(<= ~counter~0 0)} assume !(0 == ~cond); {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:00,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {1032#(<= ~counter~0 0)} assume true; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:00,313 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1032#(<= ~counter~0 0)} {1032#(<= ~counter~0 0)} #59#return; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:00,314 INFO L272 TraceCheckUtils]: 11: Hoare triple {1032#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:00,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {1032#(<= ~counter~0 0)} ~cond := #in~cond; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:00,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {1032#(<= ~counter~0 0)} assume !(0 == ~cond); {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:00,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {1032#(<= ~counter~0 0)} assume true; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:00,315 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1032#(<= ~counter~0 0)} {1032#(<= ~counter~0 0)} #61#return; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:00,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {1032#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:00,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {1032#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:00,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {1081#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:00,317 INFO L272 TraceCheckUtils]: 19: Hoare triple {1081#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:00,317 INFO L290 TraceCheckUtils]: 20: Hoare triple {1081#(<= ~counter~0 1)} ~cond := #in~cond; {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:00,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {1081#(<= ~counter~0 1)} assume !(0 == ~cond); {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:00,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {1081#(<= ~counter~0 1)} assume true; {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:00,318 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1081#(<= ~counter~0 1)} {1081#(<= ~counter~0 1)} #63#return; {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:00,319 INFO L290 TraceCheckUtils]: 24: Hoare triple {1081#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:00,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {1081#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:00,319 INFO L290 TraceCheckUtils]: 26: Hoare triple {1081#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1109#(<= |main_#t~post6| 1)} is VALID [2022-04-27 14:23:00,320 INFO L290 TraceCheckUtils]: 27: Hoare triple {1109#(<= |main_#t~post6| 1)} assume !(#t~post6 < 20);havoc #t~post6; {1025#false} is VALID [2022-04-27 14:23:00,320 INFO L272 TraceCheckUtils]: 28: Hoare triple {1025#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1025#false} is VALID [2022-04-27 14:23:00,320 INFO L290 TraceCheckUtils]: 29: Hoare triple {1025#false} ~cond := #in~cond; {1025#false} is VALID [2022-04-27 14:23:00,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {1025#false} assume 0 == ~cond; {1025#false} is VALID [2022-04-27 14:23:00,320 INFO L290 TraceCheckUtils]: 31: Hoare triple {1025#false} assume !false; {1025#false} is VALID [2022-04-27 14:23:00,321 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:23:00,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:23:00,450 INFO L290 TraceCheckUtils]: 31: Hoare triple {1025#false} assume !false; {1025#false} is VALID [2022-04-27 14:23:00,450 INFO L290 TraceCheckUtils]: 30: Hoare triple {1025#false} assume 0 == ~cond; {1025#false} is VALID [2022-04-27 14:23:00,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {1025#false} ~cond := #in~cond; {1025#false} is VALID [2022-04-27 14:23:00,450 INFO L272 TraceCheckUtils]: 28: Hoare triple {1025#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1025#false} is VALID [2022-04-27 14:23:00,450 INFO L290 TraceCheckUtils]: 27: Hoare triple {1137#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {1025#false} is VALID [2022-04-27 14:23:00,451 INFO L290 TraceCheckUtils]: 26: Hoare triple {1141#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1137#(< |main_#t~post6| 20)} is VALID [2022-04-27 14:23:00,451 INFO L290 TraceCheckUtils]: 25: Hoare triple {1141#(< ~counter~0 20)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1141#(< ~counter~0 20)} is VALID [2022-04-27 14:23:00,451 INFO L290 TraceCheckUtils]: 24: Hoare triple {1141#(< ~counter~0 20)} assume !!(0 != ~y3~0); {1141#(< ~counter~0 20)} is VALID [2022-04-27 14:23:00,452 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1024#true} {1141#(< ~counter~0 20)} #63#return; {1141#(< ~counter~0 20)} is VALID [2022-04-27 14:23:00,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:23:00,452 INFO L290 TraceCheckUtils]: 21: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:23:00,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:23:00,453 INFO L272 TraceCheckUtils]: 19: Hoare triple {1141#(< ~counter~0 20)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1024#true} is VALID [2022-04-27 14:23:00,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {1141#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {1141#(< ~counter~0 20)} is VALID [2022-04-27 14:23:00,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {1169#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1141#(< ~counter~0 20)} is VALID [2022-04-27 14:23:00,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {1169#(< ~counter~0 19)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1169#(< ~counter~0 19)} is VALID [2022-04-27 14:23:00,454 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1024#true} {1169#(< ~counter~0 19)} #61#return; {1169#(< ~counter~0 19)} is VALID [2022-04-27 14:23:00,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:23:00,454 INFO L290 TraceCheckUtils]: 13: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:23:00,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:23:00,454 INFO L272 TraceCheckUtils]: 11: Hoare triple {1169#(< ~counter~0 19)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1024#true} is VALID [2022-04-27 14:23:00,455 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1024#true} {1169#(< ~counter~0 19)} #59#return; {1169#(< ~counter~0 19)} is VALID [2022-04-27 14:23:00,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:23:00,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:23:00,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:23:00,455 INFO L272 TraceCheckUtils]: 6: Hoare triple {1169#(< ~counter~0 19)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1024#true} is VALID [2022-04-27 14:23:00,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {1169#(< ~counter~0 19)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {1169#(< ~counter~0 19)} is VALID [2022-04-27 14:23:00,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {1169#(< ~counter~0 19)} call #t~ret7 := main(); {1169#(< ~counter~0 19)} is VALID [2022-04-27 14:23:00,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1169#(< ~counter~0 19)} {1024#true} #67#return; {1169#(< ~counter~0 19)} is VALID [2022-04-27 14:23:00,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {1169#(< ~counter~0 19)} assume true; {1169#(< ~counter~0 19)} is VALID [2022-04-27 14:23:00,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {1024#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1169#(< ~counter~0 19)} is VALID [2022-04-27 14:23:00,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {1024#true} call ULTIMATE.init(); {1024#true} is VALID [2022-04-27 14:23:00,459 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:23:00,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:23:00,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891831488] [2022-04-27 14:23:00,460 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:23:00,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606687568] [2022-04-27 14:23:00,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606687568] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:23:00,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:23:00,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 14:23:00,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499918174] [2022-04-27 14:23:00,460 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:23:00,460 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32 [2022-04-27 14:23:00,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:23:00,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 14:23:00,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:23:00,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:23:00,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:23:00,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:23:00,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:23:00,492 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 14:23:00,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:00,679 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-04-27 14:23:00,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:23:00,679 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32 [2022-04-27 14:23:00,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:23:00,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 14:23:00,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-27 14:23:00,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 14:23:00,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-27 14:23:00,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 67 transitions. [2022-04-27 14:23:00,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:23:00,724 INFO L225 Difference]: With dead ends: 61 [2022-04-27 14:23:00,724 INFO L226 Difference]: Without dead ends: 56 [2022-04-27 14:23:00,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:23:00,725 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 43 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:23:00,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 116 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:23:00,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-27 14:23:00,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-27 14:23:00,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:23:00,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:23:00,740 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:23:00,740 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:23:00,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:00,741 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-27 14:23:00,742 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-27 14:23:00,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:00,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:00,742 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-27 14:23:00,742 INFO L87 Difference]: Start difference. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-27 14:23:00,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:00,743 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-27 14:23:00,743 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-27 14:23:00,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:00,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:00,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:23:00,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:23:00,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:23:00,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-27 14:23:00,745 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 32 [2022-04-27 14:23:00,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:23:00,745 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-27 14:23:00,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 14:23:00,746 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-27 14:23:00,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-27 14:23:00,746 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:23:00,746 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:23:00,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 14:23:00,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:23:00,953 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:23:00,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:23:00,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1632159894, now seen corresponding path program 2 times [2022-04-27 14:23:00,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:23:00,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062360010] [2022-04-27 14:23:00,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:23:00,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:23:00,976 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:23:00,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2081374276] [2022-04-27 14:23:00,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:23:00,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:23:00,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:23:00,977 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) [2022-04-27 14:23:00,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 14:23:01,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:23:01,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:23:01,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 14:23:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:01,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:23:01,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} call ULTIMATE.init(); {1504#true} is VALID [2022-04-27 14:23:01,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {1504#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:01,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {1512#(<= ~counter~0 0)} assume true; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:01,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1512#(<= ~counter~0 0)} {1504#true} #67#return; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:01,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {1512#(<= ~counter~0 0)} call #t~ret7 := main(); {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:01,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {1512#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:01,336 INFO L272 TraceCheckUtils]: 6: Hoare triple {1512#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:01,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {1512#(<= ~counter~0 0)} ~cond := #in~cond; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:01,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {1512#(<= ~counter~0 0)} assume !(0 == ~cond); {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:01,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {1512#(<= ~counter~0 0)} assume true; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:01,338 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1512#(<= ~counter~0 0)} {1512#(<= ~counter~0 0)} #59#return; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:01,338 INFO L272 TraceCheckUtils]: 11: Hoare triple {1512#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:01,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {1512#(<= ~counter~0 0)} ~cond := #in~cond; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:01,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {1512#(<= ~counter~0 0)} assume !(0 == ~cond); {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:01,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {1512#(<= ~counter~0 0)} assume true; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:01,339 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1512#(<= ~counter~0 0)} {1512#(<= ~counter~0 0)} #61#return; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:01,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {1512#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:01,340 INFO L290 TraceCheckUtils]: 17: Hoare triple {1512#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:01,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {1561#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:01,341 INFO L272 TraceCheckUtils]: 19: Hoare triple {1561#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:01,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {1561#(<= ~counter~0 1)} ~cond := #in~cond; {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:01,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {1561#(<= ~counter~0 1)} assume !(0 == ~cond); {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:01,342 INFO L290 TraceCheckUtils]: 22: Hoare triple {1561#(<= ~counter~0 1)} assume true; {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:01,343 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1561#(<= ~counter~0 1)} {1561#(<= ~counter~0 1)} #63#return; {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:01,343 INFO L290 TraceCheckUtils]: 24: Hoare triple {1561#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:01,344 INFO L290 TraceCheckUtils]: 25: Hoare triple {1561#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:01,344 INFO L290 TraceCheckUtils]: 26: Hoare triple {1561#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:01,345 INFO L290 TraceCheckUtils]: 27: Hoare triple {1589#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:01,346 INFO L272 TraceCheckUtils]: 28: Hoare triple {1589#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:01,346 INFO L290 TraceCheckUtils]: 29: Hoare triple {1589#(<= ~counter~0 2)} ~cond := #in~cond; {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:01,346 INFO L290 TraceCheckUtils]: 30: Hoare triple {1589#(<= ~counter~0 2)} assume !(0 == ~cond); {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:01,346 INFO L290 TraceCheckUtils]: 31: Hoare triple {1589#(<= ~counter~0 2)} assume true; {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:01,347 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1589#(<= ~counter~0 2)} {1589#(<= ~counter~0 2)} #63#return; {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:01,347 INFO L290 TraceCheckUtils]: 33: Hoare triple {1589#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:01,348 INFO L290 TraceCheckUtils]: 34: Hoare triple {1589#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:01,348 INFO L290 TraceCheckUtils]: 35: Hoare triple {1589#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:01,348 INFO L290 TraceCheckUtils]: 36: Hoare triple {1617#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:01,349 INFO L272 TraceCheckUtils]: 37: Hoare triple {1617#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:01,354 INFO L290 TraceCheckUtils]: 38: Hoare triple {1617#(<= ~counter~0 3)} ~cond := #in~cond; {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:01,354 INFO L290 TraceCheckUtils]: 39: Hoare triple {1617#(<= ~counter~0 3)} assume !(0 == ~cond); {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:01,355 INFO L290 TraceCheckUtils]: 40: Hoare triple {1617#(<= ~counter~0 3)} assume true; {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:01,356 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1617#(<= ~counter~0 3)} {1617#(<= ~counter~0 3)} #63#return; {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:01,359 INFO L290 TraceCheckUtils]: 42: Hoare triple {1617#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:01,360 INFO L290 TraceCheckUtils]: 43: Hoare triple {1617#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:01,361 INFO L290 TraceCheckUtils]: 44: Hoare triple {1617#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:01,361 INFO L290 TraceCheckUtils]: 45: Hoare triple {1645#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:01,362 INFO L272 TraceCheckUtils]: 46: Hoare triple {1645#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:01,362 INFO L290 TraceCheckUtils]: 47: Hoare triple {1645#(<= ~counter~0 4)} ~cond := #in~cond; {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:01,363 INFO L290 TraceCheckUtils]: 48: Hoare triple {1645#(<= ~counter~0 4)} assume !(0 == ~cond); {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:01,363 INFO L290 TraceCheckUtils]: 49: Hoare triple {1645#(<= ~counter~0 4)} assume true; {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:01,364 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1645#(<= ~counter~0 4)} {1645#(<= ~counter~0 4)} #63#return; {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:01,364 INFO L290 TraceCheckUtils]: 51: Hoare triple {1645#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:01,365 INFO L290 TraceCheckUtils]: 52: Hoare triple {1645#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:01,365 INFO L290 TraceCheckUtils]: 53: Hoare triple {1645#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1673#(<= |main_#t~post6| 4)} is VALID [2022-04-27 14:23:01,368 INFO L290 TraceCheckUtils]: 54: Hoare triple {1673#(<= |main_#t~post6| 4)} assume !(#t~post6 < 20);havoc #t~post6; {1505#false} is VALID [2022-04-27 14:23:01,368 INFO L272 TraceCheckUtils]: 55: Hoare triple {1505#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1505#false} is VALID [2022-04-27 14:23:01,369 INFO L290 TraceCheckUtils]: 56: Hoare triple {1505#false} ~cond := #in~cond; {1505#false} is VALID [2022-04-27 14:23:01,369 INFO L290 TraceCheckUtils]: 57: Hoare triple {1505#false} assume 0 == ~cond; {1505#false} is VALID [2022-04-27 14:23:01,370 INFO L290 TraceCheckUtils]: 58: Hoare triple {1505#false} assume !false; {1505#false} is VALID [2022-04-27 14:23:01,371 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:23:01,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:23:01,663 INFO L290 TraceCheckUtils]: 58: Hoare triple {1505#false} assume !false; {1505#false} is VALID [2022-04-27 14:23:01,663 INFO L290 TraceCheckUtils]: 57: Hoare triple {1505#false} assume 0 == ~cond; {1505#false} is VALID [2022-04-27 14:23:01,663 INFO L290 TraceCheckUtils]: 56: Hoare triple {1505#false} ~cond := #in~cond; {1505#false} is VALID [2022-04-27 14:23:01,663 INFO L272 TraceCheckUtils]: 55: Hoare triple {1505#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1505#false} is VALID [2022-04-27 14:23:01,664 INFO L290 TraceCheckUtils]: 54: Hoare triple {1701#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {1505#false} is VALID [2022-04-27 14:23:01,664 INFO L290 TraceCheckUtils]: 53: Hoare triple {1705#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1701#(< |main_#t~post6| 20)} is VALID [2022-04-27 14:23:01,664 INFO L290 TraceCheckUtils]: 52: Hoare triple {1705#(< ~counter~0 20)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1705#(< ~counter~0 20)} is VALID [2022-04-27 14:23:01,665 INFO L290 TraceCheckUtils]: 51: Hoare triple {1705#(< ~counter~0 20)} assume !!(0 != ~y3~0); {1705#(< ~counter~0 20)} is VALID [2022-04-27 14:23:01,665 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1504#true} {1705#(< ~counter~0 20)} #63#return; {1705#(< ~counter~0 20)} is VALID [2022-04-27 14:23:01,666 INFO L290 TraceCheckUtils]: 49: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-27 14:23:01,666 INFO L290 TraceCheckUtils]: 48: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-27 14:23:01,666 INFO L290 TraceCheckUtils]: 47: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-27 14:23:01,666 INFO L272 TraceCheckUtils]: 46: Hoare triple {1705#(< ~counter~0 20)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1504#true} is VALID [2022-04-27 14:23:01,666 INFO L290 TraceCheckUtils]: 45: Hoare triple {1705#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {1705#(< ~counter~0 20)} is VALID [2022-04-27 14:23:01,667 INFO L290 TraceCheckUtils]: 44: Hoare triple {1733#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1705#(< ~counter~0 20)} is VALID [2022-04-27 14:23:01,667 INFO L290 TraceCheckUtils]: 43: Hoare triple {1733#(< ~counter~0 19)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1733#(< ~counter~0 19)} is VALID [2022-04-27 14:23:01,667 INFO L290 TraceCheckUtils]: 42: Hoare triple {1733#(< ~counter~0 19)} assume !!(0 != ~y3~0); {1733#(< ~counter~0 19)} is VALID [2022-04-27 14:23:01,668 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1504#true} {1733#(< ~counter~0 19)} #63#return; {1733#(< ~counter~0 19)} is VALID [2022-04-27 14:23:01,668 INFO L290 TraceCheckUtils]: 40: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-27 14:23:01,668 INFO L290 TraceCheckUtils]: 39: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-27 14:23:01,668 INFO L290 TraceCheckUtils]: 38: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-27 14:23:01,668 INFO L272 TraceCheckUtils]: 37: Hoare triple {1733#(< ~counter~0 19)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1504#true} is VALID [2022-04-27 14:23:01,668 INFO L290 TraceCheckUtils]: 36: Hoare triple {1733#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {1733#(< ~counter~0 19)} is VALID [2022-04-27 14:23:01,669 INFO L290 TraceCheckUtils]: 35: Hoare triple {1761#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1733#(< ~counter~0 19)} is VALID [2022-04-27 14:23:01,669 INFO L290 TraceCheckUtils]: 34: Hoare triple {1761#(< ~counter~0 18)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1761#(< ~counter~0 18)} is VALID [2022-04-27 14:23:01,669 INFO L290 TraceCheckUtils]: 33: Hoare triple {1761#(< ~counter~0 18)} assume !!(0 != ~y3~0); {1761#(< ~counter~0 18)} is VALID [2022-04-27 14:23:01,670 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1504#true} {1761#(< ~counter~0 18)} #63#return; {1761#(< ~counter~0 18)} is VALID [2022-04-27 14:23:01,670 INFO L290 TraceCheckUtils]: 31: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-27 14:23:01,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-27 14:23:01,671 INFO L290 TraceCheckUtils]: 29: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-27 14:23:01,671 INFO L272 TraceCheckUtils]: 28: Hoare triple {1761#(< ~counter~0 18)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1504#true} is VALID [2022-04-27 14:23:01,671 INFO L290 TraceCheckUtils]: 27: Hoare triple {1761#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {1761#(< ~counter~0 18)} is VALID [2022-04-27 14:23:01,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {1789#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1761#(< ~counter~0 18)} is VALID [2022-04-27 14:23:01,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {1789#(< ~counter~0 17)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1789#(< ~counter~0 17)} is VALID [2022-04-27 14:23:01,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {1789#(< ~counter~0 17)} assume !!(0 != ~y3~0); {1789#(< ~counter~0 17)} is VALID [2022-04-27 14:23:01,674 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1504#true} {1789#(< ~counter~0 17)} #63#return; {1789#(< ~counter~0 17)} is VALID [2022-04-27 14:23:01,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-27 14:23:01,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-27 14:23:01,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-27 14:23:01,675 INFO L272 TraceCheckUtils]: 19: Hoare triple {1789#(< ~counter~0 17)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1504#true} is VALID [2022-04-27 14:23:01,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {1789#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {1789#(< ~counter~0 17)} is VALID [2022-04-27 14:23:01,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {1817#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1789#(< ~counter~0 17)} is VALID [2022-04-27 14:23:01,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {1817#(< ~counter~0 16)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1817#(< ~counter~0 16)} is VALID [2022-04-27 14:23:01,676 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1504#true} {1817#(< ~counter~0 16)} #61#return; {1817#(< ~counter~0 16)} is VALID [2022-04-27 14:23:01,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-27 14:23:01,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-27 14:23:01,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-27 14:23:01,677 INFO L272 TraceCheckUtils]: 11: Hoare triple {1817#(< ~counter~0 16)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1504#true} is VALID [2022-04-27 14:23:01,678 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1504#true} {1817#(< ~counter~0 16)} #59#return; {1817#(< ~counter~0 16)} is VALID [2022-04-27 14:23:01,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-27 14:23:01,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-27 14:23:01,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-27 14:23:01,678 INFO L272 TraceCheckUtils]: 6: Hoare triple {1817#(< ~counter~0 16)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1504#true} is VALID [2022-04-27 14:23:01,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {1817#(< ~counter~0 16)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {1817#(< ~counter~0 16)} is VALID [2022-04-27 14:23:01,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {1817#(< ~counter~0 16)} call #t~ret7 := main(); {1817#(< ~counter~0 16)} is VALID [2022-04-27 14:23:01,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1817#(< ~counter~0 16)} {1504#true} #67#return; {1817#(< ~counter~0 16)} is VALID [2022-04-27 14:23:01,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {1817#(< ~counter~0 16)} assume true; {1817#(< ~counter~0 16)} is VALID [2022-04-27 14:23:01,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {1504#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1817#(< ~counter~0 16)} is VALID [2022-04-27 14:23:01,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} call ULTIMATE.init(); {1504#true} is VALID [2022-04-27 14:23:01,681 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 14:23:01,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:23:01,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062360010] [2022-04-27 14:23:01,681 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:23:01,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081374276] [2022-04-27 14:23:01,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081374276] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:23:01,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:23:01,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-27 14:23:01,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791359024] [2022-04-27 14:23:01,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:23:01,682 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 59 [2022-04-27 14:23:01,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:23:01,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 14:23:01,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:23:01,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:23:01,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:23:01,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:23:01,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:23:01,760 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 14:23:02,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:02,276 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2022-04-27 14:23:02,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 14:23:02,277 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 59 [2022-04-27 14:23:02,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:23:02,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 14:23:02,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 130 transitions. [2022-04-27 14:23:02,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 14:23:02,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 130 transitions. [2022-04-27 14:23:02,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 130 transitions. [2022-04-27 14:23:02,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:23:02,398 INFO L225 Difference]: With dead ends: 115 [2022-04-27 14:23:02,398 INFO L226 Difference]: Without dead ends: 110 [2022-04-27 14:23:02,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-27 14:23:02,399 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 158 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:23:02,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 176 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:23:02,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-27 14:23:02,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-04-27 14:23:02,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:23:02,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:23:02,432 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:23:02,433 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:23:02,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:02,436 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-27 14:23:02,436 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-27 14:23:02,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:02,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:02,436 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 110 states. [2022-04-27 14:23:02,437 INFO L87 Difference]: Start difference. First operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 110 states. [2022-04-27 14:23:02,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:02,440 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-27 14:23:02,440 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-27 14:23:02,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:02,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:02,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:23:02,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:23:02,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:23:02,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-04-27 14:23:02,444 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 59 [2022-04-27 14:23:02,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:23:02,444 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-04-27 14:23:02,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 14:23:02,444 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-27 14:23:02,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-27 14:23:02,446 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:23:02,446 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:23:02,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 14:23:02,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:23:02,668 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:23:02,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:23:02,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1468805930, now seen corresponding path program 3 times [2022-04-27 14:23:02,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:23:02,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781252761] [2022-04-27 14:23:02,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:23:02,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:23:02,685 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:23:02,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1586033560] [2022-04-27 14:23:02,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:23:02,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:23:02,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:23:02,686 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) [2022-04-27 14:23:02,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 14:23:02,778 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-27 14:23:02,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:23:02,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 14:23:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:02,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:23:03,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {2416#true} call ULTIMATE.init(); {2416#true} is VALID [2022-04-27 14:23:03,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {2416#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:03,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {2424#(<= ~counter~0 0)} assume true; {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:03,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2424#(<= ~counter~0 0)} {2416#true} #67#return; {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:03,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {2424#(<= ~counter~0 0)} call #t~ret7 := main(); {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:03,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {2424#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:03,430 INFO L272 TraceCheckUtils]: 6: Hoare triple {2424#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:03,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {2424#(<= ~counter~0 0)} ~cond := #in~cond; {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:03,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {2424#(<= ~counter~0 0)} assume !(0 == ~cond); {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:03,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {2424#(<= ~counter~0 0)} assume true; {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:03,431 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2424#(<= ~counter~0 0)} {2424#(<= ~counter~0 0)} #59#return; {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:03,432 INFO L272 TraceCheckUtils]: 11: Hoare triple {2424#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:03,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {2424#(<= ~counter~0 0)} ~cond := #in~cond; {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:03,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {2424#(<= ~counter~0 0)} assume !(0 == ~cond); {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:03,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {2424#(<= ~counter~0 0)} assume true; {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:03,433 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2424#(<= ~counter~0 0)} {2424#(<= ~counter~0 0)} #61#return; {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:03,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {2424#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {2424#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:03,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {2424#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2473#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:03,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {2473#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {2473#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:03,435 INFO L272 TraceCheckUtils]: 19: Hoare triple {2473#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2473#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:03,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {2473#(<= ~counter~0 1)} ~cond := #in~cond; {2473#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:03,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {2473#(<= ~counter~0 1)} assume !(0 == ~cond); {2473#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:03,435 INFO L290 TraceCheckUtils]: 22: Hoare triple {2473#(<= ~counter~0 1)} assume true; {2473#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:03,436 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2473#(<= ~counter~0 1)} {2473#(<= ~counter~0 1)} #63#return; {2473#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:03,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {2473#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {2473#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:03,437 INFO L290 TraceCheckUtils]: 25: Hoare triple {2473#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2473#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:03,437 INFO L290 TraceCheckUtils]: 26: Hoare triple {2473#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2501#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:03,437 INFO L290 TraceCheckUtils]: 27: Hoare triple {2501#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {2501#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:03,438 INFO L272 TraceCheckUtils]: 28: Hoare triple {2501#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2501#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:03,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {2501#(<= ~counter~0 2)} ~cond := #in~cond; {2501#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:03,438 INFO L290 TraceCheckUtils]: 30: Hoare triple {2501#(<= ~counter~0 2)} assume !(0 == ~cond); {2501#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:03,439 INFO L290 TraceCheckUtils]: 31: Hoare triple {2501#(<= ~counter~0 2)} assume true; {2501#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:03,439 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2501#(<= ~counter~0 2)} {2501#(<= ~counter~0 2)} #63#return; {2501#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:03,440 INFO L290 TraceCheckUtils]: 33: Hoare triple {2501#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {2501#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:03,440 INFO L290 TraceCheckUtils]: 34: Hoare triple {2501#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2501#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:03,440 INFO L290 TraceCheckUtils]: 35: Hoare triple {2501#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2529#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:03,441 INFO L290 TraceCheckUtils]: 36: Hoare triple {2529#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {2529#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:03,442 INFO L272 TraceCheckUtils]: 37: Hoare triple {2529#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2529#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:03,442 INFO L290 TraceCheckUtils]: 38: Hoare triple {2529#(<= ~counter~0 3)} ~cond := #in~cond; {2529#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:03,443 INFO L290 TraceCheckUtils]: 39: Hoare triple {2529#(<= ~counter~0 3)} assume !(0 == ~cond); {2529#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:03,443 INFO L290 TraceCheckUtils]: 40: Hoare triple {2529#(<= ~counter~0 3)} assume true; {2529#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:03,443 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2529#(<= ~counter~0 3)} {2529#(<= ~counter~0 3)} #63#return; {2529#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:03,444 INFO L290 TraceCheckUtils]: 42: Hoare triple {2529#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {2529#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:03,444 INFO L290 TraceCheckUtils]: 43: Hoare triple {2529#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2529#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:03,445 INFO L290 TraceCheckUtils]: 44: Hoare triple {2529#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2557#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:03,445 INFO L290 TraceCheckUtils]: 45: Hoare triple {2557#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {2557#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:03,445 INFO L272 TraceCheckUtils]: 46: Hoare triple {2557#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2557#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:03,446 INFO L290 TraceCheckUtils]: 47: Hoare triple {2557#(<= ~counter~0 4)} ~cond := #in~cond; {2557#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:03,446 INFO L290 TraceCheckUtils]: 48: Hoare triple {2557#(<= ~counter~0 4)} assume !(0 == ~cond); {2557#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:03,447 INFO L290 TraceCheckUtils]: 49: Hoare triple {2557#(<= ~counter~0 4)} assume true; {2557#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:03,449 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2557#(<= ~counter~0 4)} {2557#(<= ~counter~0 4)} #63#return; {2557#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:03,449 INFO L290 TraceCheckUtils]: 51: Hoare triple {2557#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {2557#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:03,452 INFO L290 TraceCheckUtils]: 52: Hoare triple {2557#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2557#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:03,453 INFO L290 TraceCheckUtils]: 53: Hoare triple {2557#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2585#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:03,453 INFO L290 TraceCheckUtils]: 54: Hoare triple {2585#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {2585#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:03,454 INFO L272 TraceCheckUtils]: 55: Hoare triple {2585#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2585#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:03,454 INFO L290 TraceCheckUtils]: 56: Hoare triple {2585#(<= ~counter~0 5)} ~cond := #in~cond; {2585#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:03,455 INFO L290 TraceCheckUtils]: 57: Hoare triple {2585#(<= ~counter~0 5)} assume !(0 == ~cond); {2585#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:03,455 INFO L290 TraceCheckUtils]: 58: Hoare triple {2585#(<= ~counter~0 5)} assume true; {2585#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:03,455 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2585#(<= ~counter~0 5)} {2585#(<= ~counter~0 5)} #63#return; {2585#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:03,456 INFO L290 TraceCheckUtils]: 60: Hoare triple {2585#(<= ~counter~0 5)} assume !!(0 != ~y3~0); {2585#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:03,456 INFO L290 TraceCheckUtils]: 61: Hoare triple {2585#(<= ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2585#(<= ~counter~0 5)} is VALID [2022-04-27 14:23:03,457 INFO L290 TraceCheckUtils]: 62: Hoare triple {2585#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2613#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:03,457 INFO L290 TraceCheckUtils]: 63: Hoare triple {2613#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {2613#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:03,457 INFO L272 TraceCheckUtils]: 64: Hoare triple {2613#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2613#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:03,458 INFO L290 TraceCheckUtils]: 65: Hoare triple {2613#(<= ~counter~0 6)} ~cond := #in~cond; {2613#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:03,459 INFO L290 TraceCheckUtils]: 66: Hoare triple {2613#(<= ~counter~0 6)} assume !(0 == ~cond); {2613#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:03,459 INFO L290 TraceCheckUtils]: 67: Hoare triple {2613#(<= ~counter~0 6)} assume true; {2613#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:03,460 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {2613#(<= ~counter~0 6)} {2613#(<= ~counter~0 6)} #63#return; {2613#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:03,460 INFO L290 TraceCheckUtils]: 69: Hoare triple {2613#(<= ~counter~0 6)} assume !!(0 != ~y3~0); {2613#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:03,460 INFO L290 TraceCheckUtils]: 70: Hoare triple {2613#(<= ~counter~0 6)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2613#(<= ~counter~0 6)} is VALID [2022-04-27 14:23:03,461 INFO L290 TraceCheckUtils]: 71: Hoare triple {2613#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2641#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:03,461 INFO L290 TraceCheckUtils]: 72: Hoare triple {2641#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {2641#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:03,461 INFO L272 TraceCheckUtils]: 73: Hoare triple {2641#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2641#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:03,462 INFO L290 TraceCheckUtils]: 74: Hoare triple {2641#(<= ~counter~0 7)} ~cond := #in~cond; {2641#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:03,462 INFO L290 TraceCheckUtils]: 75: Hoare triple {2641#(<= ~counter~0 7)} assume !(0 == ~cond); {2641#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:03,462 INFO L290 TraceCheckUtils]: 76: Hoare triple {2641#(<= ~counter~0 7)} assume true; {2641#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:03,463 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {2641#(<= ~counter~0 7)} {2641#(<= ~counter~0 7)} #63#return; {2641#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:03,463 INFO L290 TraceCheckUtils]: 78: Hoare triple {2641#(<= ~counter~0 7)} assume !!(0 != ~y3~0); {2641#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:03,463 INFO L290 TraceCheckUtils]: 79: Hoare triple {2641#(<= ~counter~0 7)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2641#(<= ~counter~0 7)} is VALID [2022-04-27 14:23:03,467 INFO L290 TraceCheckUtils]: 80: Hoare triple {2641#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2669#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:03,467 INFO L290 TraceCheckUtils]: 81: Hoare triple {2669#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {2669#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:03,468 INFO L272 TraceCheckUtils]: 82: Hoare triple {2669#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2669#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:03,468 INFO L290 TraceCheckUtils]: 83: Hoare triple {2669#(<= ~counter~0 8)} ~cond := #in~cond; {2669#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:03,469 INFO L290 TraceCheckUtils]: 84: Hoare triple {2669#(<= ~counter~0 8)} assume !(0 == ~cond); {2669#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:03,469 INFO L290 TraceCheckUtils]: 85: Hoare triple {2669#(<= ~counter~0 8)} assume true; {2669#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:03,470 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {2669#(<= ~counter~0 8)} {2669#(<= ~counter~0 8)} #63#return; {2669#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:03,470 INFO L290 TraceCheckUtils]: 87: Hoare triple {2669#(<= ~counter~0 8)} assume !!(0 != ~y3~0); {2669#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:03,470 INFO L290 TraceCheckUtils]: 88: Hoare triple {2669#(<= ~counter~0 8)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2669#(<= ~counter~0 8)} is VALID [2022-04-27 14:23:03,471 INFO L290 TraceCheckUtils]: 89: Hoare triple {2669#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2697#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:03,471 INFO L290 TraceCheckUtils]: 90: Hoare triple {2697#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {2697#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:03,472 INFO L272 TraceCheckUtils]: 91: Hoare triple {2697#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2697#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:03,472 INFO L290 TraceCheckUtils]: 92: Hoare triple {2697#(<= ~counter~0 9)} ~cond := #in~cond; {2697#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:03,472 INFO L290 TraceCheckUtils]: 93: Hoare triple {2697#(<= ~counter~0 9)} assume !(0 == ~cond); {2697#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:03,473 INFO L290 TraceCheckUtils]: 94: Hoare triple {2697#(<= ~counter~0 9)} assume true; {2697#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:03,473 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {2697#(<= ~counter~0 9)} {2697#(<= ~counter~0 9)} #63#return; {2697#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:03,474 INFO L290 TraceCheckUtils]: 96: Hoare triple {2697#(<= ~counter~0 9)} assume !!(0 != ~y3~0); {2697#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:03,474 INFO L290 TraceCheckUtils]: 97: Hoare triple {2697#(<= ~counter~0 9)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2697#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:03,474 INFO L290 TraceCheckUtils]: 98: Hoare triple {2697#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2725#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:03,475 INFO L290 TraceCheckUtils]: 99: Hoare triple {2725#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {2725#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:03,475 INFO L272 TraceCheckUtils]: 100: Hoare triple {2725#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2725#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:03,475 INFO L290 TraceCheckUtils]: 101: Hoare triple {2725#(<= ~counter~0 10)} ~cond := #in~cond; {2725#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:03,476 INFO L290 TraceCheckUtils]: 102: Hoare triple {2725#(<= ~counter~0 10)} assume !(0 == ~cond); {2725#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:03,476 INFO L290 TraceCheckUtils]: 103: Hoare triple {2725#(<= ~counter~0 10)} assume true; {2725#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:03,476 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {2725#(<= ~counter~0 10)} {2725#(<= ~counter~0 10)} #63#return; {2725#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:03,477 INFO L290 TraceCheckUtils]: 105: Hoare triple {2725#(<= ~counter~0 10)} assume !!(0 != ~y3~0); {2725#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:03,477 INFO L290 TraceCheckUtils]: 106: Hoare triple {2725#(<= ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2725#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:03,477 INFO L290 TraceCheckUtils]: 107: Hoare triple {2725#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2753#(<= |main_#t~post6| 10)} is VALID [2022-04-27 14:23:03,478 INFO L290 TraceCheckUtils]: 108: Hoare triple {2753#(<= |main_#t~post6| 10)} assume !(#t~post6 < 20);havoc #t~post6; {2417#false} is VALID [2022-04-27 14:23:03,478 INFO L272 TraceCheckUtils]: 109: Hoare triple {2417#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {2417#false} is VALID [2022-04-27 14:23:03,478 INFO L290 TraceCheckUtils]: 110: Hoare triple {2417#false} ~cond := #in~cond; {2417#false} is VALID [2022-04-27 14:23:03,478 INFO L290 TraceCheckUtils]: 111: Hoare triple {2417#false} assume 0 == ~cond; {2417#false} is VALID [2022-04-27 14:23:03,478 INFO L290 TraceCheckUtils]: 112: Hoare triple {2417#false} assume !false; {2417#false} is VALID [2022-04-27 14:23:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:23:03,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:23:04,227 INFO L290 TraceCheckUtils]: 112: Hoare triple {2417#false} assume !false; {2417#false} is VALID [2022-04-27 14:23:04,228 INFO L290 TraceCheckUtils]: 111: Hoare triple {2417#false} assume 0 == ~cond; {2417#false} is VALID [2022-04-27 14:23:04,228 INFO L290 TraceCheckUtils]: 110: Hoare triple {2417#false} ~cond := #in~cond; {2417#false} is VALID [2022-04-27 14:23:04,228 INFO L272 TraceCheckUtils]: 109: Hoare triple {2417#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {2417#false} is VALID [2022-04-27 14:23:04,229 INFO L290 TraceCheckUtils]: 108: Hoare triple {2781#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {2417#false} is VALID [2022-04-27 14:23:04,230 INFO L290 TraceCheckUtils]: 107: Hoare triple {2785#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2781#(< |main_#t~post6| 20)} is VALID [2022-04-27 14:23:04,230 INFO L290 TraceCheckUtils]: 106: Hoare triple {2785#(< ~counter~0 20)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2785#(< ~counter~0 20)} is VALID [2022-04-27 14:23:04,231 INFO L290 TraceCheckUtils]: 105: Hoare triple {2785#(< ~counter~0 20)} assume !!(0 != ~y3~0); {2785#(< ~counter~0 20)} is VALID [2022-04-27 14:23:04,231 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {2416#true} {2785#(< ~counter~0 20)} #63#return; {2785#(< ~counter~0 20)} is VALID [2022-04-27 14:23:04,231 INFO L290 TraceCheckUtils]: 103: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-04-27 14:23:04,231 INFO L290 TraceCheckUtils]: 102: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-04-27 14:23:04,232 INFO L290 TraceCheckUtils]: 101: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-04-27 14:23:04,232 INFO L272 TraceCheckUtils]: 100: Hoare triple {2785#(< ~counter~0 20)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2416#true} is VALID [2022-04-27 14:23:04,232 INFO L290 TraceCheckUtils]: 99: Hoare triple {2785#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {2785#(< ~counter~0 20)} is VALID [2022-04-27 14:23:04,233 INFO L290 TraceCheckUtils]: 98: Hoare triple {2813#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2785#(< ~counter~0 20)} is VALID [2022-04-27 14:23:04,233 INFO L290 TraceCheckUtils]: 97: Hoare triple {2813#(< ~counter~0 19)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2813#(< ~counter~0 19)} is VALID [2022-04-27 14:23:04,233 INFO L290 TraceCheckUtils]: 96: Hoare triple {2813#(< ~counter~0 19)} assume !!(0 != ~y3~0); {2813#(< ~counter~0 19)} is VALID [2022-04-27 14:23:04,234 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {2416#true} {2813#(< ~counter~0 19)} #63#return; {2813#(< ~counter~0 19)} is VALID [2022-04-27 14:23:04,234 INFO L290 TraceCheckUtils]: 94: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-04-27 14:23:04,234 INFO L290 TraceCheckUtils]: 93: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-04-27 14:23:04,234 INFO L290 TraceCheckUtils]: 92: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-04-27 14:23:04,234 INFO L272 TraceCheckUtils]: 91: Hoare triple {2813#(< ~counter~0 19)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2416#true} is VALID [2022-04-27 14:23:04,234 INFO L290 TraceCheckUtils]: 90: Hoare triple {2813#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {2813#(< ~counter~0 19)} is VALID [2022-04-27 14:23:04,235 INFO L290 TraceCheckUtils]: 89: Hoare triple {2841#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2813#(< ~counter~0 19)} is VALID [2022-04-27 14:23:04,235 INFO L290 TraceCheckUtils]: 88: Hoare triple {2841#(< ~counter~0 18)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2841#(< ~counter~0 18)} is VALID [2022-04-27 14:23:04,235 INFO L290 TraceCheckUtils]: 87: Hoare triple {2841#(< ~counter~0 18)} assume !!(0 != ~y3~0); {2841#(< ~counter~0 18)} is VALID [2022-04-27 14:23:04,236 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {2416#true} {2841#(< ~counter~0 18)} #63#return; {2841#(< ~counter~0 18)} is VALID [2022-04-27 14:23:04,236 INFO L290 TraceCheckUtils]: 85: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-04-27 14:23:04,236 INFO L290 TraceCheckUtils]: 84: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-04-27 14:23:04,236 INFO L290 TraceCheckUtils]: 83: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-04-27 14:23:04,236 INFO L272 TraceCheckUtils]: 82: Hoare triple {2841#(< ~counter~0 18)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2416#true} is VALID [2022-04-27 14:23:04,237 INFO L290 TraceCheckUtils]: 81: Hoare triple {2841#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {2841#(< ~counter~0 18)} is VALID [2022-04-27 14:23:04,237 INFO L290 TraceCheckUtils]: 80: Hoare triple {2869#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2841#(< ~counter~0 18)} is VALID [2022-04-27 14:23:04,238 INFO L290 TraceCheckUtils]: 79: Hoare triple {2869#(< ~counter~0 17)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2869#(< ~counter~0 17)} is VALID [2022-04-27 14:23:04,238 INFO L290 TraceCheckUtils]: 78: Hoare triple {2869#(< ~counter~0 17)} assume !!(0 != ~y3~0); {2869#(< ~counter~0 17)} is VALID [2022-04-27 14:23:04,239 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {2416#true} {2869#(< ~counter~0 17)} #63#return; {2869#(< ~counter~0 17)} is VALID [2022-04-27 14:23:04,239 INFO L290 TraceCheckUtils]: 76: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-04-27 14:23:04,239 INFO L290 TraceCheckUtils]: 75: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-04-27 14:23:04,239 INFO L290 TraceCheckUtils]: 74: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-04-27 14:23:04,239 INFO L272 TraceCheckUtils]: 73: Hoare triple {2869#(< ~counter~0 17)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2416#true} is VALID [2022-04-27 14:23:04,239 INFO L290 TraceCheckUtils]: 72: Hoare triple {2869#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {2869#(< ~counter~0 17)} is VALID [2022-04-27 14:23:04,240 INFO L290 TraceCheckUtils]: 71: Hoare triple {2897#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2869#(< ~counter~0 17)} is VALID [2022-04-27 14:23:04,240 INFO L290 TraceCheckUtils]: 70: Hoare triple {2897#(< ~counter~0 16)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2897#(< ~counter~0 16)} is VALID [2022-04-27 14:23:04,240 INFO L290 TraceCheckUtils]: 69: Hoare triple {2897#(< ~counter~0 16)} assume !!(0 != ~y3~0); {2897#(< ~counter~0 16)} is VALID [2022-04-27 14:23:04,241 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {2416#true} {2897#(< ~counter~0 16)} #63#return; {2897#(< ~counter~0 16)} is VALID [2022-04-27 14:23:04,241 INFO L290 TraceCheckUtils]: 67: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-04-27 14:23:04,241 INFO L290 TraceCheckUtils]: 66: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-04-27 14:23:04,241 INFO L290 TraceCheckUtils]: 65: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-04-27 14:23:04,241 INFO L272 TraceCheckUtils]: 64: Hoare triple {2897#(< ~counter~0 16)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2416#true} is VALID [2022-04-27 14:23:04,242 INFO L290 TraceCheckUtils]: 63: Hoare triple {2897#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {2897#(< ~counter~0 16)} is VALID [2022-04-27 14:23:04,242 INFO L290 TraceCheckUtils]: 62: Hoare triple {2925#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2897#(< ~counter~0 16)} is VALID [2022-04-27 14:23:04,242 INFO L290 TraceCheckUtils]: 61: Hoare triple {2925#(< ~counter~0 15)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2925#(< ~counter~0 15)} is VALID [2022-04-27 14:23:04,243 INFO L290 TraceCheckUtils]: 60: Hoare triple {2925#(< ~counter~0 15)} assume !!(0 != ~y3~0); {2925#(< ~counter~0 15)} is VALID [2022-04-27 14:23:04,243 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2416#true} {2925#(< ~counter~0 15)} #63#return; {2925#(< ~counter~0 15)} is VALID [2022-04-27 14:23:04,243 INFO L290 TraceCheckUtils]: 58: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-04-27 14:23:04,243 INFO L290 TraceCheckUtils]: 57: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-04-27 14:23:04,243 INFO L290 TraceCheckUtils]: 56: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-04-27 14:23:04,243 INFO L272 TraceCheckUtils]: 55: Hoare triple {2925#(< ~counter~0 15)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2416#true} is VALID [2022-04-27 14:23:04,244 INFO L290 TraceCheckUtils]: 54: Hoare triple {2925#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {2925#(< ~counter~0 15)} is VALID [2022-04-27 14:23:04,244 INFO L290 TraceCheckUtils]: 53: Hoare triple {2953#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2925#(< ~counter~0 15)} is VALID [2022-04-27 14:23:04,245 INFO L290 TraceCheckUtils]: 52: Hoare triple {2953#(< ~counter~0 14)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2953#(< ~counter~0 14)} is VALID [2022-04-27 14:23:04,245 INFO L290 TraceCheckUtils]: 51: Hoare triple {2953#(< ~counter~0 14)} assume !!(0 != ~y3~0); {2953#(< ~counter~0 14)} is VALID [2022-04-27 14:23:04,246 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2416#true} {2953#(< ~counter~0 14)} #63#return; {2953#(< ~counter~0 14)} is VALID [2022-04-27 14:23:04,246 INFO L290 TraceCheckUtils]: 49: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-04-27 14:23:04,246 INFO L290 TraceCheckUtils]: 48: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-04-27 14:23:04,246 INFO L290 TraceCheckUtils]: 47: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-04-27 14:23:04,246 INFO L272 TraceCheckUtils]: 46: Hoare triple {2953#(< ~counter~0 14)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2416#true} is VALID [2022-04-27 14:23:04,246 INFO L290 TraceCheckUtils]: 45: Hoare triple {2953#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {2953#(< ~counter~0 14)} is VALID [2022-04-27 14:23:04,247 INFO L290 TraceCheckUtils]: 44: Hoare triple {2981#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2953#(< ~counter~0 14)} is VALID [2022-04-27 14:23:04,247 INFO L290 TraceCheckUtils]: 43: Hoare triple {2981#(< ~counter~0 13)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2981#(< ~counter~0 13)} is VALID [2022-04-27 14:23:04,247 INFO L290 TraceCheckUtils]: 42: Hoare triple {2981#(< ~counter~0 13)} assume !!(0 != ~y3~0); {2981#(< ~counter~0 13)} is VALID [2022-04-27 14:23:04,248 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2416#true} {2981#(< ~counter~0 13)} #63#return; {2981#(< ~counter~0 13)} is VALID [2022-04-27 14:23:04,248 INFO L290 TraceCheckUtils]: 40: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-04-27 14:23:04,248 INFO L290 TraceCheckUtils]: 39: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-04-27 14:23:04,248 INFO L290 TraceCheckUtils]: 38: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-04-27 14:23:04,248 INFO L272 TraceCheckUtils]: 37: Hoare triple {2981#(< ~counter~0 13)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2416#true} is VALID [2022-04-27 14:23:04,250 INFO L290 TraceCheckUtils]: 36: Hoare triple {2981#(< ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {2981#(< ~counter~0 13)} is VALID [2022-04-27 14:23:04,250 INFO L290 TraceCheckUtils]: 35: Hoare triple {3009#(< ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2981#(< ~counter~0 13)} is VALID [2022-04-27 14:23:04,251 INFO L290 TraceCheckUtils]: 34: Hoare triple {3009#(< ~counter~0 12)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {3009#(< ~counter~0 12)} is VALID [2022-04-27 14:23:04,251 INFO L290 TraceCheckUtils]: 33: Hoare triple {3009#(< ~counter~0 12)} assume !!(0 != ~y3~0); {3009#(< ~counter~0 12)} is VALID [2022-04-27 14:23:04,252 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2416#true} {3009#(< ~counter~0 12)} #63#return; {3009#(< ~counter~0 12)} is VALID [2022-04-27 14:23:04,252 INFO L290 TraceCheckUtils]: 31: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-04-27 14:23:04,252 INFO L290 TraceCheckUtils]: 30: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-04-27 14:23:04,252 INFO L290 TraceCheckUtils]: 29: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-04-27 14:23:04,252 INFO L272 TraceCheckUtils]: 28: Hoare triple {3009#(< ~counter~0 12)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2416#true} is VALID [2022-04-27 14:23:04,252 INFO L290 TraceCheckUtils]: 27: Hoare triple {3009#(< ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {3009#(< ~counter~0 12)} is VALID [2022-04-27 14:23:04,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {2725#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3009#(< ~counter~0 12)} is VALID [2022-04-27 14:23:04,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {2725#(<= ~counter~0 10)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2725#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:04,267 INFO L290 TraceCheckUtils]: 24: Hoare triple {2725#(<= ~counter~0 10)} assume !!(0 != ~y3~0); {2725#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:04,268 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2416#true} {2725#(<= ~counter~0 10)} #63#return; {2725#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:04,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-04-27 14:23:04,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-04-27 14:23:04,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-04-27 14:23:04,268 INFO L272 TraceCheckUtils]: 19: Hoare triple {2725#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2416#true} is VALID [2022-04-27 14:23:04,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {2725#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {2725#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:04,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {2697#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2725#(<= ~counter~0 10)} is VALID [2022-04-27 14:23:04,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {2697#(<= ~counter~0 9)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {2697#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:04,270 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2416#true} {2697#(<= ~counter~0 9)} #61#return; {2697#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:04,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-04-27 14:23:04,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-04-27 14:23:04,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-04-27 14:23:04,271 INFO L272 TraceCheckUtils]: 11: Hoare triple {2697#(<= ~counter~0 9)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {2416#true} is VALID [2022-04-27 14:23:04,271 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2416#true} {2697#(<= ~counter~0 9)} #59#return; {2697#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:04,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {2416#true} assume true; {2416#true} is VALID [2022-04-27 14:23:04,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {2416#true} assume !(0 == ~cond); {2416#true} is VALID [2022-04-27 14:23:04,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {2416#true} ~cond := #in~cond; {2416#true} is VALID [2022-04-27 14:23:04,271 INFO L272 TraceCheckUtils]: 6: Hoare triple {2697#(<= ~counter~0 9)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {2416#true} is VALID [2022-04-27 14:23:04,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {2697#(<= ~counter~0 9)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {2697#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:04,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {2697#(<= ~counter~0 9)} call #t~ret7 := main(); {2697#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:04,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2697#(<= ~counter~0 9)} {2416#true} #67#return; {2697#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:04,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {2697#(<= ~counter~0 9)} assume true; {2697#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:04,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {2416#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2697#(<= ~counter~0 9)} is VALID [2022-04-27 14:23:04,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {2416#true} call ULTIMATE.init(); {2416#true} is VALID [2022-04-27 14:23:04,275 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-27 14:23:04,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:23:04,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781252761] [2022-04-27 14:23:04,275 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:23:04,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586033560] [2022-04-27 14:23:04,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586033560] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:23:04,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:23:04,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-27 14:23:04,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857585918] [2022-04-27 14:23:04,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:23:04,277 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) Word has length 113 [2022-04-27 14:23:04,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:23:04,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2022-04-27 14:23:04,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:23:04,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-27 14:23:04,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:23:04,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-27 14:23:04,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-27 14:23:04,413 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2022-04-27 14:23:05,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:05,215 INFO L93 Difference]: Finished difference Result 205 states and 235 transitions. [2022-04-27 14:23:05,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-27 14:23:05,215 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) Word has length 113 [2022-04-27 14:23:05,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:23:05,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2022-04-27 14:23:05,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 234 transitions. [2022-04-27 14:23:05,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2022-04-27 14:23:05,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 234 transitions. [2022-04-27 14:23:05,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 234 transitions. [2022-04-27 14:23:05,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:23:05,412 INFO L225 Difference]: With dead ends: 205 [2022-04-27 14:23:05,412 INFO L226 Difference]: Without dead ends: 200 [2022-04-27 14:23:05,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2022-04-27 14:23:05,413 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 141 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:23:05,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 252 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:23:05,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-04-27 14:23:05,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2022-04-27 14:23:05,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:23:05,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:23:05,474 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:23:05,475 INFO L87 Difference]: Start difference. First operand 200 states. Second operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:23:05,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:05,482 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2022-04-27 14:23:05,482 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2022-04-27 14:23:05,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:05,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:05,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 200 states. [2022-04-27 14:23:05,483 INFO L87 Difference]: Start difference. First operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 200 states. [2022-04-27 14:23:05,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:05,491 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2022-04-27 14:23:05,491 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2022-04-27 14:23:05,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:05,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:05,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:23:05,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:23:05,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 14:23:05,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 221 transitions. [2022-04-27 14:23:05,499 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 221 transitions. Word has length 113 [2022-04-27 14:23:05,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:23:05,499 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 221 transitions. [2022-04-27 14:23:05,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2022-04-27 14:23:05,500 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2022-04-27 14:23:05,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-04-27 14:23:05,501 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:23:05,502 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:23:05,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 14:23:05,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:23:05,724 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:23:05,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:23:05,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1934081686, now seen corresponding path program 4 times [2022-04-27 14:23:05,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:23:05,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871989995] [2022-04-27 14:23:05,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:23:05,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:23:05,758 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:23:05,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1228859451] [2022-04-27 14:23:05,759 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 14:23:05,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:23:05,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:23:05,763 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) [2022-04-27 14:23:05,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 14:23:05,862 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 14:23:05,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-27 14:23:05,862 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 14:23:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 14:23:06,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 14:23:06,048 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 14:23:06,049 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 14:23:06,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 14:23:06,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:23:06,270 INFO L356 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2022-04-27 14:23:06,272 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 14:23:06,328 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 14:23:06,328 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 14:23:06,328 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 14:23:06,328 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 14:23:06,328 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 14:23:06,328 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 14:23:06,328 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 14:23:06,328 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 14:23:06,328 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:23:06,328 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 14:23:06,328 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 14:23:06,328 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:23:06,328 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:23:06,329 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 14:23:06,329 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 14:23:06,329 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 14:23:06,329 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 14:23:06,329 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 14:23:06,329 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:23:06,329 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-27 14:23:06,329 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-27 14:23:06,329 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-27 14:23:06,329 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-27 14:23:06,329 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-27 14:23:06,329 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-27 14:23:06,329 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:23:06,329 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:23:06,329 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-27 14:23:06,329 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:23:06,329 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:23:06,329 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-04-27 14:23:06,329 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-04-27 14:23:06,329 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-27 14:23:06,329 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-27 14:23:06,329 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 14:23:06,329 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2022-04-27 14:23:06,329 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2022-04-27 14:23:06,329 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 14:23:06,329 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 14:23:06,329 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-27 14:23:06,330 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-27 14:23:06,330 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 14:23:06,330 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 14:23:06,330 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 14:23:06,330 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 14:23:06,330 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. [2022-04-27 14:23:06,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 02:23:06 BoogieIcfgContainer [2022-04-27 14:23:06,330 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 14:23:06,331 INFO L158 Benchmark]: Toolchain (without parser) took 14372.31ms. Allocated memory was 194.0MB in the beginning and 257.9MB in the end (delta: 64.0MB). Free memory was 141.3MB in the beginning and 223.5MB in the end (delta: -82.2MB). Peak memory consumption was 120.2MB. Max. memory is 8.0GB. [2022-04-27 14:23:06,331 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 194.0MB. Free memory is still 158.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:23:06,331 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.60ms. Allocated memory is still 194.0MB. Free memory was 141.1MB in the beginning and 167.4MB in the end (delta: -26.3MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-04-27 14:23:06,331 INFO L158 Benchmark]: Boogie Preprocessor took 26.33ms. Allocated memory is still 194.0MB. Free memory was 167.3MB in the beginning and 165.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 14:23:06,332 INFO L158 Benchmark]: RCFGBuilder took 317.95ms. Allocated memory is still 194.0MB. Free memory was 165.8MB in the beginning and 154.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 14:23:06,332 INFO L158 Benchmark]: TraceAbstraction took 13804.32ms. Allocated memory was 194.0MB in the beginning and 257.9MB in the end (delta: 64.0MB). Free memory was 154.3MB in the beginning and 223.5MB in the end (delta: -69.2MB). Peak memory consumption was 133.1MB. Max. memory is 8.0GB. [2022-04-27 14:23:06,332 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.27ms. Allocated memory is still 194.0MB. Free memory is still 158.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 217.60ms. Allocated memory is still 194.0MB. Free memory was 141.1MB in the beginning and 167.4MB in the end (delta: -26.3MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.33ms. Allocated memory is still 194.0MB. Free memory was 167.3MB in the beginning and 165.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 317.95ms. Allocated memory is still 194.0MB. Free memory was 165.8MB in the beginning and 154.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 13804.32ms. Allocated memory was 194.0MB in the beginning and 257.9MB in the end (delta: 64.0MB). Free memory was 154.3MB in the beginning and 223.5MB in the end (delta: -69.2MB). Peak memory consumption was 133.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=24, counter=0] [L24] int x1, x2; [L25] int y1, y2, y3; [L26] x1 = __VERIFIER_nondet_int() [L27] x2 = __VERIFIER_nondet_int() [L29] CALL assume_abort_if_not(x1 >= 0) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L29] RET assume_abort_if_not(x1 >= 0) VAL [\old(counter)=0, counter=0, x1=21, x2=1] [L30] CALL assume_abort_if_not(x2 != 0) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L30] RET assume_abort_if_not(x2 != 0) VAL [\old(counter)=0, counter=0, x1=21, x2=1] [L32] y1 = 0 [L33] y2 = 0 [L34] y3 = x1 VAL [\old(counter)=0, counter=0, x1=21, x2=1, y1=0, y2=0, y3=21] [L36] EXPR counter++ VAL [\old(counter)=0, counter=1, counter++=0, x1=21, x2=1, y1=0, y2=0, y3=21] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=1, x1=21, x2=1, y1=0, y2=0, y3=21] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=1, x1=21, x2=1, y1=0, y2=0, y3=21] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=1, x1=21, x2=1, y1=1, y2=0, y3=20] [L36] EXPR counter++ VAL [\old(counter)=0, counter=2, counter++=1, x1=21, x2=1, y1=1, y2=0, y3=20] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=2, x1=21, x2=1, y1=1, y2=0, y3=20] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=2, x1=21, x2=1, y1=1, y2=0, y3=20] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=2, x1=21, x2=1, y1=2, y2=0, y3=19] [L36] EXPR counter++ VAL [\old(counter)=0, counter=3, counter++=2, x1=21, x2=1, y1=2, y2=0, y3=19] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=3, x1=21, x2=1, y1=2, y2=0, y3=19] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=3, x1=21, x2=1, y1=2, y2=0, y3=19] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=3, x1=21, x2=1, y1=3, y2=0, y3=18] [L36] EXPR counter++ VAL [\old(counter)=0, counter=4, counter++=3, x1=21, x2=1, y1=3, y2=0, y3=18] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=4, x1=21, x2=1, y1=3, y2=0, y3=18] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=4, x1=21, x2=1, y1=3, y2=0, y3=18] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=4, x1=21, x2=1, y1=4, y2=0, y3=17] [L36] EXPR counter++ VAL [\old(counter)=0, counter=5, counter++=4, x1=21, x2=1, y1=4, y2=0, y3=17] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=5, x1=21, x2=1, y1=4, y2=0, y3=17] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=5, x1=21, x2=1, y1=4, y2=0, y3=17] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=5, x1=21, x2=1, y1=5, y2=0, y3=16] [L36] EXPR counter++ VAL [\old(counter)=0, counter=6, counter++=5, x1=21, x2=1, y1=5, y2=0, y3=16] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=6, x1=21, x2=1, y1=5, y2=0, y3=16] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=6, x1=21, x2=1, y1=5, y2=0, y3=16] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=6, x1=21, x2=1, y1=6, y2=0, y3=15] [L36] EXPR counter++ VAL [\old(counter)=0, counter=7, counter++=6, x1=21, x2=1, y1=6, y2=0, y3=15] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=7, x1=21, x2=1, y1=6, y2=0, y3=15] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=7, x1=21, x2=1, y1=6, y2=0, y3=15] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=7, x1=21, x2=1, y1=7, y2=0, y3=14] [L36] EXPR counter++ VAL [\old(counter)=0, counter=8, counter++=7, x1=21, x2=1, y1=7, y2=0, y3=14] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=8, x1=21, x2=1, y1=7, y2=0, y3=14] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=8, x1=21, x2=1, y1=7, y2=0, y3=14] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=8, x1=21, x2=1, y1=8, y2=0, y3=13] [L36] EXPR counter++ VAL [\old(counter)=0, counter=9, counter++=8, x1=21, x2=1, y1=8, y2=0, y3=13] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=9, x1=21, x2=1, y1=8, y2=0, y3=13] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=9, x1=21, x2=1, y1=8, y2=0, y3=13] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=9, x1=21, x2=1, y1=9, y2=0, y3=12] [L36] EXPR counter++ VAL [\old(counter)=0, counter=10, counter++=9, x1=21, x2=1, y1=9, y2=0, y3=12] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=10, x1=21, x2=1, y1=9, y2=0, y3=12] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=10, x1=21, x2=1, y1=9, y2=0, y3=12] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=10, x1=21, x2=1, y1=10, y2=0, y3=11] [L36] EXPR counter++ VAL [\old(counter)=0, counter=11, counter++=10, x1=21, x2=1, y1=10, y2=0, y3=11] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=11, x1=21, x2=1, y1=10, y2=0, y3=11] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=11, x1=21, x2=1, y1=10, y2=0, y3=11] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=11, x1=21, x2=1, y1=11, y2=0, y3=10] [L36] EXPR counter++ VAL [\old(counter)=0, counter=12, counter++=11, x1=21, x2=1, y1=11, y2=0, y3=10] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=12, x1=21, x2=1, y1=11, y2=0, y3=10] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=12, x1=21, x2=1, y1=11, y2=0, y3=10] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=12, x1=21, x2=1, y1=12, y2=0, y3=9] [L36] EXPR counter++ VAL [\old(counter)=0, counter=13, counter++=12, x1=21, x2=1, y1=12, y2=0, y3=9] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=13, x1=21, x2=1, y1=12, y2=0, y3=9] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=13, x1=21, x2=1, y1=12, y2=0, y3=9] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=13, x1=21, x2=1, y1=13, y2=0, y3=8] [L36] EXPR counter++ VAL [\old(counter)=0, counter=14, counter++=13, x1=21, x2=1, y1=13, y2=0, y3=8] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=14, x1=21, x2=1, y1=13, y2=0, y3=8] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=14, x1=21, x2=1, y1=13, y2=0, y3=8] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=14, x1=21, x2=1, y1=14, y2=0, y3=7] [L36] EXPR counter++ VAL [\old(counter)=0, counter=15, counter++=14, x1=21, x2=1, y1=14, y2=0, y3=7] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=15, x1=21, x2=1, y1=14, y2=0, y3=7] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=15, x1=21, x2=1, y1=14, y2=0, y3=7] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=15, x1=21, x2=1, y1=15, y2=0, y3=6] [L36] EXPR counter++ VAL [\old(counter)=0, counter=16, counter++=15, x1=21, x2=1, y1=15, y2=0, y3=6] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=16, x1=21, x2=1, y1=15, y2=0, y3=6] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=16, x1=21, x2=1, y1=15, y2=0, y3=6] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=16, x1=21, x2=1, y1=16, y2=0, y3=5] [L36] EXPR counter++ VAL [\old(counter)=0, counter=17, counter++=16, x1=21, x2=1, y1=16, y2=0, y3=5] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=17, x1=21, x2=1, y1=16, y2=0, y3=5] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=17, x1=21, x2=1, y1=16, y2=0, y3=5] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=17, x1=21, x2=1, y1=17, y2=0, y3=4] [L36] EXPR counter++ VAL [\old(counter)=0, counter=18, counter++=17, x1=21, x2=1, y1=17, y2=0, y3=4] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=18, x1=21, x2=1, y1=17, y2=0, y3=4] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=18, x1=21, x2=1, y1=17, y2=0, y3=4] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=18, x1=21, x2=1, y1=18, y2=0, y3=3] [L36] EXPR counter++ VAL [\old(counter)=0, counter=19, counter++=18, x1=21, x2=1, y1=18, y2=0, y3=3] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=19, x1=21, x2=1, y1=18, y2=0, y3=3] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=19, x1=21, x2=1, y1=18, y2=0, y3=3] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=19, x1=21, x2=1, y1=19, y2=0, y3=2] [L36] EXPR counter++ VAL [\old(counter)=0, counter=20, counter++=19, x1=21, x2=1, y1=19, y2=0, y3=2] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=20, x1=21, x2=1, y1=19, y2=0, y3=2] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=20, x1=21, x2=1, y1=19, y2=0, y3=2] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=20, x1=21, x2=1, y1=20, y2=0, y3=1] [L36] EXPR counter++ VAL [\old(counter)=0, counter=21, counter++=20, x1=21, x2=1, y1=20, y2=0, y3=1] [L36] COND FALSE !(counter++<20) [L50] CALL __VERIFIER_assert(y1*x2 + y2 == x1) VAL [\old(cond)=0, \old(counter)=0, counter=21] [L16] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] [L18] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.7s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 394 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 390 mSDsluCounter, 864 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 656 mSDsCounter, 147 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 360 IncrementalHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 147 mSolverCounterUnsat, 208 mSDtfsCounter, 360 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 552 GetRequests, 457 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=7, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 523 ConstructedInterpolants, 0 QuantifiedInterpolants, 1255 SizeOfPredicates, 29 NumberOfNonLiveVariables, 914 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 310/1086 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! [2022-04-27 14:23:06,343 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...