/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_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:23:05,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:23:05,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:23:05,278 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:23:05,278 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:23:05,279 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:23:05,284 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:23:05,285 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:23:05,286 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:23:05,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:23:05,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:23:05,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:23:05,288 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:23:05,288 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:23:05,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:23:05,290 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:23:05,290 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:23:05,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:23:05,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:23:05,292 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:23:05,293 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:23:05,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:23:05,295 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:23:05,296 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:23:05,297 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:23:05,299 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:23:05,299 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:23:05,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:23:05,300 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:23:05,300 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:23:05,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:23:05,300 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:23:05,301 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:23:05,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:23:05,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:23:05,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:23:05,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:23:05,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:23:05,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:23:05,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:23:05,303 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:23:05,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:23:05,306 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:23:05,326 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:23:05,326 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:23:05,326 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:23:05,326 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:23:05,328 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:23:05,329 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:23:05,329 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:23:05,329 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:23:05,329 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:23:05,330 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:23:05,330 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:23:05,330 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:23:05,330 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:23:05,330 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:23:05,330 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:23:05,331 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:23:05,331 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:23:05,331 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:23:05,332 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:23:05,332 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:23:05,332 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:23:05,332 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:23:05,332 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:23:05,332 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:23:05,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:23:05,332 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:23:05,333 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:23:05,333 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:23:05,333 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:23:05,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:23:05,333 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:23:05,333 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:23:05,333 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:23:05,333 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:23:05,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:23:05,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:23:05,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:23:05,517 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:23:05,517 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:23:05,518 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound5.c [2022-04-27 14:23:05,572 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1283c100c/acf1a9b765a94502bed198ffd3fa1e97/FLAG5e45801a3 [2022-04-27 14:23:05,900 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:23:05,900 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound5.c [2022-04-27 14:23:05,904 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1283c100c/acf1a9b765a94502bed198ffd3fa1e97/FLAG5e45801a3 [2022-04-27 14:23:05,912 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1283c100c/acf1a9b765a94502bed198ffd3fa1e97 [2022-04-27 14:23:05,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:23:05,915 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:23:05,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:23:05,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:23:05,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:23:05,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:23:05" (1/1) ... [2022-04-27 14:23:05,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18cc845f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:23:05, skipping insertion in model container [2022-04-27 14:23:05,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:23:05" (1/1) ... [2022-04-27 14:23:05,925 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:23:05,933 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:23:06,091 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_unwindbound5.c[573,586] [2022-04-27 14:23:06,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:23:06,117 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:23:06,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_unwindbound5.c[573,586] [2022-04-27 14:23:06,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:23:06,154 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:23:06,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:23:06 WrapperNode [2022-04-27 14:23:06,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:23:06,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:23:06,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:23:06,156 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:23:06,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:23:06" (1/1) ... [2022-04-27 14:23:06,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:23:06" (1/1) ... [2022-04-27 14:23:06,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:23:06" (1/1) ... [2022-04-27 14:23:06,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:23:06" (1/1) ... [2022-04-27 14:23:06,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:23:06" (1/1) ... [2022-04-27 14:23:06,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:23:06" (1/1) ... [2022-04-27 14:23:06,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:23:06" (1/1) ... [2022-04-27 14:23:06,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:23:06,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:23:06,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:23:06,190 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:23:06,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:23:06" (1/1) ... [2022-04-27 14:23:06,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:23:06,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:23:06,225 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:23:06,241 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:23:06,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:23:06,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:23:06,252 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:23:06,252 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:23:06,253 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:23:06,253 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:23:06,253 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:23:06,253 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:23:06,253 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:23:06,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:23:06,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 14:23:06,253 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:23:06,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:23:06,253 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:23:06,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:23:06,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:23:06,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:23:06,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:23:06,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:23:06,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:23:06,302 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:23:06,303 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:23:06,401 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:23:06,406 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:23:06,406 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:23:06,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:23:06 BoogieIcfgContainer [2022-04-27 14:23:06,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:23:06,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:23:06,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:23:06,411 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:23:06,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:23:05" (1/3) ... [2022-04-27 14:23:06,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eda176e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:23:06, skipping insertion in model container [2022-04-27 14:23:06,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:23:06" (2/3) ... [2022-04-27 14:23:06,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eda176e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:23:06, skipping insertion in model container [2022-04-27 14:23:06,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:23:06" (3/3) ... [2022-04-27 14:23:06,413 INFO L111 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound5.c [2022-04-27 14:23:06,422 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:23:06,423 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:23:06,452 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:23:06,457 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@2d6e66d8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@45bb634a [2022-04-27 14:23:06,457 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:23:06,462 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:23:06,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 14:23:06,467 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:23:06,468 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:23:06,468 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:23:06,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:23:06,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 1 times [2022-04-27 14:23:06,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:23:06,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193816624] [2022-04-27 14:23:06,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:23:06,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:23:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:06,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:23:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:06,709 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:23:06,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-27 14:23:06,710 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID [2022-04-27 14:23:06,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:23:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:06,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 14:23:06,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 14:23:06,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 14:23:06,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-27 14:23:06,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 14:23:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:06,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 14:23:06,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 14:23:06,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 14:23:06,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {34#false} #61#return; {34#false} is VALID [2022-04-27 14:23:06,748 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:23:06,748 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:23:06,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-27 14:23:06,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID [2022-04-27 14:23:06,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-27 14:23:06,749 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:23:06,749 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:23:06,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 14:23:06,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 14:23:06,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 14:23:06,751 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-27 14:23:06,751 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:23:06,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 14:23:06,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 14:23:06,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 14:23:06,752 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {34#false} #61#return; {34#false} is VALID [2022-04-27 14:23:06,752 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:23:06,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-27 14:23:06,752 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:23:06,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-27 14:23:06,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-27 14:23:06,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-27 14:23:06,753 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:23:06,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:23:06,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193816624] [2022-04-27 14:23:06,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193816624] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:23:06,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:23:06,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:23:06,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085102760] [2022-04-27 14:23:06,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:23:06,760 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:23:06,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:23:06,763 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:23:06,791 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:23:06,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:23:06,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:23:06,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:23:06,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:23:06,812 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:23:06,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:06,918 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2022-04-27 14:23:06,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:23:06,918 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:23:06,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:23:06,919 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:23:06,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-04-27 14:23:06,928 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:23:06,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-04-27 14:23:06,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2022-04-27 14:23:06,992 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:23:06,998 INFO L225 Difference]: With dead ends: 54 [2022-04-27 14:23:06,998 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 14:23:07,000 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:23:07,009 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:23:07,009 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:23:07,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 14:23:07,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-27 14:23:07,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:23:07,035 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:23:07,035 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:23:07,036 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:23:07,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:07,041 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-27 14:23:07,041 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-27 14:23:07,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:07,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:07,042 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:23:07,042 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:23:07,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:07,044 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-27 14:23:07,044 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-27 14:23:07,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:07,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:07,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:23:07,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:23:07,045 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:23:07,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-27 14:23:07,048 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-04-27 14:23:07,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:23:07,048 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-27 14:23:07,049 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:23:07,049 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-27 14:23:07,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 14:23:07,050 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:23:07,050 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:23:07,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:23:07,051 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:23:07,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:23:07,054 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 1 times [2022-04-27 14:23:07,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:23:07,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542068770] [2022-04-27 14:23:07,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:23:07,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:23:07,078 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:23:07,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1518131715] [2022-04-27 14:23:07,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:23:07,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:23:07,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:23:07,097 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:23:07,098 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:23:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:07,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 14:23:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:07,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:23:07,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {209#true} call ULTIMATE.init(); {209#true} is VALID [2022-04-27 14:23:07,307 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:23:07,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {217#(<= ~counter~0 0)} assume true; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:07,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {217#(<= ~counter~0 0)} {209#true} #67#return; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:07,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {217#(<= ~counter~0 0)} call #t~ret7 := main(); {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:07,309 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:23:07,309 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:23:07,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {217#(<= ~counter~0 0)} ~cond := #in~cond; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:07,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {217#(<= ~counter~0 0)} assume !(0 == ~cond); {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:07,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {217#(<= ~counter~0 0)} assume true; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:07,311 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:23:07,311 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:23:07,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {217#(<= ~counter~0 0)} ~cond := #in~cond; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:07,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {217#(<= ~counter~0 0)} assume !(0 == ~cond); {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:07,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {217#(<= ~counter~0 0)} assume true; {217#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:07,313 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:23:07,313 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:23:07,313 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:23:07,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {266#(<= |main_#t~post6| 0)} assume !(#t~post6 < 5);havoc #t~post6; {210#false} is VALID [2022-04-27 14:23:07,314 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:23:07,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {210#false} ~cond := #in~cond; {210#false} is VALID [2022-04-27 14:23:07,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {210#false} assume 0 == ~cond; {210#false} is VALID [2022-04-27 14:23:07,314 INFO L290 TraceCheckUtils]: 22: Hoare triple {210#false} assume !false; {210#false} is VALID [2022-04-27 14:23:07,315 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:23:07,315 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:23:07,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:23:07,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542068770] [2022-04-27 14:23:07,315 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:23:07,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518131715] [2022-04-27 14:23:07,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518131715] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:23:07,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:23:07,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 14:23:07,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603052639] [2022-04-27 14:23:07,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:23:07,317 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:23:07,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:23:07,317 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:23:07,330 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:23:07,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 14:23:07,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:23:07,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 14:23:07,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 14:23:07,332 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:23:07,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:07,379 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 14:23:07,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 14:23:07,380 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:23:07,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:23:07,380 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:23:07,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-27 14:23:07,382 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:23:07,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-27 14:23:07,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-27 14:23:07,410 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:23:07,412 INFO L225 Difference]: With dead ends: 34 [2022-04-27 14:23:07,412 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 14:23:07,412 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:23:07,413 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:23:07,413 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:23:07,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 14:23:07,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-27 14:23:07,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:23:07,421 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:23:07,421 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:23:07,422 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:23:07,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:07,423 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 14:23:07,423 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 14:23:07,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:07,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:07,424 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:23:07,424 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:23:07,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:07,426 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 14:23:07,426 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 14:23:07,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:07,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:07,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:23:07,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:23:07,427 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:23:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-27 14:23:07,428 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-04-27 14:23:07,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:23:07,429 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-27 14:23:07,429 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:23:07,429 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 14:23:07,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 14:23:07,436 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:23:07,437 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:23:07,458 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:23:07,655 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:23:07,655 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:23:07,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:23:07,656 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 1 times [2022-04-27 14:23:07,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:23:07,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983993171] [2022-04-27 14:23:07,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:23:07,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:23:07,670 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:23:07,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [679122662] [2022-04-27 14:23:07,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:23:07,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:23:07,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:23:07,682 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:23:07,693 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:23:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:07,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 14:23:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:07,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:23:07,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {422#true} call ULTIMATE.init(); {422#true} is VALID [2022-04-27 14:23:07,933 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:23:07,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {422#true} assume true; {422#true} is VALID [2022-04-27 14:23:07,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {422#true} {422#true} #67#return; {422#true} is VALID [2022-04-27 14:23:07,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {422#true} call #t~ret7 := main(); {422#true} is VALID [2022-04-27 14:23:07,933 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:23:07,933 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:23:07,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {422#true} ~cond := #in~cond; {422#true} is VALID [2022-04-27 14:23:07,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {422#true} assume !(0 == ~cond); {422#true} is VALID [2022-04-27 14:23:07,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {422#true} assume true; {422#true} is VALID [2022-04-27 14:23:07,934 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {422#true} {422#true} #59#return; {422#true} is VALID [2022-04-27 14:23:07,934 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:23:07,935 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:23:07,935 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:23:07,935 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:23:07,936 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:23:07,936 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:23:07,937 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:23:07,938 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 < 5);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:23:07,938 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:23:07,939 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:23:07,939 INFO L290 TraceCheckUtils]: 21: Hoare triple {492#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {423#false} is VALID [2022-04-27 14:23:07,940 INFO L290 TraceCheckUtils]: 22: Hoare triple {423#false} assume !false; {423#false} is VALID [2022-04-27 14:23:07,940 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:23:07,940 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:23:07,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:23:07,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983993171] [2022-04-27 14:23:07,940 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:23:07,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679122662] [2022-04-27 14:23:07,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679122662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:23:07,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:23:07,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 14:23:07,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891368262] [2022-04-27 14:23:07,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:23:07,941 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:23:07,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:23:07,942 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:23:07,962 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:23:07,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:23:07,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:23:07,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:23:07,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:23:07,963 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:23:08,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:08,173 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-27 14:23:08,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:23:08,174 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:23:08,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:23:08,175 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:23:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-27 14:23:08,178 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:23:08,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-27 14:23:08,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-27 14:23:08,209 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:23:08,214 INFO L225 Difference]: With dead ends: 37 [2022-04-27 14:23:08,214 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 14:23:08,215 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:23:08,216 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:23:08,217 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:23:08,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 14:23:08,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-27 14:23:08,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:23:08,231 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:23:08,231 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:23:08,232 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:23:08,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:08,238 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-27 14:23:08,238 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-27 14:23:08,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:08,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:08,241 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:23:08,241 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:23:08,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:08,243 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-27 14:23:08,243 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-27 14:23:08,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:08,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:08,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:23:08,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:23:08,244 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:23:08,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-27 14:23:08,245 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-04-27 14:23:08,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:23:08,245 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-27 14:23:08,246 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:23:08,246 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-27 14:23:08,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 14:23:08,246 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:23:08,246 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:23:08,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 14:23:08,447 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:23:08,447 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:23:08,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:23:08,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 1 times [2022-04-27 14:23:08,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:23:08,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295509560] [2022-04-27 14:23:08,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:23:08,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:23:08,463 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:23:08,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1106700869] [2022-04-27 14:23:08,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:23:08,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:23:08,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:23:08,464 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:23:08,465 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:23:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:08,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 14:23:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:08,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:23:08,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {670#true} call ULTIMATE.init(); {670#true} is VALID [2022-04-27 14:23:08,664 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:23:08,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {670#true} assume true; {670#true} is VALID [2022-04-27 14:23:08,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {670#true} {670#true} #67#return; {670#true} is VALID [2022-04-27 14:23:08,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {670#true} call #t~ret7 := main(); {670#true} is VALID [2022-04-27 14:23:08,664 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:23:08,665 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:23:08,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {670#true} ~cond := #in~cond; {670#true} is VALID [2022-04-27 14:23:08,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {670#true} assume !(0 == ~cond); {670#true} is VALID [2022-04-27 14:23:08,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {670#true} assume true; {670#true} is VALID [2022-04-27 14:23:08,665 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {670#true} {670#true} #59#return; {670#true} is VALID [2022-04-27 14:23:08,665 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:23:08,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {670#true} ~cond := #in~cond; {670#true} is VALID [2022-04-27 14:23:08,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {670#true} assume !(0 == ~cond); {670#true} is VALID [2022-04-27 14:23:08,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {670#true} assume true; {670#true} is VALID [2022-04-27 14:23:08,666 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {670#true} {670#true} #61#return; {670#true} is VALID [2022-04-27 14:23:08,666 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:23:08,666 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:23:08,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {670#true} assume !!(#t~post6 < 5);havoc #t~post6; {670#true} is VALID [2022-04-27 14:23:08,666 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:23:08,667 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:23:08,667 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:23:08,667 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:23:08,670 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:23:08,671 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:23:08,671 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:23:08,672 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:23:08,672 INFO L290 TraceCheckUtils]: 27: Hoare triple {758#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {671#false} is VALID [2022-04-27 14:23:08,672 INFO L290 TraceCheckUtils]: 28: Hoare triple {671#false} assume !false; {671#false} is VALID [2022-04-27 14:23:08,672 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:23:08,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:23:13,940 INFO L290 TraceCheckUtils]: 28: Hoare triple {671#false} assume !false; {671#false} is VALID [2022-04-27 14:23:13,940 INFO L290 TraceCheckUtils]: 27: Hoare triple {758#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {671#false} is VALID [2022-04-27 14:23:13,941 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:23:13,942 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:23:13,942 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:23:13,943 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:23:13,943 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:23:13,944 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:23:13,944 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:23:13,944 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:23:13,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {670#true} assume !!(#t~post6 < 5);havoc #t~post6; {670#true} is VALID [2022-04-27 14:23:13,944 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:23:13,944 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:23:13,945 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {670#true} {670#true} #61#return; {670#true} is VALID [2022-04-27 14:23:13,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {670#true} assume true; {670#true} is VALID [2022-04-27 14:23:13,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {670#true} assume !(0 == ~cond); {670#true} is VALID [2022-04-27 14:23:13,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {670#true} ~cond := #in~cond; {670#true} is VALID [2022-04-27 14:23:13,945 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:23:13,945 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {670#true} {670#true} #59#return; {670#true} is VALID [2022-04-27 14:23:13,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {670#true} assume true; {670#true} is VALID [2022-04-27 14:23:13,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {670#true} assume !(0 == ~cond); {670#true} is VALID [2022-04-27 14:23:13,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {670#true} ~cond := #in~cond; {670#true} is VALID [2022-04-27 14:23:13,946 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:23:13,946 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:23:13,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {670#true} call #t~ret7 := main(); {670#true} is VALID [2022-04-27 14:23:13,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {670#true} {670#true} #67#return; {670#true} is VALID [2022-04-27 14:23:13,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {670#true} assume true; {670#true} is VALID [2022-04-27 14:23:13,946 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:23:13,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {670#true} call ULTIMATE.init(); {670#true} is VALID [2022-04-27 14:23:13,947 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:23:13,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:23:13,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295509560] [2022-04-27 14:23:13,947 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:23:13,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106700869] [2022-04-27 14:23:13,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106700869] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:23:13,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:23:13,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 14:23:13,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250999033] [2022-04-27 14:23:13,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:23:13,948 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:23:13,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:23:13,949 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:23:13,967 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:23:13,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:23:13,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:23:13,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:23:13,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:23:13,968 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:23:14,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:14,165 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-27 14:23:14,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:23:14,165 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:23:14,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:23:14,165 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:23:14,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-27 14:23:14,167 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:23:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-27 14:23:14,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-27 14:23:14,197 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:23:14,198 INFO L225 Difference]: With dead ends: 39 [2022-04-27 14:23:14,198 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 14:23:14,199 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:23:14,199 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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:23:14,200 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:23:14,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 14:23:14,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-04-27 14:23:14,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:23:14,208 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:23:14,208 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:23:14,208 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:23:14,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:14,210 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-27 14:23:14,211 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-27 14:23:14,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:14,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:14,213 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:23:14,214 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:23:14,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:14,223 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-27 14:23:14,223 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-27 14:23:14,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:14,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:14,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:23:14,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:23:14,225 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:23:14,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-27 14:23:14,229 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-04-27 14:23:14,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:23:14,230 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-27 14:23:14,230 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:23:14,231 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-27 14:23:14,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 14:23:14,232 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:23:14,232 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:23:14,265 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:14,433 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:14,433 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:23:14,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:23:14,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 1 times [2022-04-27 14:23:14,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:23:14,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502626991] [2022-04-27 14:23:14,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:23:14,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:23:14,445 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:23:14,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [468593782] [2022-04-27 14:23:14,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:23:14,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:23:14,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:23:14,447 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:14,475 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:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:14,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:23:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:14,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:23:14,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {1024#true} call ULTIMATE.init(); {1024#true} is VALID [2022-04-27 14:23:14,656 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:14,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {1032#(<= ~counter~0 0)} assume true; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:14,656 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:14,657 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:14,657 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:14,657 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:14,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {1032#(<= ~counter~0 0)} ~cond := #in~cond; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:14,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {1032#(<= ~counter~0 0)} assume !(0 == ~cond); {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:14,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {1032#(<= ~counter~0 0)} assume true; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:14,659 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:14,659 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:14,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {1032#(<= ~counter~0 0)} ~cond := #in~cond; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:14,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {1032#(<= ~counter~0 0)} assume !(0 == ~cond); {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:14,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {1032#(<= ~counter~0 0)} assume true; {1032#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:14,660 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:14,661 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:14,661 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:14,661 INFO L290 TraceCheckUtils]: 18: Hoare triple {1081#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:14,662 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:14,662 INFO L290 TraceCheckUtils]: 20: Hoare triple {1081#(<= ~counter~0 1)} ~cond := #in~cond; {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:14,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {1081#(<= ~counter~0 1)} assume !(0 == ~cond); {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:14,663 INFO L290 TraceCheckUtils]: 22: Hoare triple {1081#(<= ~counter~0 1)} assume true; {1081#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:14,663 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:14,664 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:14,664 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:14,664 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:14,665 INFO L290 TraceCheckUtils]: 27: Hoare triple {1109#(<= |main_#t~post6| 1)} assume !(#t~post6 < 5);havoc #t~post6; {1025#false} is VALID [2022-04-27 14:23:14,665 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:14,665 INFO L290 TraceCheckUtils]: 29: Hoare triple {1025#false} ~cond := #in~cond; {1025#false} is VALID [2022-04-27 14:23:14,665 INFO L290 TraceCheckUtils]: 30: Hoare triple {1025#false} assume 0 == ~cond; {1025#false} is VALID [2022-04-27 14:23:14,665 INFO L290 TraceCheckUtils]: 31: Hoare triple {1025#false} assume !false; {1025#false} is VALID [2022-04-27 14:23:14,665 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:14,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:23:14,825 INFO L290 TraceCheckUtils]: 31: Hoare triple {1025#false} assume !false; {1025#false} is VALID [2022-04-27 14:23:14,825 INFO L290 TraceCheckUtils]: 30: Hoare triple {1025#false} assume 0 == ~cond; {1025#false} is VALID [2022-04-27 14:23:14,826 INFO L290 TraceCheckUtils]: 29: Hoare triple {1025#false} ~cond := #in~cond; {1025#false} is VALID [2022-04-27 14:23:14,826 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:14,826 INFO L290 TraceCheckUtils]: 27: Hoare triple {1137#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {1025#false} is VALID [2022-04-27 14:23:14,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {1141#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1137#(< |main_#t~post6| 5)} is VALID [2022-04-27 14:23:14,827 INFO L290 TraceCheckUtils]: 25: Hoare triple {1141#(< ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1141#(< ~counter~0 5)} is VALID [2022-04-27 14:23:14,828 INFO L290 TraceCheckUtils]: 24: Hoare triple {1141#(< ~counter~0 5)} assume !!(0 != ~y3~0); {1141#(< ~counter~0 5)} is VALID [2022-04-27 14:23:14,829 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1024#true} {1141#(< ~counter~0 5)} #63#return; {1141#(< ~counter~0 5)} is VALID [2022-04-27 14:23:14,829 INFO L290 TraceCheckUtils]: 22: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:23:14,829 INFO L290 TraceCheckUtils]: 21: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:23:14,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:23:14,829 INFO L272 TraceCheckUtils]: 19: Hoare triple {1141#(< ~counter~0 5)} 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:14,833 INFO L290 TraceCheckUtils]: 18: Hoare triple {1141#(< ~counter~0 5)} assume !!(#t~post6 < 5);havoc #t~post6; {1141#(< ~counter~0 5)} is VALID [2022-04-27 14:23:14,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {1169#(< ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1141#(< ~counter~0 5)} is VALID [2022-04-27 14:23:14,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {1169#(< ~counter~0 4)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1169#(< ~counter~0 4)} is VALID [2022-04-27 14:23:14,835 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1024#true} {1169#(< ~counter~0 4)} #61#return; {1169#(< ~counter~0 4)} is VALID [2022-04-27 14:23:14,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:23:14,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:23:14,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:23:14,835 INFO L272 TraceCheckUtils]: 11: Hoare triple {1169#(< ~counter~0 4)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1024#true} is VALID [2022-04-27 14:23:14,836 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1024#true} {1169#(< ~counter~0 4)} #59#return; {1169#(< ~counter~0 4)} is VALID [2022-04-27 14:23:14,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-27 14:23:14,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-27 14:23:14,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-27 14:23:14,836 INFO L272 TraceCheckUtils]: 6: Hoare triple {1169#(< ~counter~0 4)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1024#true} is VALID [2022-04-27 14:23:14,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {1169#(< ~counter~0 4)} 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 4)} is VALID [2022-04-27 14:23:14,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {1169#(< ~counter~0 4)} call #t~ret7 := main(); {1169#(< ~counter~0 4)} is VALID [2022-04-27 14:23:14,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1169#(< ~counter~0 4)} {1024#true} #67#return; {1169#(< ~counter~0 4)} is VALID [2022-04-27 14:23:14,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {1169#(< ~counter~0 4)} assume true; {1169#(< ~counter~0 4)} is VALID [2022-04-27 14:23:14,841 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 4)} is VALID [2022-04-27 14:23:14,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {1024#true} call ULTIMATE.init(); {1024#true} is VALID [2022-04-27 14:23:14,841 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:14,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:23:14,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502626991] [2022-04-27 14:23:14,842 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:23:14,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468593782] [2022-04-27 14:23:14,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468593782] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:23:14,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:23:14,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 14:23:14,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666215446] [2022-04-27 14:23:14,842 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:23:14,843 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:14,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:23:14,843 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:14,881 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:14,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:23:14,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:23:14,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:23:14,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:23:14,882 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:15,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:15,056 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-04-27 14:23:15,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:23:15,056 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:15,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:23:15,056 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:15,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-27 14:23:15,058 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:15,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-27 14:23:15,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 67 transitions. [2022-04-27 14:23:15,102 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:15,103 INFO L225 Difference]: With dead ends: 61 [2022-04-27 14:23:15,103 INFO L226 Difference]: Without dead ends: 56 [2022-04-27 14:23:15,103 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:15,104 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:15,104 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:15,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-27 14:23:15,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-27 14:23:15,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:23:15,120 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:15,120 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:15,120 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:15,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:15,122 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-27 14:23:15,122 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-27 14:23:15,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:15,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:15,122 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:15,122 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:15,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:15,124 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-27 14:23:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-27 14:23:15,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:15,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:15,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:23:15,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:23:15,125 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:15,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-27 14:23:15,126 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 32 [2022-04-27 14:23:15,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:23:15,126 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-27 14:23:15,126 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:15,126 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-27 14:23:15,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-27 14:23:15,127 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:23:15,127 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:15,159 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:15,344 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:15,344 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:23:15,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:23:15,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1632159894, now seen corresponding path program 2 times [2022-04-27 14:23:15,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:23:15,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044236092] [2022-04-27 14:23:15,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:23:15,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:23:15,375 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:23:15,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1913671440] [2022-04-27 14:23:15,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:23:15,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:23:15,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:23:15,391 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:15,395 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:15,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:23:15,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:23:15,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 14:23:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:23:15,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:23:15,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} call ULTIMATE.init(); {1504#true} is VALID [2022-04-27 14:23:15,713 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:15,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {1512#(<= ~counter~0 0)} assume true; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:15,714 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:15,714 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:15,715 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:15,715 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:15,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {1512#(<= ~counter~0 0)} ~cond := #in~cond; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:15,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {1512#(<= ~counter~0 0)} assume !(0 == ~cond); {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:15,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {1512#(<= ~counter~0 0)} assume true; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:15,716 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:15,717 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:15,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {1512#(<= ~counter~0 0)} ~cond := #in~cond; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:15,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {1512#(<= ~counter~0 0)} assume !(0 == ~cond); {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:15,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {1512#(<= ~counter~0 0)} assume true; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:15,718 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:15,718 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:15,719 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:15,719 INFO L290 TraceCheckUtils]: 18: Hoare triple {1561#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:15,720 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:15,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {1561#(<= ~counter~0 1)} ~cond := #in~cond; {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:15,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {1561#(<= ~counter~0 1)} assume !(0 == ~cond); {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:15,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {1561#(<= ~counter~0 1)} assume true; {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:15,721 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:15,721 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:15,721 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:15,722 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:15,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {1589#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:15,722 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:15,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {1589#(<= ~counter~0 2)} ~cond := #in~cond; {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:15,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {1589#(<= ~counter~0 2)} assume !(0 == ~cond); {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:15,723 INFO L290 TraceCheckUtils]: 31: Hoare triple {1589#(<= ~counter~0 2)} assume true; {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:15,724 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:15,724 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:15,724 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:15,725 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:15,725 INFO L290 TraceCheckUtils]: 36: Hoare triple {1617#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:15,726 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:15,726 INFO L290 TraceCheckUtils]: 38: Hoare triple {1617#(<= ~counter~0 3)} ~cond := #in~cond; {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:15,731 INFO L290 TraceCheckUtils]: 39: Hoare triple {1617#(<= ~counter~0 3)} assume !(0 == ~cond); {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:15,731 INFO L290 TraceCheckUtils]: 40: Hoare triple {1617#(<= ~counter~0 3)} assume true; {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:15,732 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:15,732 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:15,732 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:15,733 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:15,733 INFO L290 TraceCheckUtils]: 45: Hoare triple {1645#(<= ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:15,733 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:15,734 INFO L290 TraceCheckUtils]: 47: Hoare triple {1645#(<= ~counter~0 4)} ~cond := #in~cond; {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:15,734 INFO L290 TraceCheckUtils]: 48: Hoare triple {1645#(<= ~counter~0 4)} assume !(0 == ~cond); {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:15,734 INFO L290 TraceCheckUtils]: 49: Hoare triple {1645#(<= ~counter~0 4)} assume true; {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:15,734 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:15,735 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:15,735 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:15,735 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:15,736 INFO L290 TraceCheckUtils]: 54: Hoare triple {1673#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {1505#false} is VALID [2022-04-27 14:23:15,736 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:15,736 INFO L290 TraceCheckUtils]: 56: Hoare triple {1505#false} ~cond := #in~cond; {1505#false} is VALID [2022-04-27 14:23:15,736 INFO L290 TraceCheckUtils]: 57: Hoare triple {1505#false} assume 0 == ~cond; {1505#false} is VALID [2022-04-27 14:23:15,736 INFO L290 TraceCheckUtils]: 58: Hoare triple {1505#false} assume !false; {1505#false} is VALID [2022-04-27 14:23:15,736 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:15,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:23:15,960 INFO L290 TraceCheckUtils]: 58: Hoare triple {1505#false} assume !false; {1505#false} is VALID [2022-04-27 14:23:15,960 INFO L290 TraceCheckUtils]: 57: Hoare triple {1505#false} assume 0 == ~cond; {1505#false} is VALID [2022-04-27 14:23:15,960 INFO L290 TraceCheckUtils]: 56: Hoare triple {1505#false} ~cond := #in~cond; {1505#false} is VALID [2022-04-27 14:23:15,960 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:15,961 INFO L290 TraceCheckUtils]: 54: Hoare triple {1673#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {1505#false} is VALID [2022-04-27 14:23:15,961 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:15,961 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:15,961 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:15,962 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1504#true} {1645#(<= ~counter~0 4)} #63#return; {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:15,962 INFO L290 TraceCheckUtils]: 49: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-27 14:23:15,962 INFO L290 TraceCheckUtils]: 48: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-27 14:23:15,962 INFO L290 TraceCheckUtils]: 47: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-27 14:23:15,962 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)); {1504#true} is VALID [2022-04-27 14:23:15,962 INFO L290 TraceCheckUtils]: 45: Hoare triple {1645#(<= ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {1645#(<= ~counter~0 4)} is VALID [2022-04-27 14:23:15,963 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:15,963 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:15,963 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:15,964 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1504#true} {1617#(<= ~counter~0 3)} #63#return; {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:15,964 INFO L290 TraceCheckUtils]: 40: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-27 14:23:15,965 INFO L290 TraceCheckUtils]: 39: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-27 14:23:15,965 INFO L290 TraceCheckUtils]: 38: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-27 14:23:15,965 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)); {1504#true} is VALID [2022-04-27 14:23:15,966 INFO L290 TraceCheckUtils]: 36: Hoare triple {1617#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {1617#(<= ~counter~0 3)} is VALID [2022-04-27 14:23:15,966 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:15,966 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:15,967 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:15,967 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1504#true} {1589#(<= ~counter~0 2)} #63#return; {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:15,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-27 14:23:15,967 INFO L290 TraceCheckUtils]: 30: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-27 14:23:15,967 INFO L290 TraceCheckUtils]: 29: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-27 14:23:15,967 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)); {1504#true} is VALID [2022-04-27 14:23:15,968 INFO L290 TraceCheckUtils]: 27: Hoare triple {1589#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {1589#(<= ~counter~0 2)} is VALID [2022-04-27 14:23:15,968 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:15,969 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:15,969 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:15,969 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1504#true} {1561#(<= ~counter~0 1)} #63#return; {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:15,969 INFO L290 TraceCheckUtils]: 22: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-27 14:23:15,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-27 14:23:15,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-27 14:23:15,970 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)); {1504#true} is VALID [2022-04-27 14:23:15,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {1561#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1561#(<= ~counter~0 1)} is VALID [2022-04-27 14:23:15,972 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:15,972 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:15,972 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1504#true} {1512#(<= ~counter~0 0)} #61#return; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:15,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-27 14:23:15,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-27 14:23:15,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-27 14:23:15,973 INFO L272 TraceCheckUtils]: 11: Hoare triple {1512#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1504#true} is VALID [2022-04-27 14:23:15,973 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1504#true} {1512#(<= ~counter~0 0)} #59#return; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:15,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-27 14:23:15,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {1504#true} assume !(0 == ~cond); {1504#true} is VALID [2022-04-27 14:23:15,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {1504#true} ~cond := #in~cond; {1504#true} is VALID [2022-04-27 14:23:15,973 INFO L272 TraceCheckUtils]: 6: Hoare triple {1512#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1504#true} is VALID [2022-04-27 14:23:15,974 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:15,974 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:15,974 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:15,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {1512#(<= ~counter~0 0)} assume true; {1512#(<= ~counter~0 0)} is VALID [2022-04-27 14:23:15,975 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:15,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} call ULTIMATE.init(); {1504#true} is VALID [2022-04-27 14:23:15,975 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:15,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:23:15,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044236092] [2022-04-27 14:23:15,975 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:23:15,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913671440] [2022-04-27 14:23:15,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913671440] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:23:15,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:23:15,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-27 14:23:15,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700722980] [2022-04-27 14:23:15,976 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:23:15,976 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) Word has length 59 [2022-04-27 14:23:15,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:23:15,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-27 14:23:16,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:23:16,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:23:16,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:23:16,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:23:16,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:23:16,022 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-27 14:23:16,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:16,180 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-04-27 14:23:16,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 14:23:16,180 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) Word has length 59 [2022-04-27 14:23:16,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:23:16,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-27 14:23:16,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2022-04-27 14:23:16,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-27 14:23:16,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2022-04-27 14:23:16,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 75 transitions. [2022-04-27 14:23:16,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:23:16,235 INFO L225 Difference]: With dead ends: 70 [2022-04-27 14:23:16,235 INFO L226 Difference]: Without dead ends: 65 [2022-04-27 14:23:16,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:23:16,236 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 20 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:23:16,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 96 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:23:16,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-27 14:23:16,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-27 14:23:16,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:23:16,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:23:16,266 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:23:16,266 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:23:16,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:16,268 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-04-27 14:23:16,268 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-27 14:23:16,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:16,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:16,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-27 14:23:16,269 INFO L87 Difference]: Start difference. First operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-27 14:23:16,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:23:16,270 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-04-27 14:23:16,270 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-27 14:23:16,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:23:16,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:23:16,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:23:16,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:23:16,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:23:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-04-27 14:23:16,272 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 59 [2022-04-27 14:23:16,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:23:16,273 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-04-27 14:23:16,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 7 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-04-27 14:23:16,273 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-27 14:23:16,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-27 14:23:16,273 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:23:16,273 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:23:16,305 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:16,483 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:16,483 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:23:16,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:23:16,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1512407140, now seen corresponding path program 3 times [2022-04-27 14:23:16,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:23:16,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214851887] [2022-04-27 14:23:16,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:23:16,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:23:16,497 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:23:16,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [202170967] [2022-04-27 14:23:16,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:23:16,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:23:16,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:23:16,499 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:16,500 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:16,546 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-04-27 14:23:16,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-27 14:23:16,547 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 14:23:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 14:23:16,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 14:23:16,585 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 14:23:16,585 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 14:23:16,619 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:16,800 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:16,803 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2022-04-27 14:23:16,805 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 14:23:16,830 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 14:23:16,830 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 14:23:16,830 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 14:23:16,830 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 14:23:16,830 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 14:23:16,830 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 14:23:16,830 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 14:23:16,830 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 14:23:16,830 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:23:16,830 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 14:23:16,830 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 14:23:16,830 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:23:16,830 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:23:16,831 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 14:23:16,831 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 14:23:16,831 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 14:23:16,831 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 14:23:16,831 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 14:23:16,831 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:23:16,831 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-27 14:23:16,831 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-27 14:23:16,831 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-27 14:23:16,831 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-27 14:23:16,831 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-27 14:23:16,831 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-27 14:23:16,831 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:23:16,831 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:23:16,831 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-27 14:23:16,831 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:23:16,831 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:23:16,831 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-04-27 14:23:16,831 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-04-27 14:23:16,831 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-27 14:23:16,831 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-27 14:23:16,831 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 14:23:16,831 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2022-04-27 14:23:16,831 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2022-04-27 14:23:16,831 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 14:23:16,831 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-27 14:23:16,831 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-27 14:23:16,832 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-27 14:23:16,832 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 14:23:16,832 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 14:23:16,832 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 14:23:16,832 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 14:23:16,832 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:16,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 02:23:16 BoogieIcfgContainer [2022-04-27 14:23:16,832 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 14:23:16,833 INFO L158 Benchmark]: Toolchain (without parser) took 10917.97ms. Allocated memory was 182.5MB in the beginning and 299.9MB in the end (delta: 117.4MB). Free memory was 131.0MB in the beginning and 161.4MB in the end (delta: -30.4MB). Peak memory consumption was 88.5MB. Max. memory is 8.0GB. [2022-04-27 14:23:16,833 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 182.5MB. Free memory is still 147.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:23:16,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.63ms. Allocated memory is still 182.5MB. Free memory was 130.7MB in the beginning and 156.3MB in the end (delta: -25.6MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-04-27 14:23:16,833 INFO L158 Benchmark]: Boogie Preprocessor took 33.79ms. Allocated memory is still 182.5MB. Free memory was 156.3MB in the beginning and 154.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 14:23:16,834 INFO L158 Benchmark]: RCFGBuilder took 217.84ms. Allocated memory is still 182.5MB. Free memory was 154.7MB in the beginning and 143.2MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 14:23:16,834 INFO L158 Benchmark]: TraceAbstraction took 10423.42ms. Allocated memory was 182.5MB in the beginning and 299.9MB in the end (delta: 117.4MB). Free memory was 142.7MB in the beginning and 161.4MB in the end (delta: -18.7MB). Peak memory consumption was 100.3MB. Max. memory is 8.0GB. [2022-04-27 14:23:16,835 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.42ms. Allocated memory is still 182.5MB. Free memory is still 147.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 238.63ms. Allocated memory is still 182.5MB. Free memory was 130.7MB in the beginning and 156.3MB in the end (delta: -25.6MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.79ms. Allocated memory is still 182.5MB. Free memory was 156.3MB in the beginning and 154.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 217.84ms. Allocated memory is still 182.5MB. Free memory was 154.7MB in the beginning and 143.2MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 10423.42ms. Allocated memory was 182.5MB in the beginning and 299.9MB in the end (delta: 117.4MB). Free memory was 142.7MB in the beginning and 161.4MB in the end (delta: -18.7MB). Peak memory consumption was 100.3MB. 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)=7, 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=6, 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=6, x2=1] [L32] y1 = 0 [L33] y2 = 0 [L34] y3 = x1 VAL [\old(counter)=0, counter=0, x1=6, x2=1, y1=0, y2=0, y3=6] [L36] EXPR counter++ VAL [\old(counter)=0, counter=1, counter++=0, x1=6, x2=1, y1=0, y2=0, y3=6] [L36] COND TRUE counter++<5 [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=6, x2=1, y1=0, y2=0, y3=6] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=1, x1=6, x2=1, y1=0, 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=1, x1=6, x2=1, y1=1, y2=0, y3=5] [L36] EXPR counter++ VAL [\old(counter)=0, counter=2, counter++=1, x1=6, x2=1, y1=1, y2=0, y3=5] [L36] COND TRUE counter++<5 [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=6, x2=1, y1=1, y2=0, y3=5] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=2, x1=6, x2=1, y1=1, 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=2, x1=6, x2=1, y1=2, y2=0, y3=4] [L36] EXPR counter++ VAL [\old(counter)=0, counter=3, counter++=2, x1=6, x2=1, y1=2, y2=0, y3=4] [L36] COND TRUE counter++<5 [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=6, x2=1, y1=2, y2=0, y3=4] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=3, x1=6, x2=1, y1=2, 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=3, x1=6, x2=1, y1=3, y2=0, y3=3] [L36] EXPR counter++ VAL [\old(counter)=0, counter=4, counter++=3, x1=6, x2=1, y1=3, y2=0, y3=3] [L36] COND TRUE counter++<5 [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=6, x2=1, y1=3, y2=0, y3=3] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=4, x1=6, x2=1, y1=3, 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=4, x1=6, x2=1, y1=4, y2=0, y3=2] [L36] EXPR counter++ VAL [\old(counter)=0, counter=5, counter++=4, x1=6, x2=1, y1=4, y2=0, y3=2] [L36] COND TRUE counter++<5 [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=6, x2=1, y1=4, y2=0, y3=2] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=5, x1=6, x2=1, y1=4, 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=5, x1=6, x2=1, y1=5, y2=0, y3=1] [L36] EXPR counter++ VAL [\old(counter)=0, counter=6, counter++=5, x1=6, x2=1, y1=5, y2=0, y3=1] [L36] COND FALSE !(counter++<5) [L50] CALL __VERIFIER_assert(y1*x2 + y2 == x1) VAL [\old(cond)=0, \old(counter)=0, counter=6] [L16] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=6] [L18] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 7, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 115 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 532 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 374 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 207 IncrementalHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 158 mSDtfsCounter, 207 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 303 GetRequests, 260 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=6, InterpolantAutomatonStates: 45, 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, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 699 SizeOfPredicates, 18 NumberOfNonLiveVariables, 591 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 82/188 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:16,864 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...