/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/prodbin-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 17:25:56,259 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 17:25:56,260 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 17:25:56,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 17:25:56,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 17:25:56,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 17:25:56,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 17:25:56,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 17:25:56,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 17:25:56,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 17:25:56,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 17:25:56,307 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 17:25:56,307 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 17:25:56,307 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 17:25:56,308 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 17:25:56,309 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 17:25:56,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 17:25:56,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 17:25:56,311 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 17:25:56,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 17:25:56,313 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 17:25:56,314 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 17:25:56,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 17:25:56,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 17:25:56,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 17:25:56,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 17:25:56,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 17:25:56,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 17:25:56,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 17:25:56,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 17:25:56,330 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 17:25:56,330 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 17:25:56,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 17:25:56,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 17:25:56,332 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 17:25:56,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 17:25:56,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 17:25:56,333 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 17:25:56,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 17:25:56,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 17:25:56,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 17:25:56,336 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 17:25:56,337 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-14 17:25:56,370 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 17:25:56,371 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 17:25:56,371 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 17:25:56,371 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 17:25:56,372 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 17:25:56,372 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 17:25:56,372 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 17:25:56,373 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 17:25:56,373 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 17:25:56,374 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 17:25:56,374 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 17:25:56,374 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 17:25:56,374 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 17:25:56,374 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 17:25:56,374 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 17:25:56,374 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 17:25:56,374 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 17:25:56,374 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 17:25:56,375 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 17:25:56,375 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 17:25:56,375 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 17:25:56,375 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 17:25:56,375 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 17:25:56,375 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 17:25:56,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 17:25:56,375 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 17:25:56,376 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 17:25:56,376 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 17:25:56,376 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 17:25:56,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 17:25:56,376 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 17:25:56,376 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 17:25:56,376 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 17:25:56,376 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-14 17:25:56,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 17:25:56,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 17:25:56,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 17:25:56,584 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 17:25:56,584 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 17:25:56,585 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound10.c [2022-04-14 17:25:56,643 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4152e82f/474cad6f0f8f46b78401e7349ea15775/FLAG69e99c619 [2022-04-14 17:25:56,952 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 17:25:56,952 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound10.c [2022-04-14 17:25:56,957 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4152e82f/474cad6f0f8f46b78401e7349ea15775/FLAG69e99c619 [2022-04-14 17:25:56,965 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4152e82f/474cad6f0f8f46b78401e7349ea15775 [2022-04-14 17:25:56,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 17:25:56,969 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 17:25:56,970 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 17:25:56,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 17:25:56,972 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 17:25:56,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 05:25:56" (1/1) ... [2022-04-14 17:25:56,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@da9cf5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:25:56, skipping insertion in model container [2022-04-14 17:25:56,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 05:25:56" (1/1) ... [2022-04-14 17:25:56,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 17:25:56,991 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 17:25:57,130 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/prodbin-ll_valuebound10.c[537,550] [2022-04-14 17:25:57,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 17:25:57,153 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 17:25:57,164 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/prodbin-ll_valuebound10.c[537,550] [2022-04-14 17:25:57,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 17:25:57,180 INFO L208 MainTranslator]: Completed translation [2022-04-14 17:25:57,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:25:57 WrapperNode [2022-04-14 17:25:57,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 17:25:57,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 17:25:57,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 17:25:57,181 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 17:25:57,189 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:25:57" (1/1) ... [2022-04-14 17:25:57,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:25:57" (1/1) ... [2022-04-14 17:25:57,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:25:57" (1/1) ... [2022-04-14 17:25:57,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:25:57" (1/1) ... [2022-04-14 17:25:57,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:25:57" (1/1) ... [2022-04-14 17:25:57,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:25:57" (1/1) ... [2022-04-14 17:25:57,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:25:57" (1/1) ... [2022-04-14 17:25:57,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 17:25:57,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 17:25:57,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 17:25:57,209 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 17:25:57,210 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:25:57" (1/1) ... [2022-04-14 17:25:57,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 17:25:57,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:25:57,236 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-14 17:25:57,247 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-14 17:25:57,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 17:25:57,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 17:25:57,267 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 17:25:57,267 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 17:25:57,267 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 17:25:57,267 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 17:25:57,267 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 17:25:57,267 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 17:25:57,268 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 17:25:57,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 17:25:57,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 17:25:57,268 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 17:25:57,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 17:25:57,268 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 17:25:57,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 17:25:57,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 17:25:57,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 17:25:57,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 17:25:57,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 17:25:57,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 17:25:57,315 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 17:25:57,316 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 17:25:57,494 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 17:25:57,500 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 17:25:57,501 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 17:25:57,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 05:25:57 BoogieIcfgContainer [2022-04-14 17:25:57,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 17:25:57,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 17:25:57,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 17:25:57,507 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 17:25:57,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 05:25:56" (1/3) ... [2022-04-14 17:25:57,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19897d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 05:25:57, skipping insertion in model container [2022-04-14 17:25:57,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:25:57" (2/3) ... [2022-04-14 17:25:57,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19897d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 05:25:57, skipping insertion in model container [2022-04-14 17:25:57,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 05:25:57" (3/3) ... [2022-04-14 17:25:57,510 INFO L111 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound10.c [2022-04-14 17:25:57,514 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 17:25:57,514 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 17:25:57,550 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 17:25:57,556 INFO L340 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 [2022-04-14 17:25:57,556 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 17:25:57,573 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 17:25:57,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-14 17:25:57,578 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:25:57,578 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:25:57,579 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:25:57,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:25:57,583 INFO L85 PathProgramCache]: Analyzing trace with hash -589322634, now seen corresponding path program 1 times [2022-04-14 17:25:57,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:25:57,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774001270] [2022-04-14 17:25:57,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:25:57,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:25:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:25:57,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 17:25:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:25:57,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {52#(and (= |#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(13, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-14 17:25:57,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-14 17:25:57,818 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2022-04-14 17:25:57,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 17:25:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:25:57,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-14 17:25:57,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-14 17:25:57,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-14 17:25:57,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-14 17:25:57,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-14 17:25:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:25:57,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-14 17:25:57,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-14 17:25:57,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-14 17:25:57,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-14 17:25:57,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-14 17:25:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:25:57,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-14 17:25:57,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-14 17:25:57,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-14 17:25:57,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-14 17:25:57,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {52#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 17:25:57,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {52#(and (= |#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(13, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-14 17:25:57,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-14 17:25:57,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2022-04-14 17:25:57,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret6 := main(); {35#true} is VALID [2022-04-14 17:25:57,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {35#true} is VALID [2022-04-14 17:25:57,877 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {35#true} is VALID [2022-04-14 17:25:57,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-14 17:25:57,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-14 17:25:57,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-14 17:25:57,880 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-14 17:25:57,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {36#false} is VALID [2022-04-14 17:25:57,881 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {35#true} is VALID [2022-04-14 17:25:57,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-14 17:25:57,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-14 17:25:57,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-14 17:25:57,884 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-14 17:25:57,884 INFO L272 TraceCheckUtils]: 17: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {35#true} is VALID [2022-04-14 17:25:57,884 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-14 17:25:57,886 INFO L290 TraceCheckUtils]: 19: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-14 17:25:57,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-14 17:25:57,886 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-14 17:25:57,886 INFO L290 TraceCheckUtils]: 22: Hoare triple {36#false} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {36#false} is VALID [2022-04-14 17:25:57,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {36#false} assume false; {36#false} is VALID [2022-04-14 17:25:57,887 INFO L272 TraceCheckUtils]: 24: Hoare triple {36#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {36#false} is VALID [2022-04-14 17:25:57,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-14 17:25:57,887 INFO L290 TraceCheckUtils]: 26: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-14 17:25:57,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-14 17:25:57,888 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 17:25:57,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:25:57,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774001270] [2022-04-14 17:25:57,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774001270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 17:25:57,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 17:25:57,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 17:25:57,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417023318] [2022-04-14 17:25:57,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 17:25:57,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-14 17:25:57,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:25:57,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 17:25:57,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:25:57,951 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 17:25:57,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:25:57,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 17:25:57,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 17:25:57,983 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 17:25:58,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:25:58,138 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2022-04-14 17:25:58,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 17:25:58,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-14 17:25:58,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:25:58,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 17:25:58,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-14 17:25:58,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 17:25:58,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-14 17:25:58,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2022-04-14 17:25:58,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:25:58,240 INFO L225 Difference]: With dead ends: 57 [2022-04-14 17:25:58,240 INFO L226 Difference]: Without dead ends: 27 [2022-04-14 17:25:58,242 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-14 17:25:58,245 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 17:25:58,246 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 17:25:58,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-14 17:25:58,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-14 17:25:58,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:25:58,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 17:25:58,272 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 17:25:58,272 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 17:25:58,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:25:58,276 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-14 17:25:58,276 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-14 17:25:58,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:25:58,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:25:58,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-04-14 17:25:58,277 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-04-14 17:25:58,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:25:58,281 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-14 17:25:58,281 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-14 17:25:58,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:25:58,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:25:58,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:25:58,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:25:58,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 17:25:58,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-14 17:25:58,285 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 28 [2022-04-14 17:25:58,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:25:58,286 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-14 17:25:58,286 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 17:25:58,286 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-14 17:25:58,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-14 17:25:58,289 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:25:58,290 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:25:58,290 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 17:25:58,290 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:25:58,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:25:58,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1736242504, now seen corresponding path program 1 times [2022-04-14 17:25:58,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:25:58,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986065115] [2022-04-14 17:25:58,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:25:58,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:25:58,313 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:25:58,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1123312198] [2022-04-14 17:25:58,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:25:58,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:25:58,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:25:58,315 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-14 17:25:58,327 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-14 17:25:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:25:58,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 17:25:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:25:58,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:25:58,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {224#true} call ULTIMATE.init(); {224#true} is VALID [2022-04-14 17:25:58,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#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(13, 2);call #Ultimate.allocInit(12, 3); {224#true} is VALID [2022-04-14 17:25:58,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-14 17:25:58,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {224#true} {224#true} #71#return; {224#true} is VALID [2022-04-14 17:25:58,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {224#true} call #t~ret6 := main(); {224#true} is VALID [2022-04-14 17:25:58,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {224#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {224#true} is VALID [2022-04-14 17:25:58,629 INFO L272 TraceCheckUtils]: 6: Hoare triple {224#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {224#true} is VALID [2022-04-14 17:25:58,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-14 17:25:58,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-14 17:25:58,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-14 17:25:58,631 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {224#true} {224#true} #61#return; {224#true} is VALID [2022-04-14 17:25:58,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {224#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {224#true} is VALID [2022-04-14 17:25:58,632 INFO L272 TraceCheckUtils]: 12: Hoare triple {224#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {224#true} is VALID [2022-04-14 17:25:58,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-14 17:25:58,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-14 17:25:58,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-14 17:25:58,632 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {224#true} {224#true} #63#return; {224#true} is VALID [2022-04-14 17:25:58,632 INFO L272 TraceCheckUtils]: 17: Hoare triple {224#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {224#true} is VALID [2022-04-14 17:25:58,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-14 17:25:58,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-14 17:25:58,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-14 17:25:58,633 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {224#true} {224#true} #65#return; {224#true} is VALID [2022-04-14 17:25:58,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {224#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 17:25:58,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 17:25:58,635 INFO L272 TraceCheckUtils]: 24: Hoare triple {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {302#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:25:58,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {302#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {306#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:25:58,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {306#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {225#false} is VALID [2022-04-14 17:25:58,636 INFO L290 TraceCheckUtils]: 27: Hoare triple {225#false} assume !false; {225#false} is VALID [2022-04-14 17:25:58,637 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 17:25:58,637 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 17:25:58,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:25:58,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986065115] [2022-04-14 17:25:58,637 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:25:58,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123312198] [2022-04-14 17:25:58,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123312198] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 17:25:58,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 17:25:58,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 17:25:58,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038456592] [2022-04-14 17:25:58,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 17:25:58,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-14 17:25:58,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:25:58,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-14 17:25:58,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:25:58,666 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 17:25:58,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:25:58,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 17:25:58,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 17:25:58,667 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-14 17:25:58,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:25:58,834 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-14 17:25:58,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 17:25:58,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-14 17:25:58,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:25:58,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-14 17:25:58,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-14 17:25:58,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-14 17:25:58,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-14 17:25:58,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-04-14 17:25:58,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:25:58,892 INFO L225 Difference]: With dead ends: 39 [2022-04-14 17:25:58,892 INFO L226 Difference]: Without dead ends: 37 [2022-04-14 17:25:58,893 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-14 17:25:58,895 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 17:25:58,896 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 87 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 17:25:58,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-14 17:25:58,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-04-14 17:25:58,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:25:58,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:25:58,907 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:25:58,908 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:25:58,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:25:58,915 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-14 17:25:58,917 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-14 17:25:58,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:25:58,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:25:58,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-14 17:25:58,924 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-14 17:25:58,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:25:58,926 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-14 17:25:58,926 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-14 17:25:58,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:25:58,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:25:58,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:25:58,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:25:58,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:25:58,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-14 17:25:58,929 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2022-04-14 17:25:58,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:25:58,929 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-14 17:25:58,929 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-14 17:25:58,929 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-14 17:25:58,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-14 17:25:58,930 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:25:58,930 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:25:58,958 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-14 17:25:59,145 WARN L460 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-14 17:25:59,145 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:25:59,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:25:59,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1911690432, now seen corresponding path program 1 times [2022-04-14 17:25:59,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:25:59,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721991133] [2022-04-14 17:25:59,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:25:59,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:25:59,165 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:25:59,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1581932592] [2022-04-14 17:25:59,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:25:59,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:25:59,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:25:59,166 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-14 17:25:59,173 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-14 17:25:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:25:59,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 17:25:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:25:59,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:25:59,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {491#true} call ULTIMATE.init(); {491#true} is VALID [2022-04-14 17:25:59,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {491#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(13, 2);call #Ultimate.allocInit(12, 3); {491#true} is VALID [2022-04-14 17:25:59,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-14 17:25:59,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {491#true} {491#true} #71#return; {491#true} is VALID [2022-04-14 17:25:59,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {491#true} call #t~ret6 := main(); {491#true} is VALID [2022-04-14 17:25:59,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {491#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {491#true} is VALID [2022-04-14 17:25:59,380 INFO L272 TraceCheckUtils]: 6: Hoare triple {491#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {491#true} is VALID [2022-04-14 17:25:59,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-14 17:25:59,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-14 17:25:59,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-14 17:25:59,380 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {491#true} {491#true} #61#return; {491#true} is VALID [2022-04-14 17:25:59,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {491#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {491#true} is VALID [2022-04-14 17:25:59,381 INFO L272 TraceCheckUtils]: 12: Hoare triple {491#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {491#true} is VALID [2022-04-14 17:25:59,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-14 17:25:59,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-14 17:25:59,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-14 17:25:59,381 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {491#true} {491#true} #63#return; {491#true} is VALID [2022-04-14 17:25:59,382 INFO L272 TraceCheckUtils]: 17: Hoare triple {491#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {491#true} is VALID [2022-04-14 17:25:59,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {491#true} ~cond := #in~cond; {550#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 17:25:59,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {550#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {554#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:25:59,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {554#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {554#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:25:59,384 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {554#(not (= |assume_abort_if_not_#in~cond| 0))} {491#true} #65#return; {561#(<= 1 main_~b~0)} is VALID [2022-04-14 17:25:59,385 INFO L290 TraceCheckUtils]: 22: Hoare triple {561#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {565#(<= 1 main_~y~0)} is VALID [2022-04-14 17:25:59,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {565#(<= 1 main_~y~0)} assume !false; {565#(<= 1 main_~y~0)} is VALID [2022-04-14 17:25:59,385 INFO L272 TraceCheckUtils]: 24: Hoare triple {565#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {491#true} is VALID [2022-04-14 17:25:59,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-14 17:25:59,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-14 17:25:59,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-14 17:25:59,386 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {491#true} {565#(<= 1 main_~y~0)} #67#return; {565#(<= 1 main_~y~0)} is VALID [2022-04-14 17:25:59,387 INFO L290 TraceCheckUtils]: 29: Hoare triple {565#(<= 1 main_~y~0)} assume !(0 != ~y~0); {492#false} is VALID [2022-04-14 17:25:59,387 INFO L272 TraceCheckUtils]: 30: Hoare triple {492#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {492#false} is VALID [2022-04-14 17:25:59,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {492#false} ~cond := #in~cond; {492#false} is VALID [2022-04-14 17:25:59,387 INFO L290 TraceCheckUtils]: 32: Hoare triple {492#false} assume 0 == ~cond; {492#false} is VALID [2022-04-14 17:25:59,387 INFO L290 TraceCheckUtils]: 33: Hoare triple {492#false} assume !false; {492#false} is VALID [2022-04-14 17:25:59,388 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-14 17:25:59,388 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 17:25:59,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:25:59,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721991133] [2022-04-14 17:25:59,388 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:25:59,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581932592] [2022-04-14 17:25:59,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581932592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 17:25:59,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 17:25:59,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 17:25:59,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918648370] [2022-04-14 17:25:59,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 17:25:59,390 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-14 17:25:59,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:25:59,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 17:25:59,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:25:59,413 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 17:25:59,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:25:59,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 17:25:59,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 17:25:59,414 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 17:25:59,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:25:59,611 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-14 17:25:59,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 17:25:59,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-14 17:25:59,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:25:59,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 17:25:59,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-14 17:25:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 17:25:59,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-14 17:25:59,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-14 17:25:59,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:25:59,655 INFO L225 Difference]: With dead ends: 43 [2022-04-14 17:25:59,655 INFO L226 Difference]: Without dead ends: 36 [2022-04-14 17:25:59,656 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-14 17:25:59,658 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 17:25:59,658 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 89 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 17:25:59,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-14 17:25:59,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2022-04-14 17:25:59,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:25:59,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:25:59,671 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:25:59,671 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:25:59,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:25:59,675 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-14 17:25:59,675 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-14 17:25:59,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:25:59,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:25:59,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-04-14 17:25:59,677 INFO L87 Difference]: Start difference. First operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-04-14 17:25:59,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:25:59,679 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-14 17:25:59,679 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-14 17:25:59,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:25:59,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:25:59,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:25:59,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:25:59,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:25:59,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-14 17:25:59,681 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 34 [2022-04-14 17:25:59,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:25:59,682 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-14 17:25:59,682 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 17:25:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-14 17:25:59,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-14 17:25:59,683 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:25:59,683 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 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-14 17:25:59,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-14 17:25:59,899 WARN L460 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-14 17:25:59,900 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:25:59,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:25:59,900 INFO L85 PathProgramCache]: Analyzing trace with hash 2022075506, now seen corresponding path program 1 times [2022-04-14 17:25:59,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:25:59,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286728820] [2022-04-14 17:25:59,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:25:59,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:25:59,924 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:25:59,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [869573132] [2022-04-14 17:25:59,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:25:59,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:25:59,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:25:59,928 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-14 17:25:59,931 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-14 17:25:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:25:59,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-14 17:25:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:25:59,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:26:01,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {783#true} is VALID [2022-04-14 17:26:01,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#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(13, 2);call #Ultimate.allocInit(12, 3); {783#true} is VALID [2022-04-14 17:26:01,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-14 17:26:01,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #71#return; {783#true} is VALID [2022-04-14 17:26:01,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret6 := main(); {783#true} is VALID [2022-04-14 17:26:01,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {783#true} is VALID [2022-04-14 17:26:01,085 INFO L272 TraceCheckUtils]: 6: Hoare triple {783#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {783#true} is VALID [2022-04-14 17:26:01,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-14 17:26:01,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-14 17:26:01,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-14 17:26:01,087 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {783#true} {783#true} #61#return; {783#true} is VALID [2022-04-14 17:26:01,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {783#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {783#true} is VALID [2022-04-14 17:26:01,089 INFO L272 TraceCheckUtils]: 12: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {783#true} is VALID [2022-04-14 17:26:01,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-14 17:26:01,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-14 17:26:01,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-14 17:26:01,102 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {783#true} {783#true} #63#return; {783#true} is VALID [2022-04-14 17:26:01,102 INFO L272 TraceCheckUtils]: 17: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {783#true} is VALID [2022-04-14 17:26:01,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-14 17:26:01,103 INFO L290 TraceCheckUtils]: 19: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-14 17:26:01,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-14 17:26:01,103 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {783#true} {783#true} #65#return; {783#true} is VALID [2022-04-14 17:26:01,104 INFO L290 TraceCheckUtils]: 22: Hoare triple {783#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 17:26:01,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 17:26:01,104 INFO L272 TraceCheckUtils]: 24: Hoare triple {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {783#true} is VALID [2022-04-14 17:26:01,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {783#true} ~cond := #in~cond; {864#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:26:01,105 INFO L290 TraceCheckUtils]: 26: Hoare triple {864#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {868#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:26:01,106 INFO L290 TraceCheckUtils]: 27: Hoare triple {868#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {868#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:26:01,107 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {868#(not (= |__VERIFIER_assert_#in~cond| 0))} {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #67#return; {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 17:26:01,107 INFO L290 TraceCheckUtils]: 29: Hoare triple {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {878#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 17:26:01,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {878#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {882#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= main_~z~0 main_~x~0) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-14 17:26:01,110 INFO L290 TraceCheckUtils]: 31: Hoare triple {882#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= main_~z~0 main_~x~0) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {886#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-14 17:26:01,111 INFO L290 TraceCheckUtils]: 32: Hoare triple {886#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !false; {886#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-14 17:26:01,599 INFO L272 TraceCheckUtils]: 33: Hoare triple {886#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {893#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:26:01,603 INFO L290 TraceCheckUtils]: 34: Hoare triple {893#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {897#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:26:01,604 INFO L290 TraceCheckUtils]: 35: Hoare triple {897#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {784#false} is VALID [2022-04-14 17:26:01,604 INFO L290 TraceCheckUtils]: 36: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-04-14 17:26:01,604 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 17:26:01,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:27:01,522 INFO L290 TraceCheckUtils]: 36: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-04-14 17:27:01,522 INFO L290 TraceCheckUtils]: 35: Hoare triple {897#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {784#false} is VALID [2022-04-14 17:27:01,523 INFO L290 TraceCheckUtils]: 34: Hoare triple {893#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {897#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:27:01,524 INFO L272 TraceCheckUtils]: 33: Hoare triple {913#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {893#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:27:01,524 INFO L290 TraceCheckUtils]: 32: Hoare triple {913#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {913#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-14 17:27:01,528 INFO L290 TraceCheckUtils]: 31: Hoare triple {920#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {913#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-14 17:27:01,532 INFO L290 TraceCheckUtils]: 30: Hoare triple {924#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {920#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-14 17:27:01,532 INFO L290 TraceCheckUtils]: 29: Hoare triple {924#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume !!(0 != ~y~0); {924#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-14 17:27:03,534 WARN L284 TraceCheckUtils]: 28: Hoare quadruple {868#(not (= |__VERIFIER_assert_#in~cond| 0))} {783#true} #67#return; {924#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is UNKNOWN [2022-04-14 17:27:03,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {868#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {868#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:27:03,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {940#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {868#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:27:03,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {783#true} ~cond := #in~cond; {940#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 17:27:03,535 INFO L272 TraceCheckUtils]: 24: Hoare triple {783#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {783#true} is VALID [2022-04-14 17:27:03,536 INFO L290 TraceCheckUtils]: 23: Hoare triple {783#true} assume !false; {783#true} is VALID [2022-04-14 17:27:03,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {783#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {783#true} is VALID [2022-04-14 17:27:03,536 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {783#true} {783#true} #65#return; {783#true} is VALID [2022-04-14 17:27:03,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-14 17:27:03,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-14 17:27:03,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-14 17:27:03,536 INFO L272 TraceCheckUtils]: 17: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {783#true} is VALID [2022-04-14 17:27:03,536 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {783#true} {783#true} #63#return; {783#true} is VALID [2022-04-14 17:27:03,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-14 17:27:03,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-14 17:27:03,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-14 17:27:03,536 INFO L272 TraceCheckUtils]: 12: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {783#true} is VALID [2022-04-14 17:27:03,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {783#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {783#true} is VALID [2022-04-14 17:27:03,537 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {783#true} {783#true} #61#return; {783#true} is VALID [2022-04-14 17:27:03,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-14 17:27:03,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-14 17:27:03,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-14 17:27:03,537 INFO L272 TraceCheckUtils]: 6: Hoare triple {783#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {783#true} is VALID [2022-04-14 17:27:03,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {783#true} is VALID [2022-04-14 17:27:03,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret6 := main(); {783#true} is VALID [2022-04-14 17:27:03,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #71#return; {783#true} is VALID [2022-04-14 17:27:03,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-14 17:27:03,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#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(13, 2);call #Ultimate.allocInit(12, 3); {783#true} is VALID [2022-04-14 17:27:03,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {783#true} is VALID [2022-04-14 17:27:03,538 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 17:27:03,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:27:03,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286728820] [2022-04-14 17:27:03,539 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:27:03,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869573132] [2022-04-14 17:27:03,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869573132] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 17:27:03,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 17:27:03,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2022-04-14 17:27:03,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285215110] [2022-04-14 17:27:03,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 17:27:03,540 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2022-04-14 17:27:03,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:27:03,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 17:27:05,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 41 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 17:27:05,743 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-14 17:27:05,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:27:05,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-14 17:27:05,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-14 17:27:05,745 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 17:27:10,267 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 17:27:13,460 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 17:27:15,614 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 17:27:20,232 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 17:27:21,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:27:21,402 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-04-14 17:27:21,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-14 17:27:21,402 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2022-04-14 17:27:21,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:27:21,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 17:27:21,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2022-04-14 17:27:21,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 17:27:21,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2022-04-14 17:27:21,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 57 transitions. [2022-04-14 17:27:23,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 56 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 17:27:23,709 INFO L225 Difference]: With dead ends: 52 [2022-04-14 17:27:23,709 INFO L226 Difference]: Without dead ends: 50 [2022-04-14 17:27:23,710 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-04-14 17:27:23,710 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 28 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 14 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-04-14 17:27:23,711 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 151 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 166 Invalid, 3 Unknown, 0 Unchecked, 8.9s Time] [2022-04-14 17:27:23,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-14 17:27:23,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2022-04-14 17:27:23,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:27:23,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 41 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 17:27:23,725 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 41 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 17:27:23,725 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 41 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 17:27:23,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:27:23,728 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-04-14 17:27:23,728 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-04-14 17:27:23,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:27:23,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:27:23,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-04-14 17:27:23,729 INFO L87 Difference]: Start difference. First operand has 41 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-04-14 17:27:23,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:27:23,731 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-04-14 17:27:23,731 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-04-14 17:27:23,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:27:23,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:27:23,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:27:23,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:27:23,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 17:27:23,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-04-14 17:27:23,734 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 37 [2022-04-14 17:27:23,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:27:23,734 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-04-14 17:27:23,734 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 17:27:23,735 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-14 17:27:23,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-14 17:27:23,735 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:27:23,735 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 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-14 17:27:23,759 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-14 17:27:23,955 WARN L460 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-14 17:27:23,955 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:27:23,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:27:23,956 INFO L85 PathProgramCache]: Analyzing trace with hash -497884428, now seen corresponding path program 1 times [2022-04-14 17:27:23,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:27:23,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259874749] [2022-04-14 17:27:23,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:27:23,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:27:23,972 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:27:23,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [414974648] [2022-04-14 17:27:23,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:27:23,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:27:23,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:27:23,973 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-14 17:27:23,986 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-14 17:27:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:27:24,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-14 17:27:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:27:24,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:27:27,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {1258#true} call ULTIMATE.init(); {1258#true} is VALID [2022-04-14 17:27:27,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {1258#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(13, 2);call #Ultimate.allocInit(12, 3); {1258#true} is VALID [2022-04-14 17:27:27,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {1258#true} assume true; {1258#true} is VALID [2022-04-14 17:27:27,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1258#true} {1258#true} #71#return; {1258#true} is VALID [2022-04-14 17:27:27,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {1258#true} call #t~ret6 := main(); {1258#true} is VALID [2022-04-14 17:27:27,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {1258#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {1258#true} is VALID [2022-04-14 17:27:27,831 INFO L272 TraceCheckUtils]: 6: Hoare triple {1258#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {1258#true} is VALID [2022-04-14 17:27:27,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {1258#true} ~cond := #in~cond; {1258#true} is VALID [2022-04-14 17:27:27,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {1258#true} assume !(0 == ~cond); {1258#true} is VALID [2022-04-14 17:27:27,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {1258#true} assume true; {1258#true} is VALID [2022-04-14 17:27:27,831 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1258#true} {1258#true} #61#return; {1258#true} is VALID [2022-04-14 17:27:27,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {1258#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1258#true} is VALID [2022-04-14 17:27:27,832 INFO L272 TraceCheckUtils]: 12: Hoare triple {1258#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {1258#true} is VALID [2022-04-14 17:27:27,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {1258#true} ~cond := #in~cond; {1258#true} is VALID [2022-04-14 17:27:27,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {1258#true} assume !(0 == ~cond); {1258#true} is VALID [2022-04-14 17:27:27,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {1258#true} assume true; {1258#true} is VALID [2022-04-14 17:27:27,832 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1258#true} {1258#true} #63#return; {1258#true} is VALID [2022-04-14 17:27:27,832 INFO L272 TraceCheckUtils]: 17: Hoare triple {1258#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1258#true} is VALID [2022-04-14 17:27:27,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {1258#true} ~cond := #in~cond; {1317#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 17:27:27,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {1317#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1321#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:27:27,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {1321#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1321#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:27:27,841 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1321#(not (= |assume_abort_if_not_#in~cond| 0))} {1258#true} #65#return; {1328#(<= 1 main_~b~0)} is VALID [2022-04-14 17:27:27,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {1328#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1332#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 17:27:27,842 INFO L290 TraceCheckUtils]: 23: Hoare triple {1332#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !false; {1332#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 17:27:27,842 INFO L272 TraceCheckUtils]: 24: Hoare triple {1332#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1258#true} is VALID [2022-04-14 17:27:27,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {1258#true} ~cond := #in~cond; {1342#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:27:27,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {1342#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1346#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:27:27,843 INFO L290 TraceCheckUtils]: 27: Hoare triple {1346#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1346#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:27:27,844 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1346#(not (= |__VERIFIER_assert_#in~cond| 0))} {1332#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #67#return; {1332#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 17:27:27,844 INFO L290 TraceCheckUtils]: 29: Hoare triple {1332#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {1332#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 17:27:27,845 INFO L290 TraceCheckUtils]: 30: Hoare triple {1332#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {1359#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 17:27:27,846 INFO L290 TraceCheckUtils]: 31: Hoare triple {1359#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1363#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-14 17:27:27,846 INFO L290 TraceCheckUtils]: 32: Hoare triple {1363#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !false; {1363#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-14 17:27:27,850 INFO L272 TraceCheckUtils]: 33: Hoare triple {1363#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1370#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:27:27,850 INFO L290 TraceCheckUtils]: 34: Hoare triple {1370#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1374#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:27:27,850 INFO L290 TraceCheckUtils]: 35: Hoare triple {1374#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1259#false} is VALID [2022-04-14 17:27:27,850 INFO L290 TraceCheckUtils]: 36: Hoare triple {1259#false} assume !false; {1259#false} is VALID [2022-04-14 17:27:27,851 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-14 17:27:27,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:28:11,666 INFO L290 TraceCheckUtils]: 36: Hoare triple {1259#false} assume !false; {1259#false} is VALID [2022-04-14 17:28:11,666 INFO L290 TraceCheckUtils]: 35: Hoare triple {1374#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1259#false} is VALID [2022-04-14 17:28:11,667 INFO L290 TraceCheckUtils]: 34: Hoare triple {1370#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1374#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:28:11,667 INFO L272 TraceCheckUtils]: 33: Hoare triple {1390#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1370#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:28:11,668 INFO L290 TraceCheckUtils]: 32: Hoare triple {1390#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {1390#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-14 17:28:11,672 INFO L290 TraceCheckUtils]: 31: Hoare triple {1397#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1390#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-14 17:28:11,673 INFO L290 TraceCheckUtils]: 30: Hoare triple {1401#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {1397#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-14 17:28:11,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {1401#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {1401#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-14 17:28:11,676 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1346#(not (= |__VERIFIER_assert_#in~cond| 0))} {1408#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} #67#return; {1401#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-14 17:28:11,677 INFO L290 TraceCheckUtils]: 27: Hoare triple {1346#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1346#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:28:11,677 INFO L290 TraceCheckUtils]: 26: Hoare triple {1418#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1346#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:28:11,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {1258#true} ~cond := #in~cond; {1418#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 17:28:11,677 INFO L272 TraceCheckUtils]: 24: Hoare triple {1408#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1258#true} is VALID [2022-04-14 17:28:11,678 INFO L290 TraceCheckUtils]: 23: Hoare triple {1408#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} assume !false; {1408#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-14 17:28:11,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {1428#(or (= (* main_~b~0 main_~a~0) (* (* main_~a~0 2) (+ (div main_~b~0 2) 1))) (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1408#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-14 17:28:11,679 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1321#(not (= |assume_abort_if_not_#in~cond| 0))} {1258#true} #65#return; {1428#(or (= (* main_~b~0 main_~a~0) (* (* main_~a~0 2) (+ (div main_~b~0 2) 1))) (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} is VALID [2022-04-14 17:28:11,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {1321#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1321#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:28:11,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {1441#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1321#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:28:11,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {1258#true} ~cond := #in~cond; {1441#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-14 17:28:11,680 INFO L272 TraceCheckUtils]: 17: Hoare triple {1258#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1258#true} is VALID [2022-04-14 17:28:11,680 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1258#true} {1258#true} #63#return; {1258#true} is VALID [2022-04-14 17:28:11,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {1258#true} assume true; {1258#true} is VALID [2022-04-14 17:28:11,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {1258#true} assume !(0 == ~cond); {1258#true} is VALID [2022-04-14 17:28:11,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {1258#true} ~cond := #in~cond; {1258#true} is VALID [2022-04-14 17:28:11,681 INFO L272 TraceCheckUtils]: 12: Hoare triple {1258#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {1258#true} is VALID [2022-04-14 17:28:11,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {1258#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1258#true} is VALID [2022-04-14 17:28:11,681 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1258#true} {1258#true} #61#return; {1258#true} is VALID [2022-04-14 17:28:11,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {1258#true} assume true; {1258#true} is VALID [2022-04-14 17:28:11,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {1258#true} assume !(0 == ~cond); {1258#true} is VALID [2022-04-14 17:28:11,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {1258#true} ~cond := #in~cond; {1258#true} is VALID [2022-04-14 17:28:11,681 INFO L272 TraceCheckUtils]: 6: Hoare triple {1258#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {1258#true} is VALID [2022-04-14 17:28:11,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {1258#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {1258#true} is VALID [2022-04-14 17:28:11,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {1258#true} call #t~ret6 := main(); {1258#true} is VALID [2022-04-14 17:28:11,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1258#true} {1258#true} #71#return; {1258#true} is VALID [2022-04-14 17:28:11,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {1258#true} assume true; {1258#true} is VALID [2022-04-14 17:28:11,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {1258#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(13, 2);call #Ultimate.allocInit(12, 3); {1258#true} is VALID [2022-04-14 17:28:11,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {1258#true} call ULTIMATE.init(); {1258#true} is VALID [2022-04-14 17:28:11,682 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-14 17:28:11,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:28:11,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259874749] [2022-04-14 17:28:11,683 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:28:11,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414974648] [2022-04-14 17:28:11,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414974648] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 17:28:11,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 17:28:11,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 19 [2022-04-14 17:28:11,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816317178] [2022-04-14 17:28:11,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 17:28:11,684 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 37 [2022-04-14 17:28:11,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:28:11,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-14 17:28:11,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:28:11,734 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-14 17:28:11,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:28:11,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-14 17:28:11,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-04-14 17:28:11,735 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-14 17:28:14,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:28:14,090 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-04-14 17:28:14,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-14 17:28:14,090 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 37 [2022-04-14 17:28:14,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:28:14,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-14 17:28:14,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 67 transitions. [2022-04-14 17:28:14,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-14 17:28:14,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 67 transitions. [2022-04-14 17:28:14,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 67 transitions. [2022-04-14 17:28:14,178 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-14 17:28:14,180 INFO L225 Difference]: With dead ends: 66 [2022-04-14 17:28:14,180 INFO L226 Difference]: Without dead ends: 59 [2022-04-14 17:28:14,180 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2022-04-14 17:28:14,181 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 46 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-14 17:28:14,181 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 139 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-14 17:28:14,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-14 17:28:14,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-14 17:28:14,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:28:14,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 40 states have (on average 1.175) internal successors, (47), 43 states have internal predecessors, (47), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 17:28:14,203 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 40 states have (on average 1.175) internal successors, (47), 43 states have internal predecessors, (47), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 17:28:14,203 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 40 states have (on average 1.175) internal successors, (47), 43 states have internal predecessors, (47), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 17:28:14,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:28:14,206 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-14 17:28:14,206 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-14 17:28:14,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:28:14,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:28:14,206 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 40 states have (on average 1.175) internal successors, (47), 43 states have internal predecessors, (47), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 59 states. [2022-04-14 17:28:14,207 INFO L87 Difference]: Start difference. First operand has 59 states, 40 states have (on average 1.175) internal successors, (47), 43 states have internal predecessors, (47), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 59 states. [2022-04-14 17:28:14,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:28:14,209 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-14 17:28:14,209 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-14 17:28:14,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:28:14,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:28:14,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:28:14,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:28:14,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.175) internal successors, (47), 43 states have internal predecessors, (47), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 17:28:14,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2022-04-14 17:28:14,212 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 37 [2022-04-14 17:28:14,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:28:14,212 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2022-04-14 17:28:14,212 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-14 17:28:14,212 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-14 17:28:14,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-14 17:28:14,213 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:28:14,213 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-04-14 17:28:14,240 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-14 17:28:14,414 WARN L460 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-14 17:28:14,414 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:28:14,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:28:14,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1351630086, now seen corresponding path program 1 times [2022-04-14 17:28:14,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:28:14,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387141338] [2022-04-14 17:28:14,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:28:14,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:28:14,433 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:28:14,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2054799038] [2022-04-14 17:28:14,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:28:14,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:28:14,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:28:14,439 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-14 17:28:14,469 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-14 17:28:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:28:14,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-14 17:28:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:28:14,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:28:24,223 INFO L272 TraceCheckUtils]: 0: Hoare triple {1807#true} call ULTIMATE.init(); {1807#true} is VALID [2022-04-14 17:28:24,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {1807#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(13, 2);call #Ultimate.allocInit(12, 3); {1807#true} is VALID [2022-04-14 17:28:24,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-14 17:28:24,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1807#true} {1807#true} #71#return; {1807#true} is VALID [2022-04-14 17:28:24,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {1807#true} call #t~ret6 := main(); {1807#true} is VALID [2022-04-14 17:28:24,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {1807#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {1807#true} is VALID [2022-04-14 17:28:24,224 INFO L272 TraceCheckUtils]: 6: Hoare triple {1807#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {1807#true} is VALID [2022-04-14 17:28:24,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {1807#true} ~cond := #in~cond; {1807#true} is VALID [2022-04-14 17:28:24,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {1807#true} assume !(0 == ~cond); {1807#true} is VALID [2022-04-14 17:28:24,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-14 17:28:24,224 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1807#true} {1807#true} #61#return; {1807#true} is VALID [2022-04-14 17:28:24,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {1807#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1807#true} is VALID [2022-04-14 17:28:24,224 INFO L272 TraceCheckUtils]: 12: Hoare triple {1807#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {1807#true} is VALID [2022-04-14 17:28:24,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {1807#true} ~cond := #in~cond; {1807#true} is VALID [2022-04-14 17:28:24,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {1807#true} assume !(0 == ~cond); {1807#true} is VALID [2022-04-14 17:28:24,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-14 17:28:24,225 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1807#true} {1807#true} #63#return; {1807#true} is VALID [2022-04-14 17:28:24,225 INFO L272 TraceCheckUtils]: 17: Hoare triple {1807#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1807#true} is VALID [2022-04-14 17:28:24,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {1807#true} ~cond := #in~cond; {1807#true} is VALID [2022-04-14 17:28:24,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {1807#true} assume !(0 == ~cond); {1807#true} is VALID [2022-04-14 17:28:24,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-14 17:28:24,225 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1807#true} {1807#true} #65#return; {1807#true} is VALID [2022-04-14 17:28:24,225 INFO L290 TraceCheckUtils]: 22: Hoare triple {1807#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1807#true} is VALID [2022-04-14 17:28:24,225 INFO L290 TraceCheckUtils]: 23: Hoare triple {1807#true} assume !false; {1807#true} is VALID [2022-04-14 17:28:24,226 INFO L272 TraceCheckUtils]: 24: Hoare triple {1807#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1807#true} is VALID [2022-04-14 17:28:24,226 INFO L290 TraceCheckUtils]: 25: Hoare triple {1807#true} ~cond := #in~cond; {1807#true} is VALID [2022-04-14 17:28:24,226 INFO L290 TraceCheckUtils]: 26: Hoare triple {1807#true} assume !(0 == ~cond); {1807#true} is VALID [2022-04-14 17:28:24,226 INFO L290 TraceCheckUtils]: 27: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-14 17:28:24,226 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1807#true} {1807#true} #67#return; {1807#true} is VALID [2022-04-14 17:28:24,226 INFO L290 TraceCheckUtils]: 29: Hoare triple {1807#true} assume !!(0 != ~y~0); {1807#true} is VALID [2022-04-14 17:28:24,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {1807#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {1807#true} is VALID [2022-04-14 17:28:24,226 INFO L290 TraceCheckUtils]: 31: Hoare triple {1807#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1807#true} is VALID [2022-04-14 17:28:24,226 INFO L290 TraceCheckUtils]: 32: Hoare triple {1807#true} assume !false; {1807#true} is VALID [2022-04-14 17:28:24,226 INFO L272 TraceCheckUtils]: 33: Hoare triple {1807#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1807#true} is VALID [2022-04-14 17:28:24,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {1807#true} ~cond := #in~cond; {1914#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:28:24,227 INFO L290 TraceCheckUtils]: 35: Hoare triple {1914#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1918#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:28:24,228 INFO L290 TraceCheckUtils]: 36: Hoare triple {1918#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1918#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:28:26,231 WARN L284 TraceCheckUtils]: 37: Hoare quadruple {1918#(not (= |__VERIFIER_assert_#in~cond| 0))} {1807#true} #67#return; {1925#(or (and (not (= main_~y~0 0)) (= (mod (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) main_~y~0) 0)) (= (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 0))} is UNKNOWN [2022-04-14 17:28:26,231 INFO L290 TraceCheckUtils]: 38: Hoare triple {1925#(or (and (not (= main_~y~0 0)) (= (mod (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) main_~y~0) 0)) (= (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 0))} assume !(0 != ~y~0); {1929#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-14 17:28:26,232 INFO L272 TraceCheckUtils]: 39: Hoare triple {1929#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {1933#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:28:26,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {1933#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1937#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:28:26,233 INFO L290 TraceCheckUtils]: 41: Hoare triple {1937#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1808#false} is VALID [2022-04-14 17:28:26,233 INFO L290 TraceCheckUtils]: 42: Hoare triple {1808#false} assume !false; {1808#false} is VALID [2022-04-14 17:28:26,233 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-14 17:28:26,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:28:32,438 INFO L290 TraceCheckUtils]: 42: Hoare triple {1808#false} assume !false; {1808#false} is VALID [2022-04-14 17:28:32,438 INFO L290 TraceCheckUtils]: 41: Hoare triple {1937#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1808#false} is VALID [2022-04-14 17:28:32,438 INFO L290 TraceCheckUtils]: 40: Hoare triple {1933#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1937#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:28:32,439 INFO L272 TraceCheckUtils]: 39: Hoare triple {1929#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {1933#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:28:32,439 INFO L290 TraceCheckUtils]: 38: Hoare triple {1956#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} assume !(0 != ~y~0); {1929#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-14 17:28:32,440 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1918#(not (= |__VERIFIER_assert_#in~cond| 0))} {1807#true} #67#return; {1956#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} is VALID [2022-04-14 17:28:32,440 INFO L290 TraceCheckUtils]: 36: Hoare triple {1918#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1918#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:28:32,441 INFO L290 TraceCheckUtils]: 35: Hoare triple {1969#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1918#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:28:32,441 INFO L290 TraceCheckUtils]: 34: Hoare triple {1807#true} ~cond := #in~cond; {1969#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 17:28:32,441 INFO L272 TraceCheckUtils]: 33: Hoare triple {1807#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1807#true} is VALID [2022-04-14 17:28:32,441 INFO L290 TraceCheckUtils]: 32: Hoare triple {1807#true} assume !false; {1807#true} is VALID [2022-04-14 17:28:32,442 INFO L290 TraceCheckUtils]: 31: Hoare triple {1807#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1807#true} is VALID [2022-04-14 17:28:32,442 INFO L290 TraceCheckUtils]: 30: Hoare triple {1807#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {1807#true} is VALID [2022-04-14 17:28:32,442 INFO L290 TraceCheckUtils]: 29: Hoare triple {1807#true} assume !!(0 != ~y~0); {1807#true} is VALID [2022-04-14 17:28:32,442 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1807#true} {1807#true} #67#return; {1807#true} is VALID [2022-04-14 17:28:32,442 INFO L290 TraceCheckUtils]: 27: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-14 17:28:32,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {1807#true} assume !(0 == ~cond); {1807#true} is VALID [2022-04-14 17:28:32,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {1807#true} ~cond := #in~cond; {1807#true} is VALID [2022-04-14 17:28:32,442 INFO L272 TraceCheckUtils]: 24: Hoare triple {1807#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1807#true} is VALID [2022-04-14 17:28:32,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {1807#true} assume !false; {1807#true} is VALID [2022-04-14 17:28:32,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {1807#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1807#true} is VALID [2022-04-14 17:28:32,443 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1807#true} {1807#true} #65#return; {1807#true} is VALID [2022-04-14 17:28:32,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-14 17:28:32,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {1807#true} assume !(0 == ~cond); {1807#true} is VALID [2022-04-14 17:28:32,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {1807#true} ~cond := #in~cond; {1807#true} is VALID [2022-04-14 17:28:32,443 INFO L272 TraceCheckUtils]: 17: Hoare triple {1807#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1807#true} is VALID [2022-04-14 17:28:32,443 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1807#true} {1807#true} #63#return; {1807#true} is VALID [2022-04-14 17:28:32,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-14 17:28:32,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {1807#true} assume !(0 == ~cond); {1807#true} is VALID [2022-04-14 17:28:32,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {1807#true} ~cond := #in~cond; {1807#true} is VALID [2022-04-14 17:28:32,444 INFO L272 TraceCheckUtils]: 12: Hoare triple {1807#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {1807#true} is VALID [2022-04-14 17:28:32,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {1807#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1807#true} is VALID [2022-04-14 17:28:32,444 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1807#true} {1807#true} #61#return; {1807#true} is VALID [2022-04-14 17:28:32,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-14 17:28:32,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {1807#true} assume !(0 == ~cond); {1807#true} is VALID [2022-04-14 17:28:32,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {1807#true} ~cond := #in~cond; {1807#true} is VALID [2022-04-14 17:28:32,444 INFO L272 TraceCheckUtils]: 6: Hoare triple {1807#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {1807#true} is VALID [2022-04-14 17:28:32,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {1807#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {1807#true} is VALID [2022-04-14 17:28:32,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {1807#true} call #t~ret6 := main(); {1807#true} is VALID [2022-04-14 17:28:32,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1807#true} {1807#true} #71#return; {1807#true} is VALID [2022-04-14 17:28:32,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-14 17:28:32,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {1807#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(13, 2);call #Ultimate.allocInit(12, 3); {1807#true} is VALID [2022-04-14 17:28:32,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {1807#true} call ULTIMATE.init(); {1807#true} is VALID [2022-04-14 17:28:32,445 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-14 17:28:32,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:28:32,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387141338] [2022-04-14 17:28:32,445 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:28:32,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054799038] [2022-04-14 17:28:32,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054799038] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 17:28:32,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 17:28:32,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-14 17:28:32,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361011242] [2022-04-14 17:28:32,446 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 17:28:32,447 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2022-04-14 17:28:32,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:28:32,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-14 17:28:34,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 17:28:34,487 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 17:28:34,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:28:34,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 17:28:34,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-14 17:28:34,488 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-14 17:28:36,536 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 17:28:36,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:28:36,883 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2022-04-14 17:28:36,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 17:28:36,883 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2022-04-14 17:28:36,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:28:36,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-14 17:28:36,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-14 17:28:36,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-14 17:28:36,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-14 17:28:36,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 37 transitions. [2022-04-14 17:28:38,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 36 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 17:28:38,916 INFO L225 Difference]: With dead ends: 65 [2022-04-14 17:28:38,916 INFO L226 Difference]: Without dead ends: 58 [2022-04-14 17:28:38,916 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-14 17:28:38,917 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-14 17:28:38,917 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 101 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-14 17:28:38,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-14 17:28:38,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-14 17:28:38,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:28:38,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 17:28:38,936 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 17:28:38,937 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 17:28:38,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:28:38,939 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-04-14 17:28:38,939 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-04-14 17:28:38,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:28:38,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:28:38,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 58 states. [2022-04-14 17:28:38,940 INFO L87 Difference]: Start difference. First operand has 58 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 58 states. [2022-04-14 17:28:38,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:28:38,942 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-04-14 17:28:38,942 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-04-14 17:28:38,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:28:38,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:28:38,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:28:38,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:28:38,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 17:28:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2022-04-14 17:28:38,944 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 43 [2022-04-14 17:28:38,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:28:38,944 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2022-04-14 17:28:38,944 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-14 17:28:38,945 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-04-14 17:28:38,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-14 17:28:38,945 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:28:38,945 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:28:38,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-14 17:28:39,167 WARN L460 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-14 17:28:39,168 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:28:39,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:28:39,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1494691206, now seen corresponding path program 1 times [2022-04-14 17:28:39,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:28:39,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778313754] [2022-04-14 17:28:39,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:28:39,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:28:39,182 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:28:39,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [667953397] [2022-04-14 17:28:39,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:28:39,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:28:39,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:28:39,184 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-14 17:28:39,189 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-14 17:28:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:28:39,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-14 17:28:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:28:39,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:29:10,727 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-14 17:29:32,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {2367#true} call ULTIMATE.init(); {2367#true} is VALID [2022-04-14 17:29:32,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {2367#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(13, 2);call #Ultimate.allocInit(12, 3); {2367#true} is VALID [2022-04-14 17:29:32,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {2367#true} assume true; {2367#true} is VALID [2022-04-14 17:29:32,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2367#true} {2367#true} #71#return; {2367#true} is VALID [2022-04-14 17:29:32,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {2367#true} call #t~ret6 := main(); {2367#true} is VALID [2022-04-14 17:29:32,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {2367#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {2367#true} is VALID [2022-04-14 17:29:32,798 INFO L272 TraceCheckUtils]: 6: Hoare triple {2367#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {2367#true} is VALID [2022-04-14 17:29:32,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {2367#true} ~cond := #in~cond; {2367#true} is VALID [2022-04-14 17:29:32,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {2367#true} assume !(0 == ~cond); {2367#true} is VALID [2022-04-14 17:29:32,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {2367#true} assume true; {2367#true} is VALID [2022-04-14 17:29:32,799 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2367#true} {2367#true} #61#return; {2367#true} is VALID [2022-04-14 17:29:32,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {2367#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2367#true} is VALID [2022-04-14 17:29:32,799 INFO L272 TraceCheckUtils]: 12: Hoare triple {2367#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {2367#true} is VALID [2022-04-14 17:29:32,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {2367#true} ~cond := #in~cond; {2367#true} is VALID [2022-04-14 17:29:32,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {2367#true} assume !(0 == ~cond); {2367#true} is VALID [2022-04-14 17:29:32,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {2367#true} assume true; {2367#true} is VALID [2022-04-14 17:29:32,799 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2367#true} {2367#true} #63#return; {2367#true} is VALID [2022-04-14 17:29:32,799 INFO L272 TraceCheckUtils]: 17: Hoare triple {2367#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2367#true} is VALID [2022-04-14 17:29:32,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {2367#true} ~cond := #in~cond; {2367#true} is VALID [2022-04-14 17:29:32,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {2367#true} assume !(0 == ~cond); {2367#true} is VALID [2022-04-14 17:29:32,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {2367#true} assume true; {2367#true} is VALID [2022-04-14 17:29:32,799 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2367#true} {2367#true} #65#return; {2367#true} is VALID [2022-04-14 17:29:32,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {2367#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2438#(= main_~a~0 main_~x~0)} is VALID [2022-04-14 17:29:32,804 INFO L290 TraceCheckUtils]: 23: Hoare triple {2438#(= main_~a~0 main_~x~0)} assume !false; {2438#(= main_~a~0 main_~x~0)} is VALID [2022-04-14 17:29:32,804 INFO L272 TraceCheckUtils]: 24: Hoare triple {2438#(= main_~a~0 main_~x~0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2367#true} is VALID [2022-04-14 17:29:32,804 INFO L290 TraceCheckUtils]: 25: Hoare triple {2367#true} ~cond := #in~cond; {2367#true} is VALID [2022-04-14 17:29:32,804 INFO L290 TraceCheckUtils]: 26: Hoare triple {2367#true} assume !(0 == ~cond); {2367#true} is VALID [2022-04-14 17:29:32,804 INFO L290 TraceCheckUtils]: 27: Hoare triple {2367#true} assume true; {2367#true} is VALID [2022-04-14 17:29:32,805 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2367#true} {2438#(= main_~a~0 main_~x~0)} #67#return; {2438#(= main_~a~0 main_~x~0)} is VALID [2022-04-14 17:29:32,805 INFO L290 TraceCheckUtils]: 29: Hoare triple {2438#(= main_~a~0 main_~x~0)} assume !!(0 != ~y~0); {2460#(and (not (= main_~y~0 0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 17:29:32,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {2460#(and (not (= main_~y~0 0)) (= main_~a~0 main_~x~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2464#(and (< 0 (+ main_~y~0 1)) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 17:29:32,807 INFO L290 TraceCheckUtils]: 31: Hoare triple {2464#(and (< 0 (+ main_~y~0 1)) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2468#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-14 17:29:32,807 INFO L290 TraceCheckUtils]: 32: Hoare triple {2468#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} assume !false; {2468#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-14 17:29:32,808 INFO L272 TraceCheckUtils]: 33: Hoare triple {2468#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2367#true} is VALID [2022-04-14 17:29:32,808 INFO L290 TraceCheckUtils]: 34: Hoare triple {2367#true} ~cond := #in~cond; {2478#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:29:32,808 INFO L290 TraceCheckUtils]: 35: Hoare triple {2478#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2482#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:29:32,809 INFO L290 TraceCheckUtils]: 36: Hoare triple {2482#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2482#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:29:32,810 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2482#(not (= |__VERIFIER_assert_#in~cond| 0))} {2468#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} #67#return; {2489#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-14 17:29:32,810 INFO L290 TraceCheckUtils]: 38: Hoare triple {2489#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} assume !!(0 != ~y~0); {2489#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-14 17:29:32,811 INFO L290 TraceCheckUtils]: 39: Hoare triple {2489#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {2496#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-14 17:29:32,818 INFO L290 TraceCheckUtils]: 40: Hoare triple {2496#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2500#(and (= (* main_~a~0 4) main_~x~0) (exists ((aux_mod_v_main_~y~0_27_22 Int) (aux_div_v_main_~y~0_27_22 Int)) (and (< 0 (+ (* aux_div_v_main_~y~0_27_22 2) aux_mod_v_main_~y~0_27_22 1)) (= (* main_~b~0 main_~a~0) (+ (* (* main_~a~0 2) (+ (* aux_div_v_main_~y~0_27_22 2) aux_mod_v_main_~y~0_27_22)) main_~z~0)) (= main_~y~0 (div (+ (* aux_div_v_main_~y~0_27_22 2) aux_mod_v_main_~y~0_27_22) 2)) (not (= aux_mod_v_main_~y~0_27_22 1)) (< aux_mod_v_main_~y~0_27_22 2) (<= 0 aux_mod_v_main_~y~0_27_22))))} is VALID [2022-04-14 17:29:33,160 INFO L290 TraceCheckUtils]: 41: Hoare triple {2500#(and (= (* main_~a~0 4) main_~x~0) (exists ((aux_mod_v_main_~y~0_27_22 Int) (aux_div_v_main_~y~0_27_22 Int)) (and (< 0 (+ (* aux_div_v_main_~y~0_27_22 2) aux_mod_v_main_~y~0_27_22 1)) (= (* main_~b~0 main_~a~0) (+ (* (* main_~a~0 2) (+ (* aux_div_v_main_~y~0_27_22 2) aux_mod_v_main_~y~0_27_22)) main_~z~0)) (= main_~y~0 (div (+ (* aux_div_v_main_~y~0_27_22 2) aux_mod_v_main_~y~0_27_22) 2)) (not (= aux_mod_v_main_~y~0_27_22 1)) (< aux_mod_v_main_~y~0_27_22 2) (<= 0 aux_mod_v_main_~y~0_27_22))))} assume !false; {2504#(and (= (mod (+ main_~z~0 (* main_~a~0 main_~y~0 (- 4)) (* main_~b~0 main_~a~0)) 2) 0) (= (* main_~a~0 4) main_~x~0) (= (div (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 2) (* 2 (* main_~a~0 main_~y~0))) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-14 17:29:34,372 INFO L272 TraceCheckUtils]: 42: Hoare triple {2504#(and (= (mod (+ main_~z~0 (* main_~a~0 main_~y~0 (- 4)) (* main_~b~0 main_~a~0)) 2) 0) (= (* main_~a~0 4) main_~x~0) (= (div (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 2) (* 2 (* main_~a~0 main_~y~0))) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2508#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:29:34,372 INFO L290 TraceCheckUtils]: 43: Hoare triple {2508#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2512#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:29:34,373 INFO L290 TraceCheckUtils]: 44: Hoare triple {2512#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2368#false} is VALID [2022-04-14 17:29:34,373 INFO L290 TraceCheckUtils]: 45: Hoare triple {2368#false} assume !false; {2368#false} is VALID [2022-04-14 17:29:34,373 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-14 17:29:34,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:30:00,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:30:00,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778313754] [2022-04-14 17:30:00,974 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:30:00,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667953397] [2022-04-14 17:30:00,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667953397] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 17:30:00,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:30:00,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-14 17:30:00,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749638532] [2022-04-14 17:30:00,974 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 17:30:00,975 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2022-04-14 17:30:00,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:30:00,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 17:30:02,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:30:02,168 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-14 17:30:02,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:30:02,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-14 17:30:02,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-04-14 17:30:02,169 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 17:30:11,828 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 17:30:13,831 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 17:30:15,700 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 17:30:26,740 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 17:30:27,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:30:27,293 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2022-04-14 17:30:27,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-14 17:30:27,294 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2022-04-14 17:30:27,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:30:27,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 17:30:27,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-14 17:30:27,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 17:30:27,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-14 17:30:27,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 56 transitions. [2022-04-14 17:30:28,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:30:28,836 INFO L225 Difference]: With dead ends: 83 [2022-04-14 17:30:28,836 INFO L226 Difference]: Without dead ends: 81 [2022-04-14 17:30:28,836 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2022-04-14 17:30:28,837 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-04-14 17:30:28,837 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 196 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 204 Invalid, 2 Unknown, 0 Unchecked, 10.2s Time] [2022-04-14 17:30:28,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-14 17:30:28,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 70. [2022-04-14 17:30:28,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:30:28,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 70 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 17:30:28,881 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 70 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 17:30:28,881 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 70 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 17:30:28,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:30:28,886 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2022-04-14 17:30:28,886 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2022-04-14 17:30:28,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:30:28,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:30:28,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) Second operand 81 states. [2022-04-14 17:30:28,887 INFO L87 Difference]: Start difference. First operand has 70 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) Second operand 81 states. [2022-04-14 17:30:28,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:30:28,891 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2022-04-14 17:30:28,891 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2022-04-14 17:30:28,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:30:28,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:30:28,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:30:28,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:30:28,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 17:30:28,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2022-04-14 17:30:28,894 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 46 [2022-04-14 17:30:28,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:30:28,894 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2022-04-14 17:30:28,895 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 17:30:28,895 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-04-14 17:30:28,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-14 17:30:28,896 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:30:28,896 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:30:28,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-14 17:30:29,115 WARN L460 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-14 17:30:29,115 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:30:29,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:30:29,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1459553868, now seen corresponding path program 2 times [2022-04-14 17:30:29,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:30:29,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798265622] [2022-04-14 17:30:29,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:30:29,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:30:29,129 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:30:29,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [154782682] [2022-04-14 17:30:29,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 17:30:29,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:30:29,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:30:29,130 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 17:30:29,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-14 17:30:29,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 17:30:29,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 17:30:29,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-14 17:30:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:30:29,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:30:30,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {2930#true} call ULTIMATE.init(); {2930#true} is VALID [2022-04-14 17:30:30,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {2930#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(13, 2);call #Ultimate.allocInit(12, 3); {2930#true} is VALID [2022-04-14 17:30:30,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {2930#true} assume true; {2930#true} is VALID [2022-04-14 17:30:30,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2930#true} {2930#true} #71#return; {2930#true} is VALID [2022-04-14 17:30:30,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {2930#true} call #t~ret6 := main(); {2930#true} is VALID [2022-04-14 17:30:30,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {2930#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {2930#true} is VALID [2022-04-14 17:30:30,459 INFO L272 TraceCheckUtils]: 6: Hoare triple {2930#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {2930#true} is VALID [2022-04-14 17:30:30,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {2930#true} ~cond := #in~cond; {2930#true} is VALID [2022-04-14 17:30:30,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {2930#true} assume !(0 == ~cond); {2930#true} is VALID [2022-04-14 17:30:30,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {2930#true} assume true; {2930#true} is VALID [2022-04-14 17:30:30,460 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2930#true} {2930#true} #61#return; {2930#true} is VALID [2022-04-14 17:30:30,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {2930#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2930#true} is VALID [2022-04-14 17:30:30,460 INFO L272 TraceCheckUtils]: 12: Hoare triple {2930#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {2930#true} is VALID [2022-04-14 17:30:30,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {2930#true} ~cond := #in~cond; {2974#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 17:30:30,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {2974#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2978#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:30:30,461 INFO L290 TraceCheckUtils]: 15: Hoare triple {2978#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2978#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:30:30,462 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2978#(not (= |assume_abort_if_not_#in~cond| 0))} {2930#true} #63#return; {2985#(and (<= 0 main_~b~0) (<= main_~b~0 10))} is VALID [2022-04-14 17:30:30,462 INFO L272 TraceCheckUtils]: 17: Hoare triple {2985#(and (<= 0 main_~b~0) (<= main_~b~0 10))} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2930#true} is VALID [2022-04-14 17:30:30,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {2930#true} ~cond := #in~cond; {2930#true} is VALID [2022-04-14 17:30:30,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {2930#true} assume !(0 == ~cond); {2930#true} is VALID [2022-04-14 17:30:30,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {2930#true} assume true; {2930#true} is VALID [2022-04-14 17:30:30,462 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2930#true} {2985#(and (<= 0 main_~b~0) (<= main_~b~0 10))} #65#return; {2985#(and (<= 0 main_~b~0) (<= main_~b~0 10))} is VALID [2022-04-14 17:30:30,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {2985#(and (<= 0 main_~b~0) (<= main_~b~0 10))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3004#(<= main_~y~0 10)} is VALID [2022-04-14 17:30:30,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {3004#(<= main_~y~0 10)} assume !false; {3004#(<= main_~y~0 10)} is VALID [2022-04-14 17:30:30,463 INFO L272 TraceCheckUtils]: 24: Hoare triple {3004#(<= main_~y~0 10)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2930#true} is VALID [2022-04-14 17:30:30,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {2930#true} ~cond := #in~cond; {2930#true} is VALID [2022-04-14 17:30:30,463 INFO L290 TraceCheckUtils]: 26: Hoare triple {2930#true} assume !(0 == ~cond); {2930#true} is VALID [2022-04-14 17:30:30,463 INFO L290 TraceCheckUtils]: 27: Hoare triple {2930#true} assume true; {2930#true} is VALID [2022-04-14 17:30:30,464 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2930#true} {3004#(<= main_~y~0 10)} #67#return; {3004#(<= main_~y~0 10)} is VALID [2022-04-14 17:30:30,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {3004#(<= main_~y~0 10)} assume !!(0 != ~y~0); {3026#(and (not (= main_~y~0 0)) (<= main_~y~0 10))} is VALID [2022-04-14 17:30:30,465 INFO L290 TraceCheckUtils]: 30: Hoare triple {3026#(and (not (= main_~y~0 0)) (<= main_~y~0 10))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3030#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= main_~y~0 9) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-14 17:30:30,469 INFO L290 TraceCheckUtils]: 31: Hoare triple {3030#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= main_~y~0 9) (<= 0 (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3034#(exists ((aux_mod_v_main_~y~0_32_28 Int) (aux_div_v_main_~y~0_32_28 Int)) (and (<= (+ (* aux_div_v_main_~y~0_32_28 2) aux_mod_v_main_~y~0_32_28) 10) (<= 0 (+ (* aux_div_v_main_~y~0_32_28 2) aux_mod_v_main_~y~0_32_28)) (<= main_~y~0 (div (+ (- 1) (* aux_div_v_main_~y~0_32_28 2) aux_mod_v_main_~y~0_32_28) 2)) (<= 1 aux_mod_v_main_~y~0_32_28) (< aux_mod_v_main_~y~0_32_28 2)))} is VALID [2022-04-14 17:30:30,470 INFO L290 TraceCheckUtils]: 32: Hoare triple {3034#(exists ((aux_mod_v_main_~y~0_32_28 Int) (aux_div_v_main_~y~0_32_28 Int)) (and (<= (+ (* aux_div_v_main_~y~0_32_28 2) aux_mod_v_main_~y~0_32_28) 10) (<= 0 (+ (* aux_div_v_main_~y~0_32_28 2) aux_mod_v_main_~y~0_32_28)) (<= main_~y~0 (div (+ (- 1) (* aux_div_v_main_~y~0_32_28 2) aux_mod_v_main_~y~0_32_28) 2)) (<= 1 aux_mod_v_main_~y~0_32_28) (< aux_mod_v_main_~y~0_32_28 2)))} assume !false; {3038#(<= main_~y~0 4)} is VALID [2022-04-14 17:30:30,470 INFO L272 TraceCheckUtils]: 33: Hoare triple {3038#(<= main_~y~0 4)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2930#true} is VALID [2022-04-14 17:30:30,471 INFO L290 TraceCheckUtils]: 34: Hoare triple {2930#true} ~cond := #in~cond; {2930#true} is VALID [2022-04-14 17:30:30,471 INFO L290 TraceCheckUtils]: 35: Hoare triple {2930#true} assume !(0 == ~cond); {2930#true} is VALID [2022-04-14 17:30:30,471 INFO L290 TraceCheckUtils]: 36: Hoare triple {2930#true} assume true; {2930#true} is VALID [2022-04-14 17:30:30,471 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2930#true} {3038#(<= main_~y~0 4)} #67#return; {3038#(<= main_~y~0 4)} is VALID [2022-04-14 17:30:30,472 INFO L290 TraceCheckUtils]: 38: Hoare triple {3038#(<= main_~y~0 4)} assume !!(0 != ~y~0); {3057#(and (not (= main_~y~0 0)) (<= main_~y~0 4))} is VALID [2022-04-14 17:30:30,473 INFO L290 TraceCheckUtils]: 39: Hoare triple {3057#(and (not (= main_~y~0 0)) (<= main_~y~0 4))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3061#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= main_~y~0 3) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-14 17:30:30,476 INFO L290 TraceCheckUtils]: 40: Hoare triple {3061#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= main_~y~0 3) (<= 0 (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3065#(exists ((aux_div_v_main_~y~0_34_28 Int) (aux_mod_v_main_~y~0_34_28 Int)) (and (< aux_mod_v_main_~y~0_34_28 2) (<= 0 (+ (* aux_div_v_main_~y~0_34_28 2) aux_mod_v_main_~y~0_34_28)) (= (div (+ (- 1) (* aux_div_v_main_~y~0_34_28 2) aux_mod_v_main_~y~0_34_28) 2) main_~y~0) (<= (+ (* aux_div_v_main_~y~0_34_28 2) aux_mod_v_main_~y~0_34_28) 4) (<= 1 aux_mod_v_main_~y~0_34_28)))} is VALID [2022-04-14 17:30:30,477 INFO L290 TraceCheckUtils]: 41: Hoare triple {3065#(exists ((aux_div_v_main_~y~0_34_28 Int) (aux_mod_v_main_~y~0_34_28 Int)) (and (< aux_mod_v_main_~y~0_34_28 2) (<= 0 (+ (* aux_div_v_main_~y~0_34_28 2) aux_mod_v_main_~y~0_34_28)) (= (div (+ (- 1) (* aux_div_v_main_~y~0_34_28 2) aux_mod_v_main_~y~0_34_28) 2) main_~y~0) (<= (+ (* aux_div_v_main_~y~0_34_28 2) aux_mod_v_main_~y~0_34_28) 4) (<= 1 aux_mod_v_main_~y~0_34_28)))} assume !false; {3069#(and (< 0 (+ main_~y~0 1)) (<= (* main_~y~0 2) 3))} is VALID [2022-04-14 17:30:30,477 INFO L272 TraceCheckUtils]: 42: Hoare triple {3069#(and (< 0 (+ main_~y~0 1)) (<= (* main_~y~0 2) 3))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2930#true} is VALID [2022-04-14 17:30:30,477 INFO L290 TraceCheckUtils]: 43: Hoare triple {2930#true} ~cond := #in~cond; {2930#true} is VALID [2022-04-14 17:30:30,477 INFO L290 TraceCheckUtils]: 44: Hoare triple {2930#true} assume !(0 == ~cond); {2930#true} is VALID [2022-04-14 17:30:30,477 INFO L290 TraceCheckUtils]: 45: Hoare triple {2930#true} assume true; {2930#true} is VALID [2022-04-14 17:30:30,478 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2930#true} {3069#(and (< 0 (+ main_~y~0 1)) (<= (* main_~y~0 2) 3))} #67#return; {3069#(and (< 0 (+ main_~y~0 1)) (<= (* main_~y~0 2) 3))} is VALID [2022-04-14 17:30:30,478 INFO L290 TraceCheckUtils]: 47: Hoare triple {3069#(and (< 0 (+ main_~y~0 1)) (<= (* main_~y~0 2) 3))} assume !!(0 != ~y~0); {3088#(and (not (= main_~y~0 0)) (< 0 (+ main_~y~0 1)) (<= (* main_~y~0 2) 3))} is VALID [2022-04-14 17:30:30,479 INFO L290 TraceCheckUtils]: 48: Hoare triple {3088#(and (not (= main_~y~0 0)) (< 0 (+ main_~y~0 1)) (<= (* main_~y~0 2) 3))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {2931#false} is VALID [2022-04-14 17:30:30,479 INFO L290 TraceCheckUtils]: 49: Hoare triple {2931#false} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2931#false} is VALID [2022-04-14 17:30:30,479 INFO L290 TraceCheckUtils]: 50: Hoare triple {2931#false} assume !false; {2931#false} is VALID [2022-04-14 17:30:30,479 INFO L272 TraceCheckUtils]: 51: Hoare triple {2931#false} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2931#false} is VALID [2022-04-14 17:30:30,479 INFO L290 TraceCheckUtils]: 52: Hoare triple {2931#false} ~cond := #in~cond; {2931#false} is VALID [2022-04-14 17:30:30,479 INFO L290 TraceCheckUtils]: 53: Hoare triple {2931#false} assume 0 == ~cond; {2931#false} is VALID [2022-04-14 17:30:30,480 INFO L290 TraceCheckUtils]: 54: Hoare triple {2931#false} assume !false; {2931#false} is VALID [2022-04-14 17:30:30,480 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-14 17:30:30,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:30:34,538 INFO L290 TraceCheckUtils]: 54: Hoare triple {2931#false} assume !false; {2931#false} is VALID [2022-04-14 17:30:34,539 INFO L290 TraceCheckUtils]: 53: Hoare triple {2931#false} assume 0 == ~cond; {2931#false} is VALID [2022-04-14 17:30:34,539 INFO L290 TraceCheckUtils]: 52: Hoare triple {2931#false} ~cond := #in~cond; {2931#false} is VALID [2022-04-14 17:30:34,539 INFO L272 TraceCheckUtils]: 51: Hoare triple {2931#false} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2931#false} is VALID [2022-04-14 17:30:34,539 INFO L290 TraceCheckUtils]: 50: Hoare triple {2931#false} assume !false; {2931#false} is VALID [2022-04-14 17:30:34,539 INFO L290 TraceCheckUtils]: 49: Hoare triple {2931#false} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2931#false} is VALID [2022-04-14 17:30:34,539 INFO L290 TraceCheckUtils]: 48: Hoare triple {3128#(and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {2931#false} is VALID [2022-04-14 17:30:34,540 INFO L290 TraceCheckUtils]: 47: Hoare triple {3132#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (= main_~y~0 0))} assume !!(0 != ~y~0); {3128#(and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1))} is VALID [2022-04-14 17:30:34,540 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2930#true} {3132#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (= main_~y~0 0))} #67#return; {3132#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (= main_~y~0 0))} is VALID [2022-04-14 17:30:34,540 INFO L290 TraceCheckUtils]: 45: Hoare triple {2930#true} assume true; {2930#true} is VALID [2022-04-14 17:30:34,540 INFO L290 TraceCheckUtils]: 44: Hoare triple {2930#true} assume !(0 == ~cond); {2930#true} is VALID [2022-04-14 17:30:34,540 INFO L290 TraceCheckUtils]: 43: Hoare triple {2930#true} ~cond := #in~cond; {2930#true} is VALID [2022-04-14 17:30:34,540 INFO L272 TraceCheckUtils]: 42: Hoare triple {3132#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (= main_~y~0 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2930#true} is VALID [2022-04-14 17:30:34,541 INFO L290 TraceCheckUtils]: 41: Hoare triple {3132#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (= main_~y~0 0))} assume !false; {3132#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (= main_~y~0 0))} is VALID [2022-04-14 17:30:34,542 INFO L290 TraceCheckUtils]: 40: Hoare triple {3154#(and (or (= (div main_~y~0 2) 0) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0)) (and (= (mod (div main_~y~0 2) 2) 1) (<= 0 (div main_~y~0 2)))) (or (not (< main_~y~0 0)) (= (+ (div main_~y~0 2) 1) 0)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3132#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (= main_~y~0 0))} is VALID [2022-04-14 17:30:34,543 INFO L290 TraceCheckUtils]: 39: Hoare triple {3158#(or (= (div (+ (- 1) main_~y~0) 2) 0) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0) (= (mod (div (+ (- 1) main_~y~0) 2) 2) 1))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3154#(and (or (= (div main_~y~0 2) 0) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0)) (and (= (mod (div main_~y~0 2) 2) 1) (<= 0 (div main_~y~0 2)))) (or (not (< main_~y~0 0)) (= (+ (div main_~y~0 2) 1) 0)))} is VALID [2022-04-14 17:30:34,543 INFO L290 TraceCheckUtils]: 38: Hoare triple {3158#(or (= (div (+ (- 1) main_~y~0) 2) 0) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0) (= (mod (div (+ (- 1) main_~y~0) 2) 2) 1))} assume !!(0 != ~y~0); {3158#(or (= (div (+ (- 1) main_~y~0) 2) 0) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0) (= (mod (div (+ (- 1) main_~y~0) 2) 2) 1))} is VALID [2022-04-14 17:30:34,544 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2930#true} {3158#(or (= (div (+ (- 1) main_~y~0) 2) 0) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0) (= (mod (div (+ (- 1) main_~y~0) 2) 2) 1))} #67#return; {3158#(or (= (div (+ (- 1) main_~y~0) 2) 0) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0) (= (mod (div (+ (- 1) main_~y~0) 2) 2) 1))} is VALID [2022-04-14 17:30:34,544 INFO L290 TraceCheckUtils]: 36: Hoare triple {2930#true} assume true; {2930#true} is VALID [2022-04-14 17:30:34,544 INFO L290 TraceCheckUtils]: 35: Hoare triple {2930#true} assume !(0 == ~cond); {2930#true} is VALID [2022-04-14 17:30:34,544 INFO L290 TraceCheckUtils]: 34: Hoare triple {2930#true} ~cond := #in~cond; {2930#true} is VALID [2022-04-14 17:30:34,544 INFO L272 TraceCheckUtils]: 33: Hoare triple {3158#(or (= (div (+ (- 1) main_~y~0) 2) 0) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0) (= (mod (div (+ (- 1) main_~y~0) 2) 2) 1))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2930#true} is VALID [2022-04-14 17:30:34,544 INFO L290 TraceCheckUtils]: 32: Hoare triple {3158#(or (= (div (+ (- 1) main_~y~0) 2) 0) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0) (= (mod (div (+ (- 1) main_~y~0) 2) 2) 1))} assume !false; {3158#(or (= (div (+ (- 1) main_~y~0) 2) 0) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0) (= (mod (div (+ (- 1) main_~y~0) 2) 2) 1))} is VALID [2022-04-14 17:30:34,546 INFO L290 TraceCheckUtils]: 31: Hoare triple {3183#(<= (div (+ (- 2) (* (- 1) (div (* (- 1) (div main_~y~0 2)) (- 2)))) (- 2)) 2)} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3158#(or (= (div (+ (- 1) main_~y~0) 2) 0) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0) (= (mod (div (+ (- 1) main_~y~0) 2) 2) 1))} is VALID [2022-04-14 17:30:34,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {3187#(or (<= (div (+ (- 2) (* (- 1) (div (* (- 1) (div (+ (- 1) main_~y~0) 2)) (- 2)))) (- 2)) 2) (< (mod main_~y~0 2) 1))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3183#(<= (div (+ (- 2) (* (- 1) (div (* (- 1) (div main_~y~0 2)) (- 2)))) (- 2)) 2)} is VALID [2022-04-14 17:30:34,547 INFO L290 TraceCheckUtils]: 29: Hoare triple {3187#(or (<= (div (+ (- 2) (* (- 1) (div (* (- 1) (div (+ (- 1) main_~y~0) 2)) (- 2)))) (- 2)) 2) (< (mod main_~y~0 2) 1))} assume !!(0 != ~y~0); {3187#(or (<= (div (+ (- 2) (* (- 1) (div (* (- 1) (div (+ (- 1) main_~y~0) 2)) (- 2)))) (- 2)) 2) (< (mod main_~y~0 2) 1))} is VALID [2022-04-14 17:30:34,548 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2930#true} {3187#(or (<= (div (+ (- 2) (* (- 1) (div (* (- 1) (div (+ (- 1) main_~y~0) 2)) (- 2)))) (- 2)) 2) (< (mod main_~y~0 2) 1))} #67#return; {3187#(or (<= (div (+ (- 2) (* (- 1) (div (* (- 1) (div (+ (- 1) main_~y~0) 2)) (- 2)))) (- 2)) 2) (< (mod main_~y~0 2) 1))} is VALID [2022-04-14 17:30:34,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {2930#true} assume true; {2930#true} is VALID [2022-04-14 17:30:34,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {2930#true} assume !(0 == ~cond); {2930#true} is VALID [2022-04-14 17:30:34,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {2930#true} ~cond := #in~cond; {2930#true} is VALID [2022-04-14 17:30:34,548 INFO L272 TraceCheckUtils]: 24: Hoare triple {3187#(or (<= (div (+ (- 2) (* (- 1) (div (* (- 1) (div (+ (- 1) main_~y~0) 2)) (- 2)))) (- 2)) 2) (< (mod main_~y~0 2) 1))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2930#true} is VALID [2022-04-14 17:30:34,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {3187#(or (<= (div (+ (- 2) (* (- 1) (div (* (- 1) (div (+ (- 1) main_~y~0) 2)) (- 2)))) (- 2)) 2) (< (mod main_~y~0 2) 1))} assume !false; {3187#(or (<= (div (+ (- 2) (* (- 1) (div (* (- 1) (div (+ (- 1) main_~y~0) 2)) (- 2)))) (- 2)) 2) (< (mod main_~y~0 2) 1))} is VALID [2022-04-14 17:30:34,549 INFO L290 TraceCheckUtils]: 22: Hoare triple {3212#(<= (div (+ (- 1) (div (+ (- 1) (div (+ (* (- 1) main_~b~0) (- 8)) 2)) 2)) (- 2)) 3)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3187#(or (<= (div (+ (- 2) (* (- 1) (div (* (- 1) (div (+ (- 1) main_~y~0) 2)) (- 2)))) (- 2)) 2) (< (mod main_~y~0 2) 1))} is VALID [2022-04-14 17:30:34,549 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2930#true} {3212#(<= (div (+ (- 1) (div (+ (- 1) (div (+ (* (- 1) main_~b~0) (- 8)) 2)) 2)) (- 2)) 3)} #65#return; {3212#(<= (div (+ (- 1) (div (+ (- 1) (div (+ (* (- 1) main_~b~0) (- 8)) 2)) 2)) (- 2)) 3)} is VALID [2022-04-14 17:30:34,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {2930#true} assume true; {2930#true} is VALID [2022-04-14 17:30:34,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {2930#true} assume !(0 == ~cond); {2930#true} is VALID [2022-04-14 17:30:34,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {2930#true} ~cond := #in~cond; {2930#true} is VALID [2022-04-14 17:30:34,550 INFO L272 TraceCheckUtils]: 17: Hoare triple {3212#(<= (div (+ (- 1) (div (+ (- 1) (div (+ (* (- 1) main_~b~0) (- 8)) 2)) 2)) (- 2)) 3)} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2930#true} is VALID [2022-04-14 17:30:34,550 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2978#(not (= |assume_abort_if_not_#in~cond| 0))} {2930#true} #63#return; {3212#(<= (div (+ (- 1) (div (+ (- 1) (div (+ (* (- 1) main_~b~0) (- 8)) 2)) 2)) (- 2)) 3)} is VALID [2022-04-14 17:30:34,551 INFO L290 TraceCheckUtils]: 15: Hoare triple {2978#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2978#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:30:34,551 INFO L290 TraceCheckUtils]: 14: Hoare triple {3240#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {2978#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:30:34,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {2930#true} ~cond := #in~cond; {3240#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-14 17:30:34,551 INFO L272 TraceCheckUtils]: 12: Hoare triple {2930#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {2930#true} is VALID [2022-04-14 17:30:34,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {2930#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2930#true} is VALID [2022-04-14 17:30:34,551 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2930#true} {2930#true} #61#return; {2930#true} is VALID [2022-04-14 17:30:34,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {2930#true} assume true; {2930#true} is VALID [2022-04-14 17:30:34,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {2930#true} assume !(0 == ~cond); {2930#true} is VALID [2022-04-14 17:30:34,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {2930#true} ~cond := #in~cond; {2930#true} is VALID [2022-04-14 17:30:34,552 INFO L272 TraceCheckUtils]: 6: Hoare triple {2930#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {2930#true} is VALID [2022-04-14 17:30:34,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {2930#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {2930#true} is VALID [2022-04-14 17:30:34,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {2930#true} call #t~ret6 := main(); {2930#true} is VALID [2022-04-14 17:30:34,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2930#true} {2930#true} #71#return; {2930#true} is VALID [2022-04-14 17:30:34,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {2930#true} assume true; {2930#true} is VALID [2022-04-14 17:30:34,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {2930#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(13, 2);call #Ultimate.allocInit(12, 3); {2930#true} is VALID [2022-04-14 17:30:34,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {2930#true} call ULTIMATE.init(); {2930#true} is VALID [2022-04-14 17:30:34,552 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 17 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-14 17:30:34,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:30:34,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798265622] [2022-04-14 17:30:34,552 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:30:34,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154782682] [2022-04-14 17:30:34,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154782682] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 17:30:34,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 17:30:34,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 23 [2022-04-14 17:30:34,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924742420] [2022-04-14 17:30:34,553 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 17:30:34,554 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 21 states have internal predecessors, (44), 10 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) Word has length 55 [2022-04-14 17:30:34,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:30:34,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 21 states have internal predecessors, (44), 10 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-14 17:30:34,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:30:34,636 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-14 17:30:34,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:30:34,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-14 17:30:34,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2022-04-14 17:30:34,637 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 21 states have internal predecessors, (44), 10 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-14 17:30:36,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:30:36,454 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2022-04-14 17:30:36,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-14 17:30:36,454 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 21 states have internal predecessors, (44), 10 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) Word has length 55 [2022-04-14 17:30:36,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:30:36,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 21 states have internal predecessors, (44), 10 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-14 17:30:36,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 81 transitions. [2022-04-14 17:30:36,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 21 states have internal predecessors, (44), 10 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-14 17:30:36,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 81 transitions. [2022-04-14 17:30:36,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 81 transitions. [2022-04-14 17:30:36,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:30:36,542 INFO L225 Difference]: With dead ends: 110 [2022-04-14 17:30:36,542 INFO L226 Difference]: Without dead ends: 75 [2022-04-14 17:30:36,543 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=379, Invalid=1261, Unknown=0, NotChecked=0, Total=1640 [2022-04-14 17:30:36,543 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 24 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-14 17:30:36,544 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 223 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 232 Invalid, 0 Unknown, 38 Unchecked, 0.6s Time] [2022-04-14 17:30:36,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-14 17:30:36,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2022-04-14 17:30:36,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:30:36,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 70 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 52 states have internal predecessors, (52), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 17:30:36,600 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 70 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 52 states have internal predecessors, (52), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 17:30:36,601 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 70 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 52 states have internal predecessors, (52), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 17:30:36,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:30:36,603 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2022-04-14 17:30:36,603 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2022-04-14 17:30:36,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:30:36,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:30:36,604 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 52 states have internal predecessors, (52), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) Second operand 75 states. [2022-04-14 17:30:36,604 INFO L87 Difference]: Start difference. First operand has 70 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 52 states have internal predecessors, (52), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) Second operand 75 states. [2022-04-14 17:30:36,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:30:36,606 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2022-04-14 17:30:36,606 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2022-04-14 17:30:36,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:30:36,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:30:36,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:30:36,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:30:36,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 52 states have internal predecessors, (52), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 17:30:36,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2022-04-14 17:30:36,609 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 55 [2022-04-14 17:30:36,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:30:36,609 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2022-04-14 17:30:36,609 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 21 states have internal predecessors, (44), 10 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-14 17:30:36,609 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-14 17:30:36,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-14 17:30:36,610 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:30:36,610 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:30:36,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-14 17:30:36,819 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:30:36,820 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:30:36,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:30:36,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1814345074, now seen corresponding path program 3 times [2022-04-14 17:30:36,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:30:36,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588776862] [2022-04-14 17:30:36,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:30:36,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:30:36,841 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:30:36,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [302723976] [2022-04-14 17:30:36,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 17:30:36,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:30:36,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:30:36,847 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 17:30:36,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-14 17:30:36,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-14 17:30:36,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 17:30:36,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-14 17:30:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:30:36,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:30:52,479 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-14 17:30:56,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {3727#true} call ULTIMATE.init(); {3727#true} is VALID [2022-04-14 17:30:56,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {3727#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(13, 2);call #Ultimate.allocInit(12, 3); {3727#true} is VALID [2022-04-14 17:30:56,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {3727#true} assume true; {3727#true} is VALID [2022-04-14 17:30:56,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3727#true} {3727#true} #71#return; {3727#true} is VALID [2022-04-14 17:30:56,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {3727#true} call #t~ret6 := main(); {3727#true} is VALID [2022-04-14 17:30:56,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {3727#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {3727#true} is VALID [2022-04-14 17:30:56,545 INFO L272 TraceCheckUtils]: 6: Hoare triple {3727#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {3727#true} is VALID [2022-04-14 17:30:56,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {3727#true} ~cond := #in~cond; {3727#true} is VALID [2022-04-14 17:30:56,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {3727#true} assume !(0 == ~cond); {3727#true} is VALID [2022-04-14 17:30:56,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {3727#true} assume true; {3727#true} is VALID [2022-04-14 17:30:56,546 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3727#true} {3727#true} #61#return; {3727#true} is VALID [2022-04-14 17:30:56,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {3727#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3727#true} is VALID [2022-04-14 17:30:56,546 INFO L272 TraceCheckUtils]: 12: Hoare triple {3727#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {3727#true} is VALID [2022-04-14 17:30:56,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {3727#true} ~cond := #in~cond; {3771#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 17:30:56,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {3771#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3775#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:30:56,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {3775#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3775#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:30:56,548 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3775#(not (= |assume_abort_if_not_#in~cond| 0))} {3727#true} #63#return; {3782#(and (<= 0 main_~b~0) (<= main_~b~0 10))} is VALID [2022-04-14 17:30:56,548 INFO L272 TraceCheckUtils]: 17: Hoare triple {3782#(and (<= 0 main_~b~0) (<= main_~b~0 10))} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3727#true} is VALID [2022-04-14 17:30:56,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {3727#true} ~cond := #in~cond; {3727#true} is VALID [2022-04-14 17:30:56,548 INFO L290 TraceCheckUtils]: 19: Hoare triple {3727#true} assume !(0 == ~cond); {3727#true} is VALID [2022-04-14 17:30:56,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {3727#true} assume true; {3727#true} is VALID [2022-04-14 17:30:56,548 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3727#true} {3782#(and (<= 0 main_~b~0) (<= main_~b~0 10))} #65#return; {3782#(and (<= 0 main_~b~0) (<= main_~b~0 10))} is VALID [2022-04-14 17:30:56,549 INFO L290 TraceCheckUtils]: 22: Hoare triple {3782#(and (<= 0 main_~b~0) (<= main_~b~0 10))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3801#(and (= main_~b~0 main_~y~0) (<= 0 main_~b~0) (<= main_~b~0 10))} is VALID [2022-04-14 17:30:56,549 INFO L290 TraceCheckUtils]: 23: Hoare triple {3801#(and (= main_~b~0 main_~y~0) (<= 0 main_~b~0) (<= main_~b~0 10))} assume !false; {3801#(and (= main_~b~0 main_~y~0) (<= 0 main_~b~0) (<= main_~b~0 10))} is VALID [2022-04-14 17:30:56,549 INFO L272 TraceCheckUtils]: 24: Hoare triple {3801#(and (= main_~b~0 main_~y~0) (<= 0 main_~b~0) (<= main_~b~0 10))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3727#true} is VALID [2022-04-14 17:30:56,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {3727#true} ~cond := #in~cond; {3727#true} is VALID [2022-04-14 17:30:56,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {3727#true} assume !(0 == ~cond); {3727#true} is VALID [2022-04-14 17:30:56,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {3727#true} assume true; {3727#true} is VALID [2022-04-14 17:30:56,550 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3727#true} {3801#(and (= main_~b~0 main_~y~0) (<= 0 main_~b~0) (<= main_~b~0 10))} #67#return; {3801#(and (= main_~b~0 main_~y~0) (<= 0 main_~b~0) (<= main_~b~0 10))} is VALID [2022-04-14 17:30:56,551 INFO L290 TraceCheckUtils]: 29: Hoare triple {3801#(and (= main_~b~0 main_~y~0) (<= 0 main_~b~0) (<= main_~b~0 10))} assume !!(0 != ~y~0); {3823#(and (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (<= 0 main_~b~0) (<= main_~b~0 10))} is VALID [2022-04-14 17:30:56,551 INFO L290 TraceCheckUtils]: 30: Hoare triple {3823#(and (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (<= 0 main_~b~0) (<= main_~b~0 10))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3827#(and (<= main_~b~0 (+ main_~y~0 1)) (not (= main_~b~0 0)) (<= 0 main_~b~0) (<= main_~b~0 10))} is VALID [2022-04-14 17:30:56,553 INFO L290 TraceCheckUtils]: 31: Hoare triple {3827#(and (<= main_~b~0 (+ main_~y~0 1)) (not (= main_~b~0 0)) (<= 0 main_~b~0) (<= main_~b~0 10))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3831#(and (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 10))} is VALID [2022-04-14 17:30:56,553 INFO L290 TraceCheckUtils]: 32: Hoare triple {3831#(and (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 10))} assume !false; {3831#(and (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 10))} is VALID [2022-04-14 17:30:56,553 INFO L272 TraceCheckUtils]: 33: Hoare triple {3831#(and (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 10))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3727#true} is VALID [2022-04-14 17:30:56,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {3727#true} ~cond := #in~cond; {3727#true} is VALID [2022-04-14 17:30:56,553 INFO L290 TraceCheckUtils]: 35: Hoare triple {3727#true} assume !(0 == ~cond); {3727#true} is VALID [2022-04-14 17:30:56,553 INFO L290 TraceCheckUtils]: 36: Hoare triple {3727#true} assume true; {3727#true} is VALID [2022-04-14 17:30:56,554 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3727#true} {3831#(and (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 10))} #67#return; {3831#(and (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 10))} is VALID [2022-04-14 17:30:56,554 INFO L290 TraceCheckUtils]: 38: Hoare triple {3831#(and (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 10))} assume !!(0 != ~y~0); {3831#(and (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 10))} is VALID [2022-04-14 17:30:56,555 INFO L290 TraceCheckUtils]: 39: Hoare triple {3831#(and (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 10))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3831#(and (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 10))} is VALID [2022-04-14 17:30:56,556 INFO L290 TraceCheckUtils]: 40: Hoare triple {3831#(and (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 10))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3859#(and (< (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2)) (+ main_~y~0 1)) (not (= main_~b~0 0)) (<= 0 main_~b~0) (<= main_~b~0 10))} is VALID [2022-04-14 17:30:56,557 INFO L290 TraceCheckUtils]: 41: Hoare triple {3859#(and (< (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2)) (+ main_~y~0 1)) (not (= main_~b~0 0)) (<= 0 main_~b~0) (<= main_~b~0 10))} assume !false; {3859#(and (< (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2)) (+ main_~y~0 1)) (not (= main_~b~0 0)) (<= 0 main_~b~0) (<= main_~b~0 10))} is VALID [2022-04-14 17:30:56,557 INFO L272 TraceCheckUtils]: 42: Hoare triple {3859#(and (< (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2)) (+ main_~y~0 1)) (not (= main_~b~0 0)) (<= 0 main_~b~0) (<= main_~b~0 10))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3727#true} is VALID [2022-04-14 17:30:56,557 INFO L290 TraceCheckUtils]: 43: Hoare triple {3727#true} ~cond := #in~cond; {3869#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:30:56,558 INFO L290 TraceCheckUtils]: 44: Hoare triple {3869#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3873#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:30:56,558 INFO L290 TraceCheckUtils]: 45: Hoare triple {3873#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3873#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:30:56,559 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3873#(not (= |__VERIFIER_assert_#in~cond| 0))} {3859#(and (< (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2)) (+ main_~y~0 1)) (not (= main_~b~0 0)) (<= 0 main_~b~0) (<= main_~b~0 10))} #67#return; {3880#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2)) (+ main_~y~0 1)) (not (= main_~b~0 0)) (<= 0 main_~b~0) (<= main_~b~0 10))} is VALID [2022-04-14 17:30:56,560 INFO L290 TraceCheckUtils]: 47: Hoare triple {3880#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2)) (+ main_~y~0 1)) (not (= main_~b~0 0)) (<= 0 main_~b~0) (<= main_~b~0 10))} assume !!(0 != ~y~0); {3880#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2)) (+ main_~y~0 1)) (not (= main_~b~0 0)) (<= 0 main_~b~0) (<= main_~b~0 10))} is VALID [2022-04-14 17:30:56,561 INFO L290 TraceCheckUtils]: 48: Hoare triple {3880#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2)) (+ main_~y~0 1)) (not (= main_~b~0 0)) (<= 0 main_~b~0) (<= main_~b~0 10))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3887#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (< (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2)) (+ main_~y~0 1)) (not (= main_~b~0 0)) (<= 0 main_~b~0) (<= main_~b~0 10))} is VALID [2022-04-14 17:30:57,258 INFO L290 TraceCheckUtils]: 49: Hoare triple {3887#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (< (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2)) (+ main_~y~0 1)) (not (= main_~b~0 0)) (<= 0 main_~b~0) (<= main_~b~0 10))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3891#(and (exists ((aux_mod_v_main_~y~0_44_22 Int) (aux_div_v_main_~y~0_44_22 Int)) (and (not (= aux_mod_v_main_~y~0_44_22 1)) (= (div (+ (* aux_div_v_main_~y~0_44_22 2) aux_mod_v_main_~y~0_44_22) 2) main_~y~0) (= (+ main_~z~0 (* (+ (* aux_div_v_main_~y~0_44_22 2) aux_mod_v_main_~y~0_44_22) (div (- main_~x~0) (- 2)))) (* main_~b~0 main_~a~0)) (< aux_mod_v_main_~y~0_44_22 2) (<= 0 aux_mod_v_main_~y~0_44_22) (< (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2)) (+ (* aux_div_v_main_~y~0_44_22 2) aux_mod_v_main_~y~0_44_22 1)))) (not (= main_~b~0 0)) (<= 0 main_~b~0) (<= main_~b~0 10) (= (mod main_~x~0 2) 0))} is VALID [2022-04-14 17:30:58,373 INFO L290 TraceCheckUtils]: 50: Hoare triple {3891#(and (exists ((aux_mod_v_main_~y~0_44_22 Int) (aux_div_v_main_~y~0_44_22 Int)) (and (not (= aux_mod_v_main_~y~0_44_22 1)) (= (div (+ (* aux_div_v_main_~y~0_44_22 2) aux_mod_v_main_~y~0_44_22) 2) main_~y~0) (= (+ main_~z~0 (* (+ (* aux_div_v_main_~y~0_44_22 2) aux_mod_v_main_~y~0_44_22) (div (- main_~x~0) (- 2)))) (* main_~b~0 main_~a~0)) (< aux_mod_v_main_~y~0_44_22 2) (<= 0 aux_mod_v_main_~y~0_44_22) (< (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2)) (+ (* aux_div_v_main_~y~0_44_22 2) aux_mod_v_main_~y~0_44_22 1)))) (not (= main_~b~0 0)) (<= 0 main_~b~0) (<= main_~b~0 10) (= (mod main_~x~0 2) 0))} assume !false; {3895#(and (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) (* main_~b~0 main_~a~0)) (not (= main_~b~0 0)) (<= 0 main_~b~0) (<= main_~b~0 10) (= (mod main_~x~0 2) 0) (< (div (* (- 1) (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2))) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-14 17:30:58,699 INFO L272 TraceCheckUtils]: 51: Hoare triple {3895#(and (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) (* main_~b~0 main_~a~0)) (not (= main_~b~0 0)) (<= 0 main_~b~0) (<= main_~b~0 10) (= (mod main_~x~0 2) 0) (< (div (* (- 1) (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2))) (- 2)) (+ main_~y~0 1)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3899#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:30:58,699 INFO L290 TraceCheckUtils]: 52: Hoare triple {3899#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3903#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:30:58,700 INFO L290 TraceCheckUtils]: 53: Hoare triple {3903#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3728#false} is VALID [2022-04-14 17:30:58,700 INFO L290 TraceCheckUtils]: 54: Hoare triple {3728#false} assume !false; {3728#false} is VALID [2022-04-14 17:30:58,700 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 17:30:58,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:31:37,219 INFO L290 TraceCheckUtils]: 54: Hoare triple {3728#false} assume !false; {3728#false} is VALID [2022-04-14 17:31:37,219 INFO L290 TraceCheckUtils]: 53: Hoare triple {3903#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3728#false} is VALID [2022-04-14 17:31:37,220 INFO L290 TraceCheckUtils]: 52: Hoare triple {3899#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3903#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:31:37,220 INFO L272 TraceCheckUtils]: 51: Hoare triple {3919#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3899#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:31:37,221 INFO L290 TraceCheckUtils]: 50: Hoare triple {3919#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {3919#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-14 17:31:37,225 INFO L290 TraceCheckUtils]: 49: Hoare triple {3926#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3919#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-14 17:31:37,226 INFO L290 TraceCheckUtils]: 48: Hoare triple {3930#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3926#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-14 17:31:37,227 INFO L290 TraceCheckUtils]: 47: Hoare triple {3930#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {3930#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-14 17:31:37,229 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3873#(not (= |__VERIFIER_assert_#in~cond| 0))} {3937#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} #67#return; {3930#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-14 17:31:37,230 INFO L290 TraceCheckUtils]: 45: Hoare triple {3873#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3873#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:31:37,230 INFO L290 TraceCheckUtils]: 44: Hoare triple {3947#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3873#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:31:37,230 INFO L290 TraceCheckUtils]: 43: Hoare triple {3727#true} ~cond := #in~cond; {3947#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 17:31:37,230 INFO L272 TraceCheckUtils]: 42: Hoare triple {3937#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3727#true} is VALID [2022-04-14 17:31:37,231 INFO L290 TraceCheckUtils]: 41: Hoare triple {3937#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} assume !false; {3937#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID [2022-04-14 17:31:37,237 INFO L290 TraceCheckUtils]: 40: Hoare triple {3957#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3937#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID [2022-04-14 17:31:37,237 INFO L290 TraceCheckUtils]: 39: Hoare triple {3957#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3957#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-14 17:31:37,238 INFO L290 TraceCheckUtils]: 38: Hoare triple {3957#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} assume !!(0 != ~y~0); {3957#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-14 17:31:37,238 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3727#true} {3957#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} #67#return; {3957#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-14 17:31:37,238 INFO L290 TraceCheckUtils]: 36: Hoare triple {3727#true} assume true; {3727#true} is VALID [2022-04-14 17:31:37,238 INFO L290 TraceCheckUtils]: 35: Hoare triple {3727#true} assume !(0 == ~cond); {3727#true} is VALID [2022-04-14 17:31:37,238 INFO L290 TraceCheckUtils]: 34: Hoare triple {3727#true} ~cond := #in~cond; {3727#true} is VALID [2022-04-14 17:31:37,238 INFO L272 TraceCheckUtils]: 33: Hoare triple {3957#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3727#true} is VALID [2022-04-14 17:31:37,239 INFO L290 TraceCheckUtils]: 32: Hoare triple {3957#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} assume !false; {3957#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-14 17:31:37,240 INFO L290 TraceCheckUtils]: 31: Hoare triple {3985#(and (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ 2 (div (+ (- 2) (div (+ 4 (* (- 1) (div main_~y~0 2))) (- 2))) 2)))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3957#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-14 17:31:37,242 INFO L290 TraceCheckUtils]: 30: Hoare triple {3989#(<= 0 (+ 3 (div (+ (- 1) (div (+ (- 4) (* (- 1) (div (+ main_~y~0 (- 10)) (- 2)))) 2)) 2)))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3985#(and (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ 2 (div (+ (- 2) (div (+ 4 (* (- 1) (div main_~y~0 2))) (- 2))) 2)))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID [2022-04-14 17:31:37,242 INFO L290 TraceCheckUtils]: 29: Hoare triple {3989#(<= 0 (+ 3 (div (+ (- 1) (div (+ (- 4) (* (- 1) (div (+ main_~y~0 (- 10)) (- 2)))) 2)) 2)))} assume !!(0 != ~y~0); {3989#(<= 0 (+ 3 (div (+ (- 1) (div (+ (- 4) (* (- 1) (div (+ main_~y~0 (- 10)) (- 2)))) 2)) 2)))} is VALID [2022-04-14 17:31:37,242 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3727#true} {3989#(<= 0 (+ 3 (div (+ (- 1) (div (+ (- 4) (* (- 1) (div (+ main_~y~0 (- 10)) (- 2)))) 2)) 2)))} #67#return; {3989#(<= 0 (+ 3 (div (+ (- 1) (div (+ (- 4) (* (- 1) (div (+ main_~y~0 (- 10)) (- 2)))) 2)) 2)))} is VALID [2022-04-14 17:31:37,242 INFO L290 TraceCheckUtils]: 27: Hoare triple {3727#true} assume true; {3727#true} is VALID [2022-04-14 17:31:37,243 INFO L290 TraceCheckUtils]: 26: Hoare triple {3727#true} assume !(0 == ~cond); {3727#true} is VALID [2022-04-14 17:31:37,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {3727#true} ~cond := #in~cond; {3727#true} is VALID [2022-04-14 17:31:37,243 INFO L272 TraceCheckUtils]: 24: Hoare triple {3989#(<= 0 (+ 3 (div (+ (- 1) (div (+ (- 4) (* (- 1) (div (+ main_~y~0 (- 10)) (- 2)))) 2)) 2)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3727#true} is VALID [2022-04-14 17:31:37,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {3989#(<= 0 (+ 3 (div (+ (- 1) (div (+ (- 4) (* (- 1) (div (+ main_~y~0 (- 10)) (- 2)))) 2)) 2)))} assume !false; {3989#(<= 0 (+ 3 (div (+ (- 1) (div (+ (- 4) (* (- 1) (div (+ main_~y~0 (- 10)) (- 2)))) 2)) 2)))} is VALID [2022-04-14 17:31:37,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {4014#(<= 0 (+ 3 (div (+ (- 1) (div (+ (* (- 1) (div (+ main_~b~0 (- 10)) (- 2))) (- 4)) 2)) 2)))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3989#(<= 0 (+ 3 (div (+ (- 1) (div (+ (- 4) (* (- 1) (div (+ main_~y~0 (- 10)) (- 2)))) 2)) 2)))} is VALID [2022-04-14 17:31:37,244 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3727#true} {4014#(<= 0 (+ 3 (div (+ (- 1) (div (+ (* (- 1) (div (+ main_~b~0 (- 10)) (- 2))) (- 4)) 2)) 2)))} #65#return; {4014#(<= 0 (+ 3 (div (+ (- 1) (div (+ (* (- 1) (div (+ main_~b~0 (- 10)) (- 2))) (- 4)) 2)) 2)))} is VALID [2022-04-14 17:31:37,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {3727#true} assume true; {3727#true} is VALID [2022-04-14 17:31:37,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {3727#true} assume !(0 == ~cond); {3727#true} is VALID [2022-04-14 17:31:37,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {3727#true} ~cond := #in~cond; {3727#true} is VALID [2022-04-14 17:31:37,244 INFO L272 TraceCheckUtils]: 17: Hoare triple {4014#(<= 0 (+ 3 (div (+ (- 1) (div (+ (* (- 1) (div (+ main_~b~0 (- 10)) (- 2))) (- 4)) 2)) 2)))} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3727#true} is VALID [2022-04-14 17:31:37,245 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3775#(not (= |assume_abort_if_not_#in~cond| 0))} {3727#true} #63#return; {4014#(<= 0 (+ 3 (div (+ (- 1) (div (+ (* (- 1) (div (+ main_~b~0 (- 10)) (- 2))) (- 4)) 2)) 2)))} is VALID [2022-04-14 17:31:37,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {3775#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3775#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:31:37,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {4042#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {3775#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:31:37,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {3727#true} ~cond := #in~cond; {4042#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-14 17:31:37,246 INFO L272 TraceCheckUtils]: 12: Hoare triple {3727#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {3727#true} is VALID [2022-04-14 17:31:37,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {3727#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3727#true} is VALID [2022-04-14 17:31:37,246 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3727#true} {3727#true} #61#return; {3727#true} is VALID [2022-04-14 17:31:37,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {3727#true} assume true; {3727#true} is VALID [2022-04-14 17:31:37,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {3727#true} assume !(0 == ~cond); {3727#true} is VALID [2022-04-14 17:31:37,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {3727#true} ~cond := #in~cond; {3727#true} is VALID [2022-04-14 17:31:37,246 INFO L272 TraceCheckUtils]: 6: Hoare triple {3727#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {3727#true} is VALID [2022-04-14 17:31:37,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {3727#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {3727#true} is VALID [2022-04-14 17:31:37,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {3727#true} call #t~ret6 := main(); {3727#true} is VALID [2022-04-14 17:31:37,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3727#true} {3727#true} #71#return; {3727#true} is VALID [2022-04-14 17:31:37,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {3727#true} assume true; {3727#true} is VALID [2022-04-14 17:31:37,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {3727#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(13, 2);call #Ultimate.allocInit(12, 3); {3727#true} is VALID [2022-04-14 17:31:37,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {3727#true} call ULTIMATE.init(); {3727#true} is VALID [2022-04-14 17:31:37,247 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 19 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 17:31:37,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:31:37,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588776862] [2022-04-14 17:31:37,247 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:31:37,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302723976] [2022-04-14 17:31:37,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302723976] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 17:31:37,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 17:31:37,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 28 [2022-04-14 17:31:37,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410545550] [2022-04-14 17:31:37,248 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 17:31:37,249 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 25 states have internal predecessors, (51), 11 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) Word has length 55 [2022-04-14 17:31:37,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:31:37,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 25 states have internal predecessors, (51), 11 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-14 17:31:40,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 76 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 17:31:40,708 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-14 17:31:40,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:31:40,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-14 17:31:40,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=617, Unknown=4, NotChecked=0, Total=756 [2022-04-14 17:31:40,709 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 25 states have internal predecessors, (51), 11 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-14 17:31:44,222 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 17:31:48,319 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 17:32:11,625 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 17:32:23,275 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 17:33:02,385 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 17:33:03,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:33:03,300 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-04-14 17:33:03,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-14 17:33:03,301 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 25 states have internal predecessors, (51), 11 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) Word has length 55 [2022-04-14 17:33:03,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:33:03,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 25 states have internal predecessors, (51), 11 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-14 17:33:03,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 49 transitions. [2022-04-14 17:33:03,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 25 states have internal predecessors, (51), 11 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-14 17:33:03,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 49 transitions. [2022-04-14 17:33:03,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 49 transitions. [2022-04-14 17:33:09,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 47 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 17:33:09,481 INFO L225 Difference]: With dead ends: 72 [2022-04-14 17:33:09,481 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 17:33:09,482 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 53.1s TimeCoverageRelationStatistics Valid=328, Invalid=1302, Unknown=10, NotChecked=0, Total=1640 [2022-04-14 17:33:09,482 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 54 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 45 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2022-04-14 17:33:09,483 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 187 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 283 Invalid, 3 Unknown, 9 Unchecked, 12.5s Time] [2022-04-14 17:33:09,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 17:33:09,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 17:33:09,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:33:09,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 17:33:09,483 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 17:33:09,483 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 17:33:09,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:33:09,484 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 17:33:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 17:33:09,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:33:09,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:33:09,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 17:33:09,484 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 17:33:09,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:33:09,484 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 17:33:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 17:33:09,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:33:09,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:33:09,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:33:09,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:33:09,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 17:33:09,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 17:33:09,484 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2022-04-14 17:33:09,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:33:09,485 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 17:33:09,485 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 25 states have internal predecessors, (51), 11 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-14 17:33:09,485 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 17:33:09,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:33:09,487 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 17:33:09,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-14 17:33:09,687 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-14 17:33:09,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-14 17:33:25,782 WARN L232 SmtUtils]: Spent 15.92s on a formula simplification. DAG size of input: 127 DAG size of output: 72 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-14 17:33:35,930 WARN L232 SmtUtils]: Spent 10.07s on a formula simplification. DAG size of input: 139 DAG size of output: 88 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-14 17:33:35,952 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 6) no Hoare annotation was computed. [2022-04-14 17:33:35,952 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 6) no Hoare annotation was computed. [2022-04-14 17:33:35,952 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 6) no Hoare annotation was computed. [2022-04-14 17:33:35,953 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 9 11) the Hoare annotation is: true [2022-04-14 17:33:35,953 INFO L882 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2022-04-14 17:33:35,953 INFO L882 garLoopResultBuilder]: For program point L10-2(lines 9 11) no Hoare annotation was computed. [2022-04-14 17:33:35,953 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 9 11) no Hoare annotation was computed. [2022-04-14 17:33:35,953 INFO L885 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-14 17:33:35,953 INFO L878 garLoopResultBuilder]: At program point L27-1(line 27) the Hoare annotation is: (and (<= 0 main_~b~0) (<= main_~b~0 10)) [2022-04-14 17:33:35,953 INFO L885 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-04-14 17:33:35,953 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 20 49) no Hoare annotation was computed. [2022-04-14 17:33:35,953 INFO L882 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2022-04-14 17:33:35,953 INFO L882 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-04-14 17:33:35,953 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 20 49) no Hoare annotation was computed. [2022-04-14 17:33:35,953 INFO L878 garLoopResultBuilder]: At program point L34-2(lines 34 45) the Hoare annotation is: (let ((.cse4 (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (.cse0 (mod main_~y~0 2)) (.cse5 (<= 1 main_~b~0)) (.cse3 (<= main_~b~0 10))) (or (and (or (not (<= 1 .cse0)) (= (mod (div (+ (- 1) main_~y~0) 2) 2) 1)) (not (= main_~b~0 0)) (<= (div (+ (- 2) (* (- 1) (div (* (- 1) (div main_~y~0 2)) (- 2)))) (- 2)) 2) (exists ((aux_mod_v_main_~y~0_44_22 Int) (aux_div_v_main_~y~0_44_22 Int)) (let ((.cse1 (* aux_div_v_main_~y~0_44_22 2))) (and (not (= aux_mod_v_main_~y~0_44_22 1)) (= (div (+ .cse1 aux_mod_v_main_~y~0_44_22) 2) main_~y~0) (= (let ((.cse2 (div (* (- 1) main_~x~0) (- 2)))) (+ main_~z~0 (* (* .cse2 aux_div_v_main_~y~0_44_22) 2) (* .cse2 aux_mod_v_main_~y~0_44_22))) (* main_~b~0 main_~a~0)) (< aux_mod_v_main_~y~0_44_22 2) (<= 0 aux_mod_v_main_~y~0_44_22) (< (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2)) (+ .cse1 aux_mod_v_main_~y~0_44_22 1))))) (<= 0 main_~b~0) .cse3 (= (mod main_~x~0 2) 0)) (and (= main_~y~0 (div main_~b~0 2)) .cse4 (= (* main_~a~0 2) main_~x~0) .cse5 .cse3) (and .cse4 (= main_~b~0 main_~y~0) (<= 1 main_~y~0) .cse3 (= main_~a~0 main_~x~0)) (and .cse4 .cse5 (< 0 (+ main_~y~0 1)) (<= (* main_~y~0 2) 3) .cse3) (and (<= 0 main_~y~0) .cse4 (<= main_~y~0 4) (= .cse0 1) .cse5 .cse3))) [2022-04-14 17:33:35,954 INFO L878 garLoopResultBuilder]: At program point L34-3(lines 34 45) the Hoare annotation is: (let ((.cse0 (* main_~b~0 main_~a~0))) (and (= main_~z~0 .cse0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) .cse0) (<= 1 main_~b~0))) [2022-04-14 17:33:35,954 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 20 49) the Hoare annotation is: true [2022-04-14 17:33:35,954 INFO L882 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-14 17:33:35,954 INFO L882 garLoopResultBuilder]: For program point L39(lines 39 42) no Hoare annotation was computed. [2022-04-14 17:33:35,954 INFO L882 garLoopResultBuilder]: For program point L39-2(lines 39 42) no Hoare annotation was computed. [2022-04-14 17:33:35,954 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse3 (* main_~b~0 main_~a~0))) (let ((.cse5 (+ main_~y~0 1)) (.cse0 (= (+ main_~z~0 (* main_~y~0 main_~x~0)) .cse3)) (.cse4 (mod main_~y~0 2)) (.cse1 (<= 1 main_~b~0)) (.cse2 (<= main_~b~0 10))) (or (and (= main_~y~0 (div main_~b~0 2)) .cse0 (= (* main_~a~0 2) main_~x~0) .cse1 .cse2) (and .cse0 (= main_~b~0 main_~y~0) (<= 1 main_~y~0) .cse2 (= main_~a~0 main_~x~0)) (and (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) .cse3) (or (not (<= 1 .cse4)) (= (mod (div (+ (- 1) main_~y~0) 2) 2) 1)) (<= (div (+ (- 2) (* (- 1) (div (* (- 1) (div main_~y~0 2)) (- 2)))) (- 2)) 2) .cse1 .cse2 (= (mod main_~x~0 2) 0) (< (div (* (- 1) (div (+ (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) 1) (- 2))) (- 2)) .cse5)) (and .cse0 .cse1 (< 0 .cse5) (<= (* main_~y~0 2) 3) .cse2) (and (<= 0 main_~y~0) .cse0 (<= main_~y~0 4) (= .cse4 1) .cse1 .cse2)))) [2022-04-14 17:33:35,954 INFO L882 garLoopResultBuilder]: For program point L35-1(lines 34 45) no Hoare annotation was computed. [2022-04-14 17:33:35,954 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-14 17:33:35,954 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-14 17:33:35,954 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-14 17:33:35,954 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-14 17:33:35,955 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-14 17:33:35,955 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-14 17:33:35,955 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-14 17:33:35,955 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 12 18) the Hoare annotation is: true [2022-04-14 17:33:35,955 INFO L882 garLoopResultBuilder]: For program point L14(lines 14 15) no Hoare annotation was computed. [2022-04-14 17:33:35,955 INFO L882 garLoopResultBuilder]: For program point L13(lines 13 16) no Hoare annotation was computed. [2022-04-14 17:33:35,955 INFO L882 garLoopResultBuilder]: For program point L13-2(lines 12 18) no Hoare annotation was computed. [2022-04-14 17:33:35,955 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 12 18) no Hoare annotation was computed. [2022-04-14 17:33:35,955 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2022-04-14 17:33:35,957 INFO L719 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2022-04-14 17:33:35,958 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 17:33:35,972 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-14 17:33:35,972 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 17:33:35,973 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-14 17:33:35,973 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-14 17:33:35,973 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-14 17:33:35,973 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 17:33:35,973 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 17:33:35,973 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-14 17:33:35,973 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-14 17:33:35,973 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-14 17:33:35,973 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-14 17:33:35,973 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-14 17:33:35,973 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-14 17:33:35,973 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 17:33:35,973 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-14 17:33:35,973 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-14 17:33:35,973 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-14 17:33:35,973 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-14 17:33:35,973 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-14 17:33:35,973 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-14 17:33:35,973 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-14 17:33:35,973 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-14 17:33:35,973 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 17:33:35,973 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 17:33:35,974 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-14 17:33:35,974 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-14 17:33:35,974 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-14 17:33:35,974 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-14 17:33:35,974 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-14 17:33:36,079 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-14 17:33:36,079 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-14 17:33:36,079 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-14 17:33:36,079 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-14 17:33:36,079 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-14 17:33:36,079 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-04-14 17:33:36,079 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-14 17:33:36,079 INFO L163 areAnnotationChecker]: CFG has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-14 17:33:36,084 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,085 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,085 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,085 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,085 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,085 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,086 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,086 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,086 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,091 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,091 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,091 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,092 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,092 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,092 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,092 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,092 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,092 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 05:33:36 BoogieIcfgContainer [2022-04-14 17:33:36,093 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 17:33:36,094 INFO L158 Benchmark]: Toolchain (without parser) took 459125.42ms. Allocated memory was 176.2MB in the beginning and 223.3MB in the end (delta: 47.2MB). Free memory was 123.6MB in the beginning and 172.1MB in the end (delta: -48.4MB). Peak memory consumption was 106.2MB. Max. memory is 8.0GB. [2022-04-14 17:33:36,094 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 176.2MB. Free memory was 139.9MB in the beginning and 139.8MB in the end (delta: 70.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 17:33:36,095 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.97ms. Allocated memory was 176.2MB in the beginning and 223.3MB in the end (delta: 47.2MB). Free memory was 123.4MB in the beginning and 198.0MB in the end (delta: -74.6MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. [2022-04-14 17:33:36,095 INFO L158 Benchmark]: Boogie Preprocessor took 27.32ms. Allocated memory is still 223.3MB. Free memory was 198.0MB in the beginning and 196.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 17:33:36,095 INFO L158 Benchmark]: RCFGBuilder took 293.34ms. Allocated memory is still 223.3MB. Free memory was 196.6MB in the beginning and 184.7MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-14 17:33:36,095 INFO L158 Benchmark]: TraceAbstraction took 458589.55ms. Allocated memory is still 223.3MB. Free memory was 184.4MB in the beginning and 172.1MB in the end (delta: 12.3MB). Peak memory consumption was 118.5MB. Max. memory is 8.0GB. [2022-04-14 17:33:36,097 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.12ms. Allocated memory is still 176.2MB. Free memory was 139.9MB in the beginning and 139.8MB in the end (delta: 70.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 210.97ms. Allocated memory was 176.2MB in the beginning and 223.3MB in the end (delta: 47.2MB). Free memory was 123.4MB in the beginning and 198.0MB in the end (delta: -74.6MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.32ms. Allocated memory is still 223.3MB. Free memory was 198.0MB in the beginning and 196.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 293.34ms. Allocated memory is still 223.3MB. Free memory was 196.6MB in the beginning and 184.7MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 458589.55ms. Allocated memory is still 223.3MB. Free memory was 184.4MB in the beginning and 172.1MB in the end (delta: 12.3MB). Peak memory consumption was 118.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~y~0_44_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~y~0_44_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~y~0_44_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~y~0_44_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~y~0_44_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~y~0_44_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] * 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 - PositiveResult [Line: 15]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 458.4s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 143.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 26.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 9 mSolverCounterUnknown, 240 SdHoareTripleChecker+Valid, 35.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 227 mSDsluCounter, 1207 SdHoareTripleChecker+Invalid, 35.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 47 IncrementalHoareTripleChecker+Unchecked, 981 mSDsCounter, 155 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1350 IncrementalHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 155 mSolverCounterUnsat, 226 mSDtfsCounter, 1350 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 636 GetRequests, 464 SyntacticMatches, 15 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 68.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=7, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 31 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 34 PreInvPairs, 61 NumberOfFragments, 432 HoareAnnotationTreeSize, 34 FomulaSimplifications, 173 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 12 FomulaSimplificationsInter, 2064 FormulaSimplificationTreeSizeReductionInter, 26.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 277.2s InterpolantComputationTime, 363 NumberOfCodeBlocks, 363 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 576 ConstructedInterpolants, 4 QuantifiedInterpolants, 3033 SizeOfPredicates, 30 NumberOfNonLiveVariables, 948 ConjunctsInSsa, 149 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 295/381 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant [2022-04-14 17:33:36,102 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,102 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,102 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,102 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,103 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,103 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,103 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,103 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,103 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,104 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,104 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,104 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,104 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,104 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,104 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,104 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,104 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~y~0_44_22,QUANTIFIED] [2022-04-14 17:33:36,105 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_v_main_~y~0_44_22,QUANTIFIED] Derived loop invariant: ((((((((((!(1 <= y % 2) || (-1 + y) / 2 % 2 == 1) && !(b == 0)) && (-2 + -1 * (-1 * (y / 2) / -2)) / -2 <= 2) && (\exists aux_mod_v_main_~y~0_44_22 : int, aux_div_v_main_~y~0_44_22 : int :: ((((!(aux_mod_v_main_~y~0_44_22 == 1) && (aux_div_v_main_~y~0_44_22 * 2 + aux_mod_v_main_~y~0_44_22) / 2 == y) && z + -1 * x / -2 * aux_div_v_main_~y~0_44_22 * 2 + -1 * x / -2 * aux_mod_v_main_~y~0_44_22 == b * a) && aux_mod_v_main_~y~0_44_22 < 2) && 0 <= aux_mod_v_main_~y~0_44_22) && (-1 * ((2 + -1 * b) / -2) + 1) / -2 < aux_div_v_main_~y~0_44_22 * 2 + aux_mod_v_main_~y~0_44_22 + 1)) && 0 <= b) && b <= 10) && x % 2 == 0) || ((((y == b / 2 && z + y * x == b * a) && a * 2 == x) && 1 <= b) && b <= 10)) || ((((z + y * x == b * a && b == y) && 1 <= y) && b <= 10) && a == x)) || ((((z + y * x == b * a && 1 <= b) && 0 < y + 1) && y * 2 <= 3) && b <= 10)) || (((((0 <= y && z + y * x == b * a) && y <= 4) && y % 2 == 1) && 1 <= b) && b <= 10) RESULT: Ultimate proved your program to be correct! [2022-04-14 17:33:36,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...