/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-34549b5 [2022-04-07 15:12:30,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 15:12:30,295 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 15:12:30,323 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 15:12:30,324 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 15:12:30,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 15:12:30,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 15:12:30,329 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 15:12:30,330 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 15:12:30,333 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 15:12:30,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 15:12:30,334 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 15:12:30,334 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 15:12:30,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 15:12:30,335 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 15:12:30,335 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 15:12:30,336 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 15:12:30,336 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 15:12:30,337 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 15:12:30,338 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 15:12:30,339 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 15:12:30,340 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 15:12:30,342 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 15:12:30,343 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 15:12:30,344 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 15:12:30,352 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 15:12:30,352 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 15:12:30,352 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 15:12:30,352 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 15:12:30,353 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 15:12:30,354 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 15:12:30,354 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 15:12:30,355 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 15:12:30,355 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 15:12:30,356 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 15:12:30,356 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 15:12:30,356 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 15:12:30,357 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 15:12:30,357 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 15:12:30,357 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 15:12:30,357 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 15:12:30,359 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 15:12:30,359 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-07 15:12:30,380 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 15:12:30,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 15:12:30,380 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 15:12:30,380 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 15:12:30,381 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 15:12:30,381 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 15:12:30,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 15:12:30,381 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 15:12:30,382 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 15:12:30,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 15:12:30,382 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 15:12:30,382 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 15:12:30,382 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 15:12:30,382 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 15:12:30,382 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 15:12:30,383 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 15:12:30,383 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 15:12:30,383 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 15:12:30,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 15:12:30,384 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 15:12:30,384 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 15:12:30,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 15:12:30,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 15:12:30,384 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 15:12:30,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 15:12:30,384 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 15:12:30,384 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 15:12:30,384 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 15:12:30,384 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 15:12:30,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 15:12:30,385 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 15:12:30,385 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 15:12:30,385 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 15:12:30,385 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-07 15:12:30,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 15:12:30,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 15:12:30,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 15:12:30,571 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 15:12:30,571 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 15:12:30,572 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-07 15:12:30,617 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b8341e3c/08bc997e49724d62b7bdcc14b4792476/FLAG61459a1b5 [2022-04-07 15:12:30,964 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 15:12:30,965 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound10.c [2022-04-07 15:12:30,968 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b8341e3c/08bc997e49724d62b7bdcc14b4792476/FLAG61459a1b5 [2022-04-07 15:12:30,976 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b8341e3c/08bc997e49724d62b7bdcc14b4792476 [2022-04-07 15:12:30,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 15:12:30,978 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 15:12:30,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 15:12:30,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 15:12:30,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 15:12:30,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 03:12:30" (1/1) ... [2022-04-07 15:12:30,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@516dc5fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:12:30, skipping insertion in model container [2022-04-07 15:12:30,983 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 03:12:30" (1/1) ... [2022-04-07 15:12:30,987 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 15:12:30,994 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 15:12:31,106 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-07 15:12:31,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 15:12:31,132 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 15:12:31,139 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-07 15:12:31,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 15:12:31,151 INFO L208 MainTranslator]: Completed translation [2022-04-07 15:12:31,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:12:31 WrapperNode [2022-04-07 15:12:31,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 15:12:31,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 15:12:31,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 15:12:31,152 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 15:12:31,158 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:12:31" (1/1) ... [2022-04-07 15:12:31,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:12:31" (1/1) ... [2022-04-07 15:12:31,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:12:31" (1/1) ... [2022-04-07 15:12:31,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:12:31" (1/1) ... [2022-04-07 15:12:31,166 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:12:31" (1/1) ... [2022-04-07 15:12:31,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:12:31" (1/1) ... [2022-04-07 15:12:31,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:12:31" (1/1) ... [2022-04-07 15:12:31,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 15:12:31,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 15:12:31,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 15:12:31,170 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 15:12:31,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:12:31" (1/1) ... [2022-04-07 15:12:31,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 15:12:31,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:12:31,189 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-07 15:12:31,204 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-07 15:12:31,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 15:12:31,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 15:12:31,220 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 15:12:31,220 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 15:12:31,222 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 15:12:31,222 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 15:12:31,222 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 15:12:31,222 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 15:12:31,223 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 15:12:31,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 15:12:31,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 15:12:31,223 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 15:12:31,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 15:12:31,223 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 15:12:31,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 15:12:31,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 15:12:31,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 15:12:31,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 15:12:31,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 15:12:31,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 15:12:31,261 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 15:12:31,262 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 15:12:31,418 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 15:12:31,436 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 15:12:31,436 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 15:12:31,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 03:12:31 BoogieIcfgContainer [2022-04-07 15:12:31,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 15:12:31,438 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 15:12:31,438 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 15:12:31,440 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 15:12:31,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 03:12:30" (1/3) ... [2022-04-07 15:12:31,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182c6124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 03:12:31, skipping insertion in model container [2022-04-07 15:12:31,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:12:31" (2/3) ... [2022-04-07 15:12:31,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182c6124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 03:12:31, skipping insertion in model container [2022-04-07 15:12:31,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 03:12:31" (3/3) ... [2022-04-07 15:12:31,442 INFO L111 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound10.c [2022-04-07 15:12:31,445 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 15:12:31,445 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 15:12:31,504 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 15:12:31,512 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-07 15:12:31,513 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 15:12:31,539 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-07 15:12:31,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 15:12:31,545 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:12:31,545 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-07 15:12:31,546 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:12:31,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:12:31,552 INFO L85 PathProgramCache]: Analyzing trace with hash -589322634, now seen corresponding path program 1 times [2022-04-07 15:12:31,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:12:31,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193957570] [2022-04-07 15:12:31,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:12:31,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:12:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:12:31,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 15:12:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:12:31,723 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-07 15:12:31,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-07 15:12:31,723 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2022-04-07 15:12:31,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 15:12:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:12:31,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 15:12:31,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 15:12:31,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 15:12:31,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-07 15:12:31,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 15:12:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:12:31,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 15:12:31,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 15:12:31,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 15:12:31,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-07 15:12:31,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 15:12:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:12:31,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 15:12:31,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 15:12:31,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 15:12:31,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-07 15:12:31,764 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-07 15:12:31,765 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-07 15:12:31,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-07 15:12:31,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2022-04-07 15:12:31,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret6 := main(); {35#true} is VALID [2022-04-07 15:12:31,765 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-07 15:12:31,766 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-07 15:12:31,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 15:12:31,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 15:12:31,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 15:12:31,768 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-07 15:12:31,768 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-07 15:12:31,768 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-07 15:12:31,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 15:12:31,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 15:12:31,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 15:12:31,770 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-07 15:12:31,770 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-07 15:12:31,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 15:12:31,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 15:12:31,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 15:12:31,772 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-07 15:12:31,772 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-07 15:12:31,772 INFO L290 TraceCheckUtils]: 23: Hoare triple {36#false} assume false; {36#false} is VALID [2022-04-07 15:12:31,772 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-07 15:12:31,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-07 15:12:31,773 INFO L290 TraceCheckUtils]: 26: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-07 15:12:31,774 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-07 15:12:31,774 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-07 15:12:31,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:12:31,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193957570] [2022-04-07 15:12:31,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193957570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 15:12:31,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 15:12:31,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 15:12:31,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752317280] [2022-04-07 15:12:31,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 15:12:31,782 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-07 15:12:31,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:12:31,786 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-07 15:12:31,817 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-07 15:12:31,817 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 15:12:31,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:12:31,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 15:12:31,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 15:12:31,836 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-07 15:12:31,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:12:31,949 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2022-04-07 15:12:31,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 15:12:31,949 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-07 15:12:31,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:12:31,950 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-07 15:12:31,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-07 15:12:31,964 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-07 15:12:31,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-07 15:12:31,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2022-04-07 15:12:32,055 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-07 15:12:32,067 INFO L225 Difference]: With dead ends: 57 [2022-04-07 15:12:32,067 INFO L226 Difference]: Without dead ends: 27 [2022-04-07 15:12:32,070 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-07 15:12:32,074 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-07 15:12:32,075 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-07 15:12:32,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-07 15:12:32,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-07 15:12:32,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:12:32,100 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-07 15:12:32,101 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-07 15:12:32,101 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-07 15:12:32,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:12:32,104 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-07 15:12:32,104 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-07 15:12:32,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:12:32,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:12:32,105 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-07 15:12:32,106 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-07 15:12:32,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:12:32,110 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-07 15:12:32,110 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-07 15:12:32,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:12:32,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:12:32,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:12:32,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:12:32,112 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-07 15:12:32,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-07 15:12:32,121 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 28 [2022-04-07 15:12:32,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:12:32,121 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-07 15:12:32,122 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-07 15:12:32,122 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-07 15:12:32,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 15:12:32,123 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:12:32,123 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-07 15:12:32,123 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 15:12:32,124 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:12:32,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:12:32,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1736242504, now seen corresponding path program 1 times [2022-04-07 15:12:32,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:12:32,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338174338] [2022-04-07 15:12:32,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:12:32,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:12:32,150 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:12:32,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1846438253] [2022-04-07 15:12:32,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:12:32,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:12:32,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:12:32,154 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-07 15:12:32,155 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-07 15:12:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:12:32,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 15:12:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:12:32,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:12:32,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {224#true} call ULTIMATE.init(); {224#true} is VALID [2022-04-07 15:12:32,388 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-07 15:12:32,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-07 15:12:32,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {224#true} {224#true} #71#return; {224#true} is VALID [2022-04-07 15:12:32,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {224#true} call #t~ret6 := main(); {224#true} is VALID [2022-04-07 15:12:32,391 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-07 15:12:32,392 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-07 15:12:32,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-07 15:12:32,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-07 15:12:32,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-07 15:12:32,394 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {224#true} {224#true} #61#return; {224#true} is VALID [2022-04-07 15:12:32,394 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-07 15:12:32,395 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-07 15:12:32,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-07 15:12:32,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-07 15:12:32,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-07 15:12:32,396 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {224#true} {224#true} #63#return; {224#true} is VALID [2022-04-07 15:12:32,396 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-07 15:12:32,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-07 15:12:32,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-07 15:12:32,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-07 15:12:32,397 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {224#true} {224#true} #65#return; {224#true} is VALID [2022-04-07 15:12:32,397 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-07 15:12:32,398 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-07 15:12:32,399 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-07 15:12:32,399 INFO L290 TraceCheckUtils]: 25: Hoare triple {302#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {306#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:12:32,400 INFO L290 TraceCheckUtils]: 26: Hoare triple {306#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {225#false} is VALID [2022-04-07 15:12:32,400 INFO L290 TraceCheckUtils]: 27: Hoare triple {225#false} assume !false; {225#false} is VALID [2022-04-07 15:12:32,400 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-07 15:12:32,400 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 15:12:32,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:12:32,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338174338] [2022-04-07 15:12:32,401 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:12:32,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846438253] [2022-04-07 15:12:32,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846438253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 15:12:32,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 15:12:32,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 15:12:32,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812128118] [2022-04-07 15:12:32,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 15:12:32,402 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-07 15:12:32,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:12:32,403 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-07 15:12:32,416 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-07 15:12:32,416 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 15:12:32,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:12:32,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 15:12:32,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 15:12:32,417 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-07 15:12:32,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:12:32,522 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-07 15:12:32,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 15:12:32,523 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-07 15:12:32,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:12:32,523 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-07 15:12:32,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-07 15:12:32,524 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-07 15:12:32,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-07 15:12:32,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-04-07 15:12:32,554 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-07 15:12:32,556 INFO L225 Difference]: With dead ends: 39 [2022-04-07 15:12:32,556 INFO L226 Difference]: Without dead ends: 37 [2022-04-07 15:12:32,556 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-07 15:12:32,557 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-07 15:12:32,557 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-07 15:12:32,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-07 15:12:32,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-04-07 15:12:32,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:12:32,562 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-07 15:12:32,562 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-07 15:12:32,562 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-07 15:12:32,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:12:32,564 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-07 15:12:32,564 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-07 15:12:32,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:12:32,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:12:32,565 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-07 15:12:32,565 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-07 15:12:32,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:12:32,567 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-07 15:12:32,567 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-07 15:12:32,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:12:32,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:12:32,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:12:32,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:12:32,568 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-07 15:12:32,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-07 15:12:32,569 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2022-04-07 15:12:32,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:12:32,570 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-07 15:12:32,570 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-07 15:12:32,570 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-07 15:12:32,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-07 15:12:32,571 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:12:32,571 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-07 15:12:32,591 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-07 15:12:32,787 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-07 15:12:32,788 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:12:32,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:12:32,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1911690432, now seen corresponding path program 1 times [2022-04-07 15:12:32,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:12:32,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729413060] [2022-04-07 15:12:32,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:12:32,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:12:32,804 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:12:32,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1721976585] [2022-04-07 15:12:32,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:12:32,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:12:32,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:12:32,814 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-07 15:12:32,815 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-07 15:12:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:12:32,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 15:12:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:12:32,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:12:32,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {491#true} call ULTIMATE.init(); {491#true} is VALID [2022-04-07 15:12:32,983 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-07 15:12:32,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-07 15:12:32,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {491#true} {491#true} #71#return; {491#true} is VALID [2022-04-07 15:12:32,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {491#true} call #t~ret6 := main(); {491#true} is VALID [2022-04-07 15:12:32,983 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-07 15:12:32,983 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-07 15:12:32,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-07 15:12:32,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-07 15:12:32,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-07 15:12:32,984 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {491#true} {491#true} #61#return; {491#true} is VALID [2022-04-07 15:12:32,984 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-07 15:12:32,984 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-07 15:12:32,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-07 15:12:32,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-07 15:12:32,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-07 15:12:32,985 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {491#true} {491#true} #63#return; {491#true} is VALID [2022-04-07 15:12:32,985 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-07 15:12:32,985 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-07 15:12:32,986 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-07 15:12:32,986 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-07 15:12:32,987 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-07 15:12:32,987 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-07 15:12:32,987 INFO L290 TraceCheckUtils]: 23: Hoare triple {565#(<= 1 main_~y~0)} assume !false; {565#(<= 1 main_~y~0)} is VALID [2022-04-07 15:12:32,987 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-07 15:12:32,988 INFO L290 TraceCheckUtils]: 25: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-07 15:12:32,988 INFO L290 TraceCheckUtils]: 26: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-07 15:12:32,988 INFO L290 TraceCheckUtils]: 27: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-07 15:12:32,989 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {491#true} {565#(<= 1 main_~y~0)} #67#return; {565#(<= 1 main_~y~0)} is VALID [2022-04-07 15:12:32,989 INFO L290 TraceCheckUtils]: 29: Hoare triple {565#(<= 1 main_~y~0)} assume !(0 != ~y~0); {492#false} is VALID [2022-04-07 15:12:32,989 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-07 15:12:32,989 INFO L290 TraceCheckUtils]: 31: Hoare triple {492#false} ~cond := #in~cond; {492#false} is VALID [2022-04-07 15:12:32,989 INFO L290 TraceCheckUtils]: 32: Hoare triple {492#false} assume 0 == ~cond; {492#false} is VALID [2022-04-07 15:12:32,989 INFO L290 TraceCheckUtils]: 33: Hoare triple {492#false} assume !false; {492#false} is VALID [2022-04-07 15:12:32,990 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-07 15:12:32,990 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 15:12:32,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:12:32,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729413060] [2022-04-07 15:12:32,990 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:12:32,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721976585] [2022-04-07 15:12:32,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721976585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 15:12:32,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 15:12:32,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 15:12:32,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148677409] [2022-04-07 15:12:32,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 15:12:32,991 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-07 15:12:32,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:12:32,992 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-07 15:12:33,012 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-07 15:12:33,012 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 15:12:33,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:12:33,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 15:12:33,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 15:12:33,013 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-07 15:12:33,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:12:33,165 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-07 15:12:33,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 15:12:33,165 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-07 15:12:33,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:12:33,166 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-07 15:12:33,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-07 15:12:33,167 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-07 15:12:33,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-07 15:12:33,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-07 15:12:33,201 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-07 15:12:33,202 INFO L225 Difference]: With dead ends: 43 [2022-04-07 15:12:33,202 INFO L226 Difference]: Without dead ends: 36 [2022-04-07 15:12:33,202 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-07 15:12:33,203 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-07 15:12:33,203 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.0s Time] [2022-04-07 15:12:33,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-07 15:12:33,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2022-04-07 15:12:33,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:12:33,210 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-07 15:12:33,210 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-07 15:12:33,211 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-07 15:12:33,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:12:33,212 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-07 15:12:33,212 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-07 15:12:33,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:12:33,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:12:33,213 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-07 15:12:33,213 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-07 15:12:33,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:12:33,215 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-07 15:12:33,215 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-07 15:12:33,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:12:33,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:12:33,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:12:33,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:12:33,216 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-07 15:12:33,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-07 15:12:33,217 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 34 [2022-04-07 15:12:33,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:12:33,217 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-07 15:12:33,217 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-07 15:12:33,218 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-07 15:12:33,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-07 15:12:33,218 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:12:33,218 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-07 15:12:33,238 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-07 15:12:33,438 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-07 15:12:33,438 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:12:33,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:12:33,439 INFO L85 PathProgramCache]: Analyzing trace with hash 2022075506, now seen corresponding path program 1 times [2022-04-07 15:12:33,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:12:33,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986581885] [2022-04-07 15:12:33,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:12:33,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:12:33,454 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:12:33,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1153992163] [2022-04-07 15:12:33,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:12:33,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:12:33,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:12:33,467 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-07 15:12:33,471 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-07 15:12:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:12:33,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-07 15:12:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:12:33,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:12:38,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {783#true} is VALID [2022-04-07 15:12:38,866 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-07 15:12:38,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:12:38,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #71#return; {783#true} is VALID [2022-04-07 15:12:38,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret6 := main(); {783#true} is VALID [2022-04-07 15:12:38,866 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-07 15:12:38,866 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-07 15:12:38,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-07 15:12:38,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-07 15:12:38,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:12:38,867 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {783#true} {783#true} #61#return; {783#true} is VALID [2022-04-07 15:12:38,867 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-07 15:12:38,867 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-07 15:12:38,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-07 15:12:38,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-07 15:12:38,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:12:38,868 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {783#true} {783#true} #63#return; {783#true} is VALID [2022-04-07 15:12:38,868 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-07 15:12:38,868 INFO L290 TraceCheckUtils]: 18: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-07 15:12:38,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-07 15:12:38,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:12:38,868 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {783#true} {783#true} #65#return; {783#true} is VALID [2022-04-07 15:12:38,875 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-07 15:12:38,876 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-07 15:12:38,876 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-07 15:12:38,876 INFO L290 TraceCheckUtils]: 25: Hoare triple {783#true} ~cond := #in~cond; {864#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:12:38,876 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-07 15:12:38,877 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-07 15:12:38,878 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-07 15:12:38,878 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-07 15:12:38,879 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-07 15:12:38,884 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-07 15:12:38,884 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-07 15:12:39,211 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-07 15:12:39,212 INFO L290 TraceCheckUtils]: 34: Hoare triple {893#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {897#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:12:39,212 INFO L290 TraceCheckUtils]: 35: Hoare triple {897#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {784#false} is VALID [2022-04-07 15:12:39,212 INFO L290 TraceCheckUtils]: 36: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-04-07 15:12:39,213 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-07 15:12:39,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:13:41,263 INFO L290 TraceCheckUtils]: 36: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-04-07 15:13:41,263 INFO L290 TraceCheckUtils]: 35: Hoare triple {897#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {784#false} is VALID [2022-04-07 15:13:41,264 INFO L290 TraceCheckUtils]: 34: Hoare triple {893#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {897#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:13:41,265 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-07 15:13:41,265 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-07 15:13:41,269 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-07 15:13:41,271 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-07 15:13:41,272 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-07 15:13:41,528 INFO 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 VALID [2022-04-07 15:13:41,529 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-07 15:13:41,529 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-07 15:13:41,530 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-07 15:13:41,530 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-07 15:13:41,530 INFO L290 TraceCheckUtils]: 23: Hoare triple {783#true} assume !false; {783#true} is VALID [2022-04-07 15:13:41,530 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-07 15:13:41,530 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {783#true} {783#true} #65#return; {783#true} is VALID [2022-04-07 15:13:41,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:13:41,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-07 15:13:41,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-07 15:13:41,531 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-07 15:13:41,531 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {783#true} {783#true} #63#return; {783#true} is VALID [2022-04-07 15:13:41,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:13:41,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-07 15:13:41,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-07 15:13:41,531 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-07 15:13:41,531 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-07 15:13:41,532 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {783#true} {783#true} #61#return; {783#true} is VALID [2022-04-07 15:13:41,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:13:41,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-07 15:13:41,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-07 15:13:41,532 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-07 15:13:41,532 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-07 15:13:41,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret6 := main(); {783#true} is VALID [2022-04-07 15:13:41,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #71#return; {783#true} is VALID [2022-04-07 15:13:41,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:13:41,533 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-07 15:13:41,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {783#true} is VALID [2022-04-07 15:13:41,533 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-07 15:13:41,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:13:41,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986581885] [2022-04-07 15:13:41,533 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:13:41,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153992163] [2022-04-07 15:13:41,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153992163] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 15:13:41,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 15:13:41,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2022-04-07 15:13:41,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439271856] [2022-04-07 15:13:41,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 15:13:41,534 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-07 15:13:41,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:13:41,535 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-07 15:13:43,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:13:43,751 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 15:13:43,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:13:43,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 15:13:43,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-07 15:13:43,752 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-07 15:13:52,151 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:14:02,901 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-07 15:14:05,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:14:05,624 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-04-07 15:14:05,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 15:14:05,624 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-07 15:14:05,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:14:05,625 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-07 15:14:05,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2022-04-07 15:14:05,626 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-07 15:14:05,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2022-04-07 15:14:05,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 57 transitions. [2022-04-07 15:14:08,052 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-07 15:14:08,053 INFO L225 Difference]: With dead ends: 52 [2022-04-07 15:14:08,053 INFO L226 Difference]: Without dead ends: 50 [2022-04-07 15:14:08,054 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-04-07 15:14:08,054 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 28 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-04-07 15:14:08,058 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 151 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 169 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2022-04-07 15:14:08,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-07 15:14:08,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2022-04-07 15:14:08,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:14:08,082 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-07 15:14:08,082 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-07 15:14:08,082 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-07 15:14:08,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:14:08,084 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-04-07 15:14:08,084 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-04-07 15:14:08,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:14:08,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:14:08,085 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-07 15:14:08,085 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-07 15:14:08,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:14:08,086 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-04-07 15:14:08,087 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-04-07 15:14:08,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:14:08,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:14:08,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:14:08,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:14:08,087 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-07 15:14:08,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-04-07 15:14:08,092 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 37 [2022-04-07 15:14:08,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:14:08,092 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-04-07 15:14:08,092 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-07 15:14:08,092 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-07 15:14:08,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-07 15:14:08,093 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:14:08,093 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-07 15:14:08,109 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-07 15:14:08,293 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-07 15:14:08,294 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:14:08,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:14:08,294 INFO L85 PathProgramCache]: Analyzing trace with hash -497884428, now seen corresponding path program 1 times [2022-04-07 15:14:08,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:14:08,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419787128] [2022-04-07 15:14:08,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:14:08,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:14:08,306 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:14:08,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [631690773] [2022-04-07 15:14:08,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:14:08,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:14:08,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:14:08,311 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-07 15:14:08,312 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-07 15:14:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:14:08,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-07 15:14:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:14:08,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:14:09,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {1258#true} call ULTIMATE.init(); {1258#true} is VALID [2022-04-07 15:14:09,165 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-07 15:14:09,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {1258#true} assume true; {1258#true} is VALID [2022-04-07 15:14:09,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1258#true} {1258#true} #71#return; {1258#true} is VALID [2022-04-07 15:14:09,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {1258#true} call #t~ret6 := main(); {1258#true} is VALID [2022-04-07 15:14:09,165 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-07 15:14:09,165 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-07 15:14:09,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {1258#true} ~cond := #in~cond; {1258#true} is VALID [2022-04-07 15:14:09,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {1258#true} assume !(0 == ~cond); {1258#true} is VALID [2022-04-07 15:14:09,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {1258#true} assume true; {1258#true} is VALID [2022-04-07 15:14:09,166 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1258#true} {1258#true} #61#return; {1258#true} is VALID [2022-04-07 15:14:09,166 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-07 15:14:09,166 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-07 15:14:09,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {1258#true} ~cond := #in~cond; {1258#true} is VALID [2022-04-07 15:14:09,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {1258#true} assume !(0 == ~cond); {1258#true} is VALID [2022-04-07 15:14:09,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {1258#true} assume true; {1258#true} is VALID [2022-04-07 15:14:09,166 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1258#true} {1258#true} #63#return; {1258#true} is VALID [2022-04-07 15:14:09,167 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-07 15:14:09,167 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-07 15:14:09,167 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-07 15:14:09,168 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-07 15:14:09,168 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-07 15:14:09,169 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-07 15:14:09,169 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-07 15:14:09,169 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-07 15:14:09,170 INFO L290 TraceCheckUtils]: 25: Hoare triple {1258#true} ~cond := #in~cond; {1342#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:14:09,170 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-07 15:14:09,170 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-07 15:14:09,171 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-07 15:14:09,171 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-07 15:14:09,172 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-07 15:14:09,172 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-07 15:14:09,173 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-07 15:14:09,175 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-07 15:14:09,175 INFO L290 TraceCheckUtils]: 34: Hoare triple {1370#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1374#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:14:09,175 INFO L290 TraceCheckUtils]: 35: Hoare triple {1374#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1259#false} is VALID [2022-04-07 15:14:09,175 INFO L290 TraceCheckUtils]: 36: Hoare triple {1259#false} assume !false; {1259#false} is VALID [2022-04-07 15:14:09,176 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-07 15:14:09,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:14:56,022 INFO L290 TraceCheckUtils]: 36: Hoare triple {1259#false} assume !false; {1259#false} is VALID [2022-04-07 15:14:56,022 INFO L290 TraceCheckUtils]: 35: Hoare triple {1374#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1259#false} is VALID [2022-04-07 15:14:56,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {1370#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1374#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:14:56,024 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-07 15:14:56,024 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-07 15:14:56,028 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-07 15:14:56,029 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-07 15:14:56,030 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-07 15:14:56,032 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-07 15:14:56,033 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-07 15:14:56,033 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-07 15:14:56,033 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-07 15:14:56,033 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-07 15:14:56,034 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-07 15:14:56,034 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-07 15:14:56,035 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-07 15:14:56,036 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-07 15:14:56,036 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-07 15:14:56,036 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-07 15:14:56,037 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-07 15:14:56,037 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1258#true} {1258#true} #63#return; {1258#true} is VALID [2022-04-07 15:14:56,037 INFO L290 TraceCheckUtils]: 15: Hoare triple {1258#true} assume true; {1258#true} is VALID [2022-04-07 15:14:56,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {1258#true} assume !(0 == ~cond); {1258#true} is VALID [2022-04-07 15:14:56,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {1258#true} ~cond := #in~cond; {1258#true} is VALID [2022-04-07 15:14:56,037 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-07 15:14:56,037 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-07 15:14:56,037 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1258#true} {1258#true} #61#return; {1258#true} is VALID [2022-04-07 15:14:56,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {1258#true} assume true; {1258#true} is VALID [2022-04-07 15:14:56,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {1258#true} assume !(0 == ~cond); {1258#true} is VALID [2022-04-07 15:14:56,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {1258#true} ~cond := #in~cond; {1258#true} is VALID [2022-04-07 15:14:56,038 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-07 15:14:56,038 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-07 15:14:56,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {1258#true} call #t~ret6 := main(); {1258#true} is VALID [2022-04-07 15:14:56,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1258#true} {1258#true} #71#return; {1258#true} is VALID [2022-04-07 15:14:56,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {1258#true} assume true; {1258#true} is VALID [2022-04-07 15:14:56,038 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-07 15:14:56,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {1258#true} call ULTIMATE.init(); {1258#true} is VALID [2022-04-07 15:14:56,039 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-07 15:14:56,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:14:56,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419787128] [2022-04-07 15:14:56,039 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:14:56,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631690773] [2022-04-07 15:14:56,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631690773] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 15:14:56,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 15:14:56,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 19 [2022-04-07 15:14:56,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759577763] [2022-04-07 15:14:56,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 15:14:56,040 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-07 15:14:56,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:14:56,041 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-07 15:14:56,081 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-07 15:14:56,081 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-07 15:14:56,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:14:56,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-07 15:14:56,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-04-07 15:14:56,082 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-07 15:14:57,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:14:57,956 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-04-07 15:14:57,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-07 15:14:57,956 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-07 15:14:57,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:14:57,956 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-07 15:14:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 67 transitions. [2022-04-07 15:14:57,959 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-07 15:14:57,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 67 transitions. [2022-04-07 15:14:57,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 67 transitions. [2022-04-07 15:14:58,023 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-07 15:14:58,024 INFO L225 Difference]: With dead ends: 66 [2022-04-07 15:14:58,025 INFO L226 Difference]: Without dead ends: 59 [2022-04-07 15:14:58,025 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2022-04-07 15:14:58,025 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 46 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.7s IncrementalHoareTripleChecker+Time [2022-04-07 15:14:58,026 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 139 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-07 15:14:58,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-07 15:14:58,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-07 15:14:58,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:14:58,045 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-07 15:14:58,045 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-07 15:14:58,046 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-07 15:14:58,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:14:58,047 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-07 15:14:58,047 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-07 15:14:58,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:14:58,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:14:58,048 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-07 15:14:58,048 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-07 15:14:58,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:14:58,050 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-07 15:14:58,050 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-07 15:14:58,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:14:58,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:14:58,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:14:58,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:14:58,051 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-07 15:14:58,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2022-04-07 15:14:58,052 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 37 [2022-04-07 15:14:58,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:14:58,052 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2022-04-07 15:14:58,053 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-07 15:14:58,053 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-07 15:14:58,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-07 15:14:58,053 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:14:58,053 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-07 15:14:58,073 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-07 15:14:58,265 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-07 15:14:58,266 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:14:58,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:14:58,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1351630086, now seen corresponding path program 1 times [2022-04-07 15:14:58,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:14:58,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780801819] [2022-04-07 15:14:58,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:14:58,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:14:58,278 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:14:58,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [646492806] [2022-04-07 15:14:58,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:14:58,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:14:58,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:14:58,285 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-07 15:14:58,286 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-07 15:14:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:14:58,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-07 15:14:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:14:58,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:15:08,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {1807#true} call ULTIMATE.init(); {1807#true} is VALID [2022-04-07 15:15:08,475 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-07 15:15:08,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-07 15:15:08,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1807#true} {1807#true} #71#return; {1807#true} is VALID [2022-04-07 15:15:08,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {1807#true} call #t~ret6 := main(); {1807#true} is VALID [2022-04-07 15:15:08,475 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-07 15:15:08,475 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-07 15:15:08,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {1807#true} ~cond := #in~cond; {1807#true} is VALID [2022-04-07 15:15:08,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {1807#true} assume !(0 == ~cond); {1807#true} is VALID [2022-04-07 15:15:08,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-07 15:15:08,476 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1807#true} {1807#true} #61#return; {1807#true} is VALID [2022-04-07 15:15:08,476 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-07 15:15:08,476 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-07 15:15:08,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {1807#true} ~cond := #in~cond; {1807#true} is VALID [2022-04-07 15:15:08,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {1807#true} assume !(0 == ~cond); {1807#true} is VALID [2022-04-07 15:15:08,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-07 15:15:08,476 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1807#true} {1807#true} #63#return; {1807#true} is VALID [2022-04-07 15:15:08,476 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-07 15:15:08,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {1807#true} ~cond := #in~cond; {1807#true} is VALID [2022-04-07 15:15:08,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {1807#true} assume !(0 == ~cond); {1807#true} is VALID [2022-04-07 15:15:08,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-07 15:15:08,477 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1807#true} {1807#true} #65#return; {1807#true} is VALID [2022-04-07 15:15:08,477 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-07 15:15:08,477 INFO L290 TraceCheckUtils]: 23: Hoare triple {1807#true} assume !false; {1807#true} is VALID [2022-04-07 15:15:08,477 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-07 15:15:08,477 INFO L290 TraceCheckUtils]: 25: Hoare triple {1807#true} ~cond := #in~cond; {1807#true} is VALID [2022-04-07 15:15:08,477 INFO L290 TraceCheckUtils]: 26: Hoare triple {1807#true} assume !(0 == ~cond); {1807#true} is VALID [2022-04-07 15:15:08,477 INFO L290 TraceCheckUtils]: 27: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-07 15:15:08,477 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1807#true} {1807#true} #67#return; {1807#true} is VALID [2022-04-07 15:15:08,478 INFO L290 TraceCheckUtils]: 29: Hoare triple {1807#true} assume !!(0 != ~y~0); {1807#true} is VALID [2022-04-07 15:15:08,478 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-07 15:15:08,478 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-07 15:15:08,478 INFO L290 TraceCheckUtils]: 32: Hoare triple {1807#true} assume !false; {1807#true} is VALID [2022-04-07 15:15:08,478 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-07 15:15:08,488 INFO L290 TraceCheckUtils]: 34: Hoare triple {1807#true} ~cond := #in~cond; {1914#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:15:08,488 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-07 15:15:08,488 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-07 15:15:10,491 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-07 15:15:10,491 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-07 15:15:10,492 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-07 15:15:10,492 INFO L290 TraceCheckUtils]: 40: Hoare triple {1933#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1937#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:15:10,493 INFO L290 TraceCheckUtils]: 41: Hoare triple {1937#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1808#false} is VALID [2022-04-07 15:15:10,493 INFO L290 TraceCheckUtils]: 42: Hoare triple {1808#false} assume !false; {1808#false} is VALID [2022-04-07 15:15:10,493 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-07 15:15:10,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:15:18,735 INFO L290 TraceCheckUtils]: 42: Hoare triple {1808#false} assume !false; {1808#false} is VALID [2022-04-07 15:15:18,736 INFO L290 TraceCheckUtils]: 41: Hoare triple {1937#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1808#false} is VALID [2022-04-07 15:15:18,737 INFO L290 TraceCheckUtils]: 40: Hoare triple {1933#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1937#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:15:18,737 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-07 15:15:18,738 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-07 15:15:18,739 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-07 15:15:18,739 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-07 15:15:18,740 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-07 15:15:18,740 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-07 15:15:18,740 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-07 15:15:18,740 INFO L290 TraceCheckUtils]: 32: Hoare triple {1807#true} assume !false; {1807#true} is VALID [2022-04-07 15:15:18,740 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-07 15:15:18,740 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-07 15:15:18,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {1807#true} assume !!(0 != ~y~0); {1807#true} is VALID [2022-04-07 15:15:18,741 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1807#true} {1807#true} #67#return; {1807#true} is VALID [2022-04-07 15:15:18,741 INFO L290 TraceCheckUtils]: 27: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-07 15:15:18,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {1807#true} assume !(0 == ~cond); {1807#true} is VALID [2022-04-07 15:15:18,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {1807#true} ~cond := #in~cond; {1807#true} is VALID [2022-04-07 15:15:18,741 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-07 15:15:18,741 INFO L290 TraceCheckUtils]: 23: Hoare triple {1807#true} assume !false; {1807#true} is VALID [2022-04-07 15:15:18,741 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-07 15:15:18,741 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1807#true} {1807#true} #65#return; {1807#true} is VALID [2022-04-07 15:15:18,742 INFO L290 TraceCheckUtils]: 20: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-07 15:15:18,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {1807#true} assume !(0 == ~cond); {1807#true} is VALID [2022-04-07 15:15:18,742 INFO L290 TraceCheckUtils]: 18: Hoare triple {1807#true} ~cond := #in~cond; {1807#true} is VALID [2022-04-07 15:15:18,742 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-07 15:15:18,742 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1807#true} {1807#true} #63#return; {1807#true} is VALID [2022-04-07 15:15:18,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-07 15:15:18,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {1807#true} assume !(0 == ~cond); {1807#true} is VALID [2022-04-07 15:15:18,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {1807#true} ~cond := #in~cond; {1807#true} is VALID [2022-04-07 15:15:18,742 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-07 15:15:18,742 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-07 15:15:18,742 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1807#true} {1807#true} #61#return; {1807#true} is VALID [2022-04-07 15:15:18,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-07 15:15:18,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {1807#true} assume !(0 == ~cond); {1807#true} is VALID [2022-04-07 15:15:18,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {1807#true} ~cond := #in~cond; {1807#true} is VALID [2022-04-07 15:15:18,743 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-07 15:15:18,743 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-07 15:15:18,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {1807#true} call #t~ret6 := main(); {1807#true} is VALID [2022-04-07 15:15:18,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1807#true} {1807#true} #71#return; {1807#true} is VALID [2022-04-07 15:15:18,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {1807#true} assume true; {1807#true} is VALID [2022-04-07 15:15:18,743 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-07 15:15:18,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {1807#true} call ULTIMATE.init(); {1807#true} is VALID [2022-04-07 15:15:18,744 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-07 15:15:18,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:15:18,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780801819] [2022-04-07 15:15:18,744 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:15:18,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646492806] [2022-04-07 15:15:18,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646492806] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 15:15:18,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 15:15:18,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-07 15:15:18,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175887634] [2022-04-07 15:15:18,745 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 15:15:18,745 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-07 15:15:18,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:15:18,745 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-07 15:15:20,773 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-07 15:15:20,774 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 15:15:20,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:15:20,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 15:15:20,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-07 15:15:20,774 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-07 15:15:22,823 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-07 15:15:23,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:15:23,257 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2022-04-07 15:15:23,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 15:15:23,257 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-07 15:15:23,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:15:23,258 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-07 15:15:23,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-07 15:15:23,259 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-07 15:15:23,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-07 15:15:23,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 37 transitions. [2022-04-07 15:15:25,293 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-07 15:15:25,295 INFO L225 Difference]: With dead ends: 65 [2022-04-07 15:15:25,295 INFO L226 Difference]: Without dead ends: 58 [2022-04-07 15:15:25,295 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-07 15:15:25,296 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-07 15:15:25,296 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.3s Time] [2022-04-07 15:15:25,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-07 15:15:25,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-07 15:15:25,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:15:25,322 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-07 15:15:25,322 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-07 15:15:25,322 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-07 15:15:25,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:15:25,324 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-04-07 15:15:25,324 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-04-07 15:15:25,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:15:25,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:15:25,324 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-07 15:15:25,325 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-07 15:15:25,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:15:25,327 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-04-07 15:15:25,327 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-04-07 15:15:25,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:15:25,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:15:25,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:15:25,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:15:25,327 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-07 15:15:25,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2022-04-07 15:15:25,329 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 43 [2022-04-07 15:15:25,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:15:25,329 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2022-04-07 15:15:25,330 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-07 15:15:25,330 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-04-07 15:15:25,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-07 15:15:25,331 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:15:25,331 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-07 15:15:25,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 15:15:25,539 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-07 15:15:25,540 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:15:25,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:15:25,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1494691206, now seen corresponding path program 1 times [2022-04-07 15:15:25,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:15:25,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939073228] [2022-04-07 15:15:25,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:15:25,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:15:25,552 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:15:25,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1307793088] [2022-04-07 15:15:25,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:15:25,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:15:25,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:15:25,553 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-07 15:15:25,554 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-07 15:15:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:15:25,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-07 15:15:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:15:25,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:15:53,907 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 15:16:19,853 INFO L272 TraceCheckUtils]: 0: Hoare triple {2367#true} call ULTIMATE.init(); {2367#true} is VALID [2022-04-07 15:16:19,854 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-07 15:16:19,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {2367#true} assume true; {2367#true} is VALID [2022-04-07 15:16:19,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2367#true} {2367#true} #71#return; {2367#true} is VALID [2022-04-07 15:16:19,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {2367#true} call #t~ret6 := main(); {2367#true} is VALID [2022-04-07 15:16:19,854 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-07 15:16:19,854 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-07 15:16:19,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {2367#true} ~cond := #in~cond; {2367#true} is VALID [2022-04-07 15:16:19,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {2367#true} assume !(0 == ~cond); {2367#true} is VALID [2022-04-07 15:16:19,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {2367#true} assume true; {2367#true} is VALID [2022-04-07 15:16:19,855 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2367#true} {2367#true} #61#return; {2367#true} is VALID [2022-04-07 15:16:19,855 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-07 15:16:19,855 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-07 15:16:19,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {2367#true} ~cond := #in~cond; {2367#true} is VALID [2022-04-07 15:16:19,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {2367#true} assume !(0 == ~cond); {2367#true} is VALID [2022-04-07 15:16:19,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {2367#true} assume true; {2367#true} is VALID [2022-04-07 15:16:19,855 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2367#true} {2367#true} #63#return; {2367#true} is VALID [2022-04-07 15:16:19,855 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-07 15:16:19,855 INFO L290 TraceCheckUtils]: 18: Hoare triple {2367#true} ~cond := #in~cond; {2367#true} is VALID [2022-04-07 15:16:19,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {2367#true} assume !(0 == ~cond); {2367#true} is VALID [2022-04-07 15:16:19,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {2367#true} assume true; {2367#true} is VALID [2022-04-07 15:16:19,856 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2367#true} {2367#true} #65#return; {2367#true} is VALID [2022-04-07 15:16:19,856 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-07 15:16:19,856 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-07 15:16:19,856 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-07 15:16:19,856 INFO L290 TraceCheckUtils]: 25: Hoare triple {2367#true} ~cond := #in~cond; {2367#true} is VALID [2022-04-07 15:16:19,857 INFO L290 TraceCheckUtils]: 26: Hoare triple {2367#true} assume !(0 == ~cond); {2367#true} is VALID [2022-04-07 15:16:19,857 INFO L290 TraceCheckUtils]: 27: Hoare triple {2367#true} assume true; {2367#true} is VALID [2022-04-07 15:16:19,857 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-07 15:16:19,858 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-07 15:16:19,858 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-07 15:16:19,859 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-07 15:16:19,860 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-07 15:16:19,860 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-07 15:16:19,860 INFO L290 TraceCheckUtils]: 34: Hoare triple {2367#true} ~cond := #in~cond; {2478#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:16:19,861 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-07 15:16:19,862 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-07 15:16:19,863 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-07 15:16:19,863 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-07 15:16:19,864 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-07 15:16:19,943 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-07 15:16:21,083 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-07 15:16:23,086 WARN 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 UNKNOWN [2022-04-07 15:16:23,087 INFO L290 TraceCheckUtils]: 43: Hoare triple {2508#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2512#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:16:23,087 INFO L290 TraceCheckUtils]: 44: Hoare triple {2512#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2368#false} is VALID [2022-04-07 15:16:23,087 INFO L290 TraceCheckUtils]: 45: Hoare triple {2368#false} assume !false; {2368#false} is VALID [2022-04-07 15:16:23,088 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-07 15:16:23,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:16:48,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:16:48,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939073228] [2022-04-07 15:16:48,556 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:16:48,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307793088] [2022-04-07 15:16:48,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307793088] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:16:48,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:16:48,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-07 15:16:48,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57884426] [2022-04-07 15:16:48,557 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:16:48,557 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-07 15:16:48,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:16:48,558 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-07 15:16:49,456 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-07 15:16:49,456 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 15:16:49,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:16:49,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 15:16:49,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=249, Unknown=1, NotChecked=0, Total=306 [2022-04-07 15:16:49,457 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-07 15:17:01,928 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:17:09,782 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-07 15:17:10,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:17:10,343 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2022-04-07 15:17:10,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 15:17:10,344 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-07 15:17:10,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:17:10,344 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-07 15:17:10,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-07 15:17:10,345 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-07 15:17:10,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-07 15:17:10,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 56 transitions. [2022-04-07 15:17:11,216 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-07 15:17:11,218 INFO L225 Difference]: With dead ends: 83 [2022-04-07 15:17:11,218 INFO L226 Difference]: Without dead ends: 81 [2022-04-07 15:17:11,218 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=67, Invalid=312, Unknown=1, NotChecked=0, Total=380 [2022-04-07 15:17:11,219 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-04-07 15:17:11,219 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 213 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 205 Invalid, 1 Unknown, 27 Unchecked, 7.5s Time] [2022-04-07 15:17:11,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-07 15:17:11,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 70. [2022-04-07 15:17:11,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:17:11,251 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-07 15:17:11,251 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-07 15:17:11,251 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-07 15:17:11,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:17:11,254 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2022-04-07 15:17:11,254 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2022-04-07 15:17:11,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:17:11,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:17:11,254 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-07 15:17:11,255 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-07 15:17:11,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:17:11,256 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2022-04-07 15:17:11,256 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2022-04-07 15:17:11,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:17:11,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:17:11,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:17:11,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:17:11,257 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-07 15:17:11,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2022-04-07 15:17:11,259 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 46 [2022-04-07 15:17:11,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:17:11,259 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2022-04-07 15:17:11,259 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-07 15:17:11,259 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-04-07 15:17:11,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-07 15:17:11,260 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:17:11,260 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-07 15:17:11,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-07 15:17:11,460 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-07 15:17:11,460 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:17:11,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:17:11,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1459553868, now seen corresponding path program 2 times [2022-04-07 15:17:11,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:17:11,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065909546] [2022-04-07 15:17:11,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:17:11,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:17:11,473 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:17:11,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1455353808] [2022-04-07 15:17:11,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 15:17:11,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:17:11,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:17:11,474 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-07 15:17:11,481 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-07 15:17:11,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 15:17:11,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:17:11,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-07 15:17:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:17:11,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:17:12,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {2929#true} call ULTIMATE.init(); {2929#true} is VALID [2022-04-07 15:17:12,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {2929#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); {2929#true} is VALID [2022-04-07 15:17:12,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {2929#true} assume true; {2929#true} is VALID [2022-04-07 15:17:12,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2929#true} {2929#true} #71#return; {2929#true} is VALID [2022-04-07 15:17:12,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {2929#true} call #t~ret6 := main(); {2929#true} is VALID [2022-04-07 15:17:12,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {2929#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; {2929#true} is VALID [2022-04-07 15:17:12,726 INFO L272 TraceCheckUtils]: 6: Hoare triple {2929#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {2929#true} is VALID [2022-04-07 15:17:12,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {2929#true} ~cond := #in~cond; {2929#true} is VALID [2022-04-07 15:17:12,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {2929#true} assume !(0 == ~cond); {2929#true} is VALID [2022-04-07 15:17:12,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {2929#true} assume true; {2929#true} is VALID [2022-04-07 15:17:12,726 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2929#true} {2929#true} #61#return; {2929#true} is VALID [2022-04-07 15:17:12,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {2929#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2929#true} is VALID [2022-04-07 15:17:12,726 INFO L272 TraceCheckUtils]: 12: Hoare triple {2929#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {2929#true} is VALID [2022-04-07 15:17:12,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {2929#true} ~cond := #in~cond; {2973#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 15:17:12,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {2973#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2977#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:17:12,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {2977#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2977#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:17:12,728 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2977#(not (= |assume_abort_if_not_#in~cond| 0))} {2929#true} #63#return; {2984#(and (<= 0 main_~b~0) (<= main_~b~0 10))} is VALID [2022-04-07 15:17:12,728 INFO L272 TraceCheckUtils]: 17: Hoare triple {2984#(and (<= 0 main_~b~0) (<= main_~b~0 10))} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2929#true} is VALID [2022-04-07 15:17:12,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {2929#true} ~cond := #in~cond; {2929#true} is VALID [2022-04-07 15:17:12,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {2929#true} assume !(0 == ~cond); {2929#true} is VALID [2022-04-07 15:17:12,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {2929#true} assume true; {2929#true} is VALID [2022-04-07 15:17:12,735 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2929#true} {2984#(and (<= 0 main_~b~0) (<= main_~b~0 10))} #65#return; {2984#(and (<= 0 main_~b~0) (<= main_~b~0 10))} is VALID [2022-04-07 15:17:12,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {2984#(and (<= 0 main_~b~0) (<= main_~b~0 10))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3003#(<= main_~y~0 10)} is VALID [2022-04-07 15:17:12,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {3003#(<= main_~y~0 10)} assume !false; {3003#(<= main_~y~0 10)} is VALID [2022-04-07 15:17:12,736 INFO L272 TraceCheckUtils]: 24: Hoare triple {3003#(<= main_~y~0 10)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2929#true} is VALID [2022-04-07 15:17:12,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {2929#true} ~cond := #in~cond; {2929#true} is VALID [2022-04-07 15:17:12,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {2929#true} assume !(0 == ~cond); {2929#true} is VALID [2022-04-07 15:17:12,736 INFO L290 TraceCheckUtils]: 27: Hoare triple {2929#true} assume true; {2929#true} is VALID [2022-04-07 15:17:12,737 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2929#true} {3003#(<= main_~y~0 10)} #67#return; {3003#(<= main_~y~0 10)} is VALID [2022-04-07 15:17:12,737 INFO L290 TraceCheckUtils]: 29: Hoare triple {3003#(<= main_~y~0 10)} assume !!(0 != ~y~0); {3025#(and (not (= main_~y~0 0)) (<= main_~y~0 10))} is VALID [2022-04-07 15:17:12,738 INFO L290 TraceCheckUtils]: 30: Hoare triple {3025#(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; {3029#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= main_~y~0 9) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-07 15:17:12,741 INFO L290 TraceCheckUtils]: 31: Hoare triple {3029#(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); {3033#(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-07 15:17:12,742 INFO L290 TraceCheckUtils]: 32: Hoare triple {3033#(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; {3037#(<= main_~y~0 4)} is VALID [2022-04-07 15:17:12,742 INFO L272 TraceCheckUtils]: 33: Hoare triple {3037#(<= main_~y~0 4)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2929#true} is VALID [2022-04-07 15:17:12,742 INFO L290 TraceCheckUtils]: 34: Hoare triple {2929#true} ~cond := #in~cond; {2929#true} is VALID [2022-04-07 15:17:12,742 INFO L290 TraceCheckUtils]: 35: Hoare triple {2929#true} assume !(0 == ~cond); {2929#true} is VALID [2022-04-07 15:17:12,743 INFO L290 TraceCheckUtils]: 36: Hoare triple {2929#true} assume true; {2929#true} is VALID [2022-04-07 15:17:12,743 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2929#true} {3037#(<= main_~y~0 4)} #67#return; {3037#(<= main_~y~0 4)} is VALID [2022-04-07 15:17:12,743 INFO L290 TraceCheckUtils]: 38: Hoare triple {3037#(<= main_~y~0 4)} assume !!(0 != ~y~0); {3056#(and (not (= main_~y~0 0)) (<= main_~y~0 4))} is VALID [2022-04-07 15:17:12,744 INFO L290 TraceCheckUtils]: 39: Hoare triple {3056#(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; {3060#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= main_~y~0 3) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-07 15:17:12,746 INFO L290 TraceCheckUtils]: 40: Hoare triple {3060#(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); {3064#(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-07 15:17:12,747 INFO L290 TraceCheckUtils]: 41: Hoare triple {3064#(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; {3068#(and (< 0 (+ main_~y~0 1)) (<= (* main_~y~0 2) 3))} is VALID [2022-04-07 15:17:12,747 INFO L272 TraceCheckUtils]: 42: Hoare triple {3068#(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)); {2929#true} is VALID [2022-04-07 15:17:12,747 INFO L290 TraceCheckUtils]: 43: Hoare triple {2929#true} ~cond := #in~cond; {2929#true} is VALID [2022-04-07 15:17:12,747 INFO L290 TraceCheckUtils]: 44: Hoare triple {2929#true} assume !(0 == ~cond); {2929#true} is VALID [2022-04-07 15:17:12,747 INFO L290 TraceCheckUtils]: 45: Hoare triple {2929#true} assume true; {2929#true} is VALID [2022-04-07 15:17:12,748 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2929#true} {3068#(and (< 0 (+ main_~y~0 1)) (<= (* main_~y~0 2) 3))} #67#return; {3068#(and (< 0 (+ main_~y~0 1)) (<= (* main_~y~0 2) 3))} is VALID [2022-04-07 15:17:12,748 INFO L290 TraceCheckUtils]: 47: Hoare triple {3068#(and (< 0 (+ main_~y~0 1)) (<= (* main_~y~0 2) 3))} assume !!(0 != ~y~0); {3087#(and (not (= main_~y~0 0)) (< 0 (+ main_~y~0 1)) (<= (* main_~y~0 2) 3))} is VALID [2022-04-07 15:17:12,749 INFO L290 TraceCheckUtils]: 48: Hoare triple {3087#(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)); {2930#false} is VALID [2022-04-07 15:17:12,749 INFO L290 TraceCheckUtils]: 49: Hoare triple {2930#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); {2930#false} is VALID [2022-04-07 15:17:12,749 INFO L290 TraceCheckUtils]: 50: Hoare triple {2930#false} assume !false; {2930#false} is VALID [2022-04-07 15:17:12,749 INFO L272 TraceCheckUtils]: 51: Hoare triple {2930#false} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2930#false} is VALID [2022-04-07 15:17:12,749 INFO L290 TraceCheckUtils]: 52: Hoare triple {2930#false} ~cond := #in~cond; {2930#false} is VALID [2022-04-07 15:17:12,749 INFO L290 TraceCheckUtils]: 53: Hoare triple {2930#false} assume 0 == ~cond; {2930#false} is VALID [2022-04-07 15:17:12,750 INFO L290 TraceCheckUtils]: 54: Hoare triple {2930#false} assume !false; {2930#false} is VALID [2022-04-07 15:17:12,750 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-07 15:17:12,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:17:16,274 INFO L290 TraceCheckUtils]: 54: Hoare triple {2930#false} assume !false; {2930#false} is VALID [2022-04-07 15:17:16,274 INFO L290 TraceCheckUtils]: 53: Hoare triple {2930#false} assume 0 == ~cond; {2930#false} is VALID [2022-04-07 15:17:16,274 INFO L290 TraceCheckUtils]: 52: Hoare triple {2930#false} ~cond := #in~cond; {2930#false} is VALID [2022-04-07 15:17:16,274 INFO L272 TraceCheckUtils]: 51: Hoare triple {2930#false} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2930#false} is VALID [2022-04-07 15:17:16,274 INFO L290 TraceCheckUtils]: 50: Hoare triple {2930#false} assume !false; {2930#false} is VALID [2022-04-07 15:17:16,274 INFO L290 TraceCheckUtils]: 49: Hoare triple {2930#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); {2930#false} is VALID [2022-04-07 15:17:16,275 INFO L290 TraceCheckUtils]: 48: Hoare triple {3127#(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)); {2930#false} is VALID [2022-04-07 15:17:16,275 INFO L290 TraceCheckUtils]: 47: Hoare triple {3131#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (= main_~y~0 0))} assume !!(0 != ~y~0); {3127#(and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1))} is VALID [2022-04-07 15:17:16,276 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2929#true} {3131#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (= main_~y~0 0))} #67#return; {3131#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (= main_~y~0 0))} is VALID [2022-04-07 15:17:16,276 INFO L290 TraceCheckUtils]: 45: Hoare triple {2929#true} assume true; {2929#true} is VALID [2022-04-07 15:17:16,276 INFO L290 TraceCheckUtils]: 44: Hoare triple {2929#true} assume !(0 == ~cond); {2929#true} is VALID [2022-04-07 15:17:16,276 INFO L290 TraceCheckUtils]: 43: Hoare triple {2929#true} ~cond := #in~cond; {2929#true} is VALID [2022-04-07 15:17:16,276 INFO L272 TraceCheckUtils]: 42: Hoare triple {3131#(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)); {2929#true} is VALID [2022-04-07 15:17:16,276 INFO L290 TraceCheckUtils]: 41: Hoare triple {3131#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (= main_~y~0 0))} assume !false; {3131#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (= main_~y~0 0))} is VALID [2022-04-07 15:17:16,277 INFO L290 TraceCheckUtils]: 40: Hoare triple {3153#(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); {3131#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (= main_~y~0 0))} is VALID [2022-04-07 15:17:16,279 INFO L290 TraceCheckUtils]: 39: Hoare triple {3157#(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; {3153#(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-07 15:17:16,279 INFO L290 TraceCheckUtils]: 38: Hoare triple {3157#(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); {3157#(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-07 15:17:16,280 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2929#true} {3157#(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; {3157#(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-07 15:17:16,280 INFO L290 TraceCheckUtils]: 36: Hoare triple {2929#true} assume true; {2929#true} is VALID [2022-04-07 15:17:16,280 INFO L290 TraceCheckUtils]: 35: Hoare triple {2929#true} assume !(0 == ~cond); {2929#true} is VALID [2022-04-07 15:17:16,280 INFO L290 TraceCheckUtils]: 34: Hoare triple {2929#true} ~cond := #in~cond; {2929#true} is VALID [2022-04-07 15:17:16,280 INFO L272 TraceCheckUtils]: 33: Hoare triple {3157#(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)); {2929#true} is VALID [2022-04-07 15:17:16,280 INFO L290 TraceCheckUtils]: 32: Hoare triple {3157#(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; {3157#(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-07 15:17:16,282 INFO L290 TraceCheckUtils]: 31: Hoare triple {3182#(<= (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); {3157#(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-07 15:17:16,283 INFO L290 TraceCheckUtils]: 30: Hoare triple {3186#(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; {3182#(<= (div (+ (- 2) (* (- 1) (div (* (- 1) (div main_~y~0 2)) (- 2)))) (- 2)) 2)} is VALID [2022-04-07 15:17:16,283 INFO L290 TraceCheckUtils]: 29: Hoare triple {3186#(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); {3186#(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-07 15:17:16,284 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2929#true} {3186#(or (<= (div (+ (- 2) (* (- 1) (div (* (- 1) (div (+ (- 1) main_~y~0) 2)) (- 2)))) (- 2)) 2) (< (mod main_~y~0 2) 1))} #67#return; {3186#(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-07 15:17:16,284 INFO L290 TraceCheckUtils]: 27: Hoare triple {2929#true} assume true; {2929#true} is VALID [2022-04-07 15:17:16,284 INFO L290 TraceCheckUtils]: 26: Hoare triple {2929#true} assume !(0 == ~cond); {2929#true} is VALID [2022-04-07 15:17:16,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {2929#true} ~cond := #in~cond; {2929#true} is VALID [2022-04-07 15:17:16,284 INFO L272 TraceCheckUtils]: 24: Hoare triple {3186#(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)); {2929#true} is VALID [2022-04-07 15:17:16,284 INFO L290 TraceCheckUtils]: 23: Hoare triple {3186#(or (<= (div (+ (- 2) (* (- 1) (div (* (- 1) (div (+ (- 1) main_~y~0) 2)) (- 2)))) (- 2)) 2) (< (mod main_~y~0 2) 1))} assume !false; {3186#(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-07 15:17:16,285 INFO L290 TraceCheckUtils]: 22: Hoare triple {3211#(<= (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; {3186#(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-07 15:17:16,286 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2929#true} {3211#(<= (div (+ (- 1) (div (+ (- 1) (div (+ (* (- 1) main_~b~0) (- 8)) 2)) 2)) (- 2)) 3)} #65#return; {3211#(<= (div (+ (- 1) (div (+ (- 1) (div (+ (* (- 1) main_~b~0) (- 8)) 2)) 2)) (- 2)) 3)} is VALID [2022-04-07 15:17:16,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {2929#true} assume true; {2929#true} is VALID [2022-04-07 15:17:16,286 INFO L290 TraceCheckUtils]: 19: Hoare triple {2929#true} assume !(0 == ~cond); {2929#true} is VALID [2022-04-07 15:17:16,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {2929#true} ~cond := #in~cond; {2929#true} is VALID [2022-04-07 15:17:16,286 INFO L272 TraceCheckUtils]: 17: Hoare triple {3211#(<= (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)); {2929#true} is VALID [2022-04-07 15:17:16,287 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2977#(not (= |assume_abort_if_not_#in~cond| 0))} {2929#true} #63#return; {3211#(<= (div (+ (- 1) (div (+ (- 1) (div (+ (* (- 1) main_~b~0) (- 8)) 2)) 2)) (- 2)) 3)} is VALID [2022-04-07 15:17:16,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {2977#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2977#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:17:16,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {3239#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {2977#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:17:16,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {2929#true} ~cond := #in~cond; {3239#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-07 15:17:16,288 INFO L272 TraceCheckUtils]: 12: Hoare triple {2929#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {2929#true} is VALID [2022-04-07 15:17:16,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {2929#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2929#true} is VALID [2022-04-07 15:17:16,288 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2929#true} {2929#true} #61#return; {2929#true} is VALID [2022-04-07 15:17:16,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {2929#true} assume true; {2929#true} is VALID [2022-04-07 15:17:16,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {2929#true} assume !(0 == ~cond); {2929#true} is VALID [2022-04-07 15:17:16,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {2929#true} ~cond := #in~cond; {2929#true} is VALID [2022-04-07 15:17:16,288 INFO L272 TraceCheckUtils]: 6: Hoare triple {2929#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {2929#true} is VALID [2022-04-07 15:17:16,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {2929#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; {2929#true} is VALID [2022-04-07 15:17:16,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {2929#true} call #t~ret6 := main(); {2929#true} is VALID [2022-04-07 15:17:16,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2929#true} {2929#true} #71#return; {2929#true} is VALID [2022-04-07 15:17:16,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {2929#true} assume true; {2929#true} is VALID [2022-04-07 15:17:16,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {2929#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); {2929#true} is VALID [2022-04-07 15:17:16,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {2929#true} call ULTIMATE.init(); {2929#true} is VALID [2022-04-07 15:17:16,289 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-07 15:17:16,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:17:16,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065909546] [2022-04-07 15:17:16,289 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:17:16,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455353808] [2022-04-07 15:17:16,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455353808] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 15:17:16,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 15:17:16,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 23 [2022-04-07 15:17:16,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276935128] [2022-04-07 15:17:16,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 15:17:16,290 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-07 15:17:16,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:17:16,291 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-07 15:17:16,362 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-07 15:17:16,363 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-07 15:17:16,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:17:16,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-07 15:17:16,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2022-04-07 15:17:16,364 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-07 15:17:17,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:17:17,515 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2022-04-07 15:17:17,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-07 15:17:17,515 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-07 15:17:17,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:17:17,516 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-07 15:17:17,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 67 transitions. [2022-04-07 15:17:17,517 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-07 15:17:17,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 67 transitions. [2022-04-07 15:17:17,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 67 transitions. [2022-04-07 15:17:17,582 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-07 15:17:17,584 INFO L225 Difference]: With dead ends: 99 [2022-04-07 15:17:17,584 INFO L226 Difference]: Without dead ends: 70 [2022-04-07 15:17:17,585 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=1032, Unknown=0, NotChecked=0, Total=1332 [2022-04-07 15:17:17,585 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 26 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 15:17:17,585 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 147 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 176 Invalid, 0 Unknown, 6 Unchecked, 0.3s Time] [2022-04-07 15:17:17,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-07 15:17:17,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-07 15:17:17,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:17:17,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 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-07 15:17:17,637 INFO L74 IsIncluded]: Start isIncluded. First operand 70 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-07 15:17:17,637 INFO L87 Difference]: Start difference. First operand 70 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-07 15:17:17,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:17:17,639 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-07 15:17:17,639 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-07 15:17:17,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:17:17,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:17:17,640 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 70 states. [2022-04-07 15:17:17,646 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 70 states. [2022-04-07 15:17:17,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:17:17,649 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-07 15:17:17,649 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-07 15:17:17,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:17:17,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:17:17,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:17:17,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:17:17,651 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-07 15:17:17,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2022-04-07 15:17:17,653 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 55 [2022-04-07 15:17:17,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:17:17,653 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2022-04-07 15:17:17,653 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-07 15:17:17,653 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-07 15:17:17,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-07 15:17:17,654 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:17:17,654 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-07 15:17:17,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-07 15:17:17,867 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-07 15:17:17,868 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:17:17,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:17:17,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1814345074, now seen corresponding path program 3 times [2022-04-07 15:17:17,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:17:17,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969831552] [2022-04-07 15:17:17,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:17:17,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:17:17,879 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:17:17,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1594515332] [2022-04-07 15:17:17,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 15:17:17,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:17:17,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:17:17,880 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-07 15:17:17,881 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-07 15:17:17,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-07 15:17:17,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:17:17,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-07 15:17:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:17:17,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:17:36,355 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 15:17:40,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {3691#true} call ULTIMATE.init(); {3691#true} is VALID [2022-04-07 15:17:40,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {3691#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); {3691#true} is VALID [2022-04-07 15:17:40,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {3691#true} assume true; {3691#true} is VALID [2022-04-07 15:17:40,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3691#true} {3691#true} #71#return; {3691#true} is VALID [2022-04-07 15:17:40,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {3691#true} call #t~ret6 := main(); {3691#true} is VALID [2022-04-07 15:17:40,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {3691#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; {3691#true} is VALID [2022-04-07 15:17:40,463 INFO L272 TraceCheckUtils]: 6: Hoare triple {3691#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {3691#true} is VALID [2022-04-07 15:17:40,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {3691#true} ~cond := #in~cond; {3691#true} is VALID [2022-04-07 15:17:40,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {3691#true} assume !(0 == ~cond); {3691#true} is VALID [2022-04-07 15:17:40,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {3691#true} assume true; {3691#true} is VALID [2022-04-07 15:17:40,463 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3691#true} {3691#true} #61#return; {3691#true} is VALID [2022-04-07 15:17:40,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {3691#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3691#true} is VALID [2022-04-07 15:17:40,463 INFO L272 TraceCheckUtils]: 12: Hoare triple {3691#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {3691#true} is VALID [2022-04-07 15:17:40,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {3691#true} ~cond := #in~cond; {3735#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 15:17:40,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {3735#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3739#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:17:40,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {3739#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3739#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:17:40,465 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3739#(not (= |assume_abort_if_not_#in~cond| 0))} {3691#true} #63#return; {3746#(and (<= 0 main_~b~0) (<= main_~b~0 10))} is VALID [2022-04-07 15:17:40,465 INFO L272 TraceCheckUtils]: 17: Hoare triple {3746#(and (<= 0 main_~b~0) (<= main_~b~0 10))} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3691#true} is VALID [2022-04-07 15:17:40,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {3691#true} ~cond := #in~cond; {3691#true} is VALID [2022-04-07 15:17:40,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {3691#true} assume !(0 == ~cond); {3691#true} is VALID [2022-04-07 15:17:40,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {3691#true} assume true; {3691#true} is VALID [2022-04-07 15:17:40,465 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3691#true} {3746#(and (<= 0 main_~b~0) (<= main_~b~0 10))} #65#return; {3746#(and (<= 0 main_~b~0) (<= main_~b~0 10))} is VALID [2022-04-07 15:17:40,466 INFO L290 TraceCheckUtils]: 22: Hoare triple {3746#(and (<= 0 main_~b~0) (<= main_~b~0 10))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3765#(and (= main_~b~0 main_~y~0) (<= 0 main_~b~0) (<= main_~b~0 10))} is VALID [2022-04-07 15:17:40,466 INFO L290 TraceCheckUtils]: 23: Hoare triple {3765#(and (= main_~b~0 main_~y~0) (<= 0 main_~b~0) (<= main_~b~0 10))} assume !false; {3765#(and (= main_~b~0 main_~y~0) (<= 0 main_~b~0) (<= main_~b~0 10))} is VALID [2022-04-07 15:17:40,466 INFO L272 TraceCheckUtils]: 24: Hoare triple {3765#(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)); {3691#true} is VALID [2022-04-07 15:17:40,466 INFO L290 TraceCheckUtils]: 25: Hoare triple {3691#true} ~cond := #in~cond; {3691#true} is VALID [2022-04-07 15:17:40,466 INFO L290 TraceCheckUtils]: 26: Hoare triple {3691#true} assume !(0 == ~cond); {3691#true} is VALID [2022-04-07 15:17:40,466 INFO L290 TraceCheckUtils]: 27: Hoare triple {3691#true} assume true; {3691#true} is VALID [2022-04-07 15:17:40,467 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3691#true} {3765#(and (= main_~b~0 main_~y~0) (<= 0 main_~b~0) (<= main_~b~0 10))} #67#return; {3765#(and (= main_~b~0 main_~y~0) (<= 0 main_~b~0) (<= main_~b~0 10))} is VALID [2022-04-07 15:17:40,467 INFO L290 TraceCheckUtils]: 29: Hoare triple {3765#(and (= main_~b~0 main_~y~0) (<= 0 main_~b~0) (<= main_~b~0 10))} assume !!(0 != ~y~0); {3787#(and (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (<= 0 main_~b~0) (<= main_~b~0 10))} is VALID [2022-04-07 15:17:40,468 INFO L290 TraceCheckUtils]: 30: Hoare triple {3787#(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; {3791#(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-07 15:17:40,469 INFO L290 TraceCheckUtils]: 31: Hoare triple {3791#(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); {3795#(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-07 15:17:40,469 INFO L290 TraceCheckUtils]: 32: Hoare triple {3795#(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; {3795#(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-07 15:17:40,469 INFO L272 TraceCheckUtils]: 33: Hoare triple {3795#(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)); {3691#true} is VALID [2022-04-07 15:17:40,469 INFO L290 TraceCheckUtils]: 34: Hoare triple {3691#true} ~cond := #in~cond; {3691#true} is VALID [2022-04-07 15:17:40,469 INFO L290 TraceCheckUtils]: 35: Hoare triple {3691#true} assume !(0 == ~cond); {3691#true} is VALID [2022-04-07 15:17:40,469 INFO L290 TraceCheckUtils]: 36: Hoare triple {3691#true} assume true; {3691#true} is VALID [2022-04-07 15:17:40,470 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3691#true} {3795#(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; {3795#(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-07 15:17:40,470 INFO L290 TraceCheckUtils]: 38: Hoare triple {3795#(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); {3795#(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-07 15:17:40,471 INFO L290 TraceCheckUtils]: 39: Hoare triple {3795#(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)); {3795#(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-07 15:17:40,472 INFO L290 TraceCheckUtils]: 40: Hoare triple {3795#(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); {3823#(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-07 15:17:40,472 INFO L290 TraceCheckUtils]: 41: Hoare triple {3823#(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; {3823#(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-07 15:17:40,472 INFO L272 TraceCheckUtils]: 42: Hoare triple {3823#(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)); {3691#true} is VALID [2022-04-07 15:17:40,472 INFO L290 TraceCheckUtils]: 43: Hoare triple {3691#true} ~cond := #in~cond; {3833#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:17:40,473 INFO L290 TraceCheckUtils]: 44: Hoare triple {3833#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3837#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:17:40,473 INFO L290 TraceCheckUtils]: 45: Hoare triple {3837#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3837#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:17:40,474 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3837#(not (= |__VERIFIER_assert_#in~cond| 0))} {3823#(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; {3844#(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-07 15:17:40,474 INFO L290 TraceCheckUtils]: 47: Hoare triple {3844#(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); {3844#(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-07 15:17:40,475 INFO L290 TraceCheckUtils]: 48: Hoare triple {3844#(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)); {3851#(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-07 15:17:42,384 INFO L290 TraceCheckUtils]: 49: Hoare triple {3851#(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); {3855#(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-07 15:17:44,103 INFO L290 TraceCheckUtils]: 50: Hoare triple {3855#(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; {3859#(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-07 15:17:45,851 INFO L272 TraceCheckUtils]: 51: Hoare triple {3859#(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)); {3863#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:17:45,852 INFO L290 TraceCheckUtils]: 52: Hoare triple {3863#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3867#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:17:45,852 INFO L290 TraceCheckUtils]: 53: Hoare triple {3867#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3692#false} is VALID [2022-04-07 15:17:45,852 INFO L290 TraceCheckUtils]: 54: Hoare triple {3692#false} assume !false; {3692#false} is VALID [2022-04-07 15:17:45,852 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-07 15:17:45,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:18:28,793 INFO L290 TraceCheckUtils]: 54: Hoare triple {3692#false} assume !false; {3692#false} is VALID [2022-04-07 15:18:28,793 INFO L290 TraceCheckUtils]: 53: Hoare triple {3867#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3692#false} is VALID [2022-04-07 15:18:28,803 INFO L290 TraceCheckUtils]: 52: Hoare triple {3863#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3867#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:18:28,804 INFO L272 TraceCheckUtils]: 51: Hoare triple {3883#(= (+ 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)); {3863#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:18:28,804 INFO L290 TraceCheckUtils]: 50: Hoare triple {3883#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {3883#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-07 15:18:28,809 INFO L290 TraceCheckUtils]: 49: Hoare triple {3890#(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); {3883#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-07 15:18:28,809 INFO L290 TraceCheckUtils]: 48: Hoare triple {3894#(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)); {3890#(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-07 15:18:28,810 INFO L290 TraceCheckUtils]: 47: Hoare triple {3894#(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); {3894#(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-07 15:18:28,813 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3837#(not (= |__VERIFIER_assert_#in~cond| 0))} {3901#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} #67#return; {3894#(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-07 15:18:28,813 INFO L290 TraceCheckUtils]: 45: Hoare triple {3837#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3837#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:18:28,814 INFO L290 TraceCheckUtils]: 44: Hoare triple {3911#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3837#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:18:28,815 INFO L290 TraceCheckUtils]: 43: Hoare triple {3691#true} ~cond := #in~cond; {3911#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 15:18:28,815 INFO L272 TraceCheckUtils]: 42: Hoare triple {3901#(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)); {3691#true} is VALID [2022-04-07 15:18:28,815 INFO L290 TraceCheckUtils]: 41: Hoare triple {3901#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} assume !false; {3901#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID [2022-04-07 15:18:28,816 INFO L290 TraceCheckUtils]: 40: Hoare triple {3921#(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); {3901#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID [2022-04-07 15:18:28,816 INFO L290 TraceCheckUtils]: 39: Hoare triple {3921#(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)); {3921#(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-07 15:18:28,817 INFO L290 TraceCheckUtils]: 38: Hoare triple {3921#(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); {3921#(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-07 15:18:28,817 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3691#true} {3921#(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; {3921#(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-07 15:18:28,817 INFO L290 TraceCheckUtils]: 36: Hoare triple {3691#true} assume true; {3691#true} is VALID [2022-04-07 15:18:28,818 INFO L290 TraceCheckUtils]: 35: Hoare triple {3691#true} assume !(0 == ~cond); {3691#true} is VALID [2022-04-07 15:18:28,818 INFO L290 TraceCheckUtils]: 34: Hoare triple {3691#true} ~cond := #in~cond; {3691#true} is VALID [2022-04-07 15:18:28,818 INFO L272 TraceCheckUtils]: 33: Hoare triple {3921#(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)); {3691#true} is VALID [2022-04-07 15:18:28,818 INFO L290 TraceCheckUtils]: 32: Hoare triple {3921#(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; {3921#(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-07 15:18:28,820 INFO L290 TraceCheckUtils]: 31: Hoare triple {3949#(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); {3921#(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-07 15:18:28,821 INFO L290 TraceCheckUtils]: 30: Hoare triple {3953#(<= 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; {3949#(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-07 15:18:28,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {3953#(<= 0 (+ 3 (div (+ (- 1) (div (+ (- 4) (* (- 1) (div (+ main_~y~0 (- 10)) (- 2)))) 2)) 2)))} assume !!(0 != ~y~0); {3953#(<= 0 (+ 3 (div (+ (- 1) (div (+ (- 4) (* (- 1) (div (+ main_~y~0 (- 10)) (- 2)))) 2)) 2)))} is VALID [2022-04-07 15:18:28,822 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3691#true} {3953#(<= 0 (+ 3 (div (+ (- 1) (div (+ (- 4) (* (- 1) (div (+ main_~y~0 (- 10)) (- 2)))) 2)) 2)))} #67#return; {3953#(<= 0 (+ 3 (div (+ (- 1) (div (+ (- 4) (* (- 1) (div (+ main_~y~0 (- 10)) (- 2)))) 2)) 2)))} is VALID [2022-04-07 15:18:28,822 INFO L290 TraceCheckUtils]: 27: Hoare triple {3691#true} assume true; {3691#true} is VALID [2022-04-07 15:18:28,822 INFO L290 TraceCheckUtils]: 26: Hoare triple {3691#true} assume !(0 == ~cond); {3691#true} is VALID [2022-04-07 15:18:28,822 INFO L290 TraceCheckUtils]: 25: Hoare triple {3691#true} ~cond := #in~cond; {3691#true} is VALID [2022-04-07 15:18:28,822 INFO L272 TraceCheckUtils]: 24: Hoare triple {3953#(<= 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)); {3691#true} is VALID [2022-04-07 15:18:28,823 INFO L290 TraceCheckUtils]: 23: Hoare triple {3953#(<= 0 (+ 3 (div (+ (- 1) (div (+ (- 4) (* (- 1) (div (+ main_~y~0 (- 10)) (- 2)))) 2)) 2)))} assume !false; {3953#(<= 0 (+ 3 (div (+ (- 1) (div (+ (- 4) (* (- 1) (div (+ main_~y~0 (- 10)) (- 2)))) 2)) 2)))} is VALID [2022-04-07 15:18:28,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {3978#(<= 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; {3953#(<= 0 (+ 3 (div (+ (- 1) (div (+ (- 4) (* (- 1) (div (+ main_~y~0 (- 10)) (- 2)))) 2)) 2)))} is VALID [2022-04-07 15:18:28,824 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3691#true} {3978#(<= 0 (+ 3 (div (+ (- 1) (div (+ (* (- 1) (div (+ main_~b~0 (- 10)) (- 2))) (- 4)) 2)) 2)))} #65#return; {3978#(<= 0 (+ 3 (div (+ (- 1) (div (+ (* (- 1) (div (+ main_~b~0 (- 10)) (- 2))) (- 4)) 2)) 2)))} is VALID [2022-04-07 15:18:28,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {3691#true} assume true; {3691#true} is VALID [2022-04-07 15:18:28,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {3691#true} assume !(0 == ~cond); {3691#true} is VALID [2022-04-07 15:18:28,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {3691#true} ~cond := #in~cond; {3691#true} is VALID [2022-04-07 15:18:28,824 INFO L272 TraceCheckUtils]: 17: Hoare triple {3978#(<= 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)); {3691#true} is VALID [2022-04-07 15:18:28,825 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3739#(not (= |assume_abort_if_not_#in~cond| 0))} {3691#true} #63#return; {3978#(<= 0 (+ 3 (div (+ (- 1) (div (+ (* (- 1) (div (+ main_~b~0 (- 10)) (- 2))) (- 4)) 2)) 2)))} is VALID [2022-04-07 15:18:28,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {3739#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3739#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:18:28,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {4006#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {3739#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:18:28,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {3691#true} ~cond := #in~cond; {4006#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-07 15:18:28,826 INFO L272 TraceCheckUtils]: 12: Hoare triple {3691#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {3691#true} is VALID [2022-04-07 15:18:28,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {3691#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3691#true} is VALID [2022-04-07 15:18:28,826 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3691#true} {3691#true} #61#return; {3691#true} is VALID [2022-04-07 15:18:28,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {3691#true} assume true; {3691#true} is VALID [2022-04-07 15:18:28,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {3691#true} assume !(0 == ~cond); {3691#true} is VALID [2022-04-07 15:18:28,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {3691#true} ~cond := #in~cond; {3691#true} is VALID [2022-04-07 15:18:28,826 INFO L272 TraceCheckUtils]: 6: Hoare triple {3691#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {3691#true} is VALID [2022-04-07 15:18:28,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {3691#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; {3691#true} is VALID [2022-04-07 15:18:28,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {3691#true} call #t~ret6 := main(); {3691#true} is VALID [2022-04-07 15:18:28,827 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3691#true} {3691#true} #71#return; {3691#true} is VALID [2022-04-07 15:18:28,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {3691#true} assume true; {3691#true} is VALID [2022-04-07 15:18:28,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {3691#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); {3691#true} is VALID [2022-04-07 15:18:28,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {3691#true} call ULTIMATE.init(); {3691#true} is VALID [2022-04-07 15:18:28,827 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-07 15:18:28,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:18:28,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969831552] [2022-04-07 15:18:28,828 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:18:28,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594515332] [2022-04-07 15:18:28,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594515332] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 15:18:28,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 15:18:28,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 28 [2022-04-07 15:18:28,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222954611] [2022-04-07 15:18:28,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 15:18:28,831 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-07 15:18:28,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:18:28,834 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-07 15:18:32,999 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-07 15:18:32,999 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-07 15:18:32,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:18:32,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-07 15:18:33,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=617, Unknown=2, NotChecked=0, Total=756 [2022-04-07 15:18:33,000 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-07 15:18:36,591 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:18:42,265 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-07 15:18:51,373 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:18:54,278 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-07 15:18:57,076 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:19:00,842 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:19:04,705 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-07 15:19:06,709 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-07 15:19:14,272 WARN L232 SmtUtils]: Spent 6.85s on a formula simplification. DAG size of input: 75 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 15:19:19,748 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:19:34,368 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-07 15:19:36,372 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-07 15:19:38,974 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:19:40,473 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:19:42,780 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:19:50,689 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-07 15:19:59,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:19:59,963 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2022-04-07 15:19:59,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-07 15:19:59,963 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-07 15:19:59,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:19:59,963 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-07 15:19:59,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 62 transitions. [2022-04-07 15:19:59,965 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-07 15:19:59,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 62 transitions. [2022-04-07 15:19:59,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 62 transitions. [2022-04-07 15:20:11,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 58 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-07 15:20:11,436 INFO L225 Difference]: With dead ends: 83 [2022-04-07 15:20:11,436 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 15:20:11,438 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 36.9s TimeCoverageRelationStatistics Valid=433, Invalid=1633, Unknown=4, NotChecked=0, Total=2070 [2022-04-07 15:20:11,438 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 68 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 57 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 31.6s IncrementalHoareTripleChecker+Time [2022-04-07 15:20:11,438 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 175 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 316 Invalid, 5 Unknown, 1 Unchecked, 31.6s Time] [2022-04-07 15:20:11,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 15:20:11,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 15:20:11,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:20:11,439 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-07 15:20:11,439 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-07 15:20:11,439 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-07 15:20:11,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:20:11,439 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 15:20:11,439 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 15:20:11,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:20:11,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:20:11,440 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-07 15:20:11,440 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-07 15:20:11,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:20:11,440 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 15:20:11,440 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 15:20:11,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:20:11,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:20:11,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:20:11,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:20:11,440 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-07 15:20:11,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 15:20:11,440 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2022-04-07 15:20:11,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:20:11,441 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 15:20:11,441 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-07 15:20:11,441 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 15:20:11,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:20:11,443 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 15:20:11,459 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-07 15:20:11,651 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-07 15:20:11,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 15:20:19,469 WARN L232 SmtUtils]: Spent 7.68s on a formula simplification. DAG size of input: 129 DAG size of output: 37 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-07 15:20:27,336 WARN L232 SmtUtils]: Spent 7.80s on a formula simplification. DAG size of input: 129 DAG size of output: 37 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-07 15:20:27,351 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 6) no Hoare annotation was computed. [2022-04-07 15:20:27,351 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 6) no Hoare annotation was computed. [2022-04-07 15:20:27,351 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 6) no Hoare annotation was computed. [2022-04-07 15:20:27,351 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 9 11) the Hoare annotation is: true [2022-04-07 15:20:27,351 INFO L882 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2022-04-07 15:20:27,351 INFO L882 garLoopResultBuilder]: For program point L10-2(lines 9 11) no Hoare annotation was computed. [2022-04-07 15:20:27,351 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 9 11) no Hoare annotation was computed. [2022-04-07 15:20:27,351 INFO L885 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-07 15:20:27,352 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-07 15:20:27,352 INFO L885 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-04-07 15:20:27,352 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 20 49) no Hoare annotation was computed. [2022-04-07 15:20:27,352 INFO L882 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2022-04-07 15:20:27,352 INFO L882 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-04-07 15:20:27,352 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 20 49) no Hoare annotation was computed. [2022-04-07 15:20:27,352 INFO L878 garLoopResultBuilder]: At program point L34-2(lines 34 45) the Hoare annotation is: (let ((.cse3 (* main_~b~0 main_~a~0))) (let ((.cse0 (= (+ main_~z~0 (* main_~y~0 main_~x~0)) .cse3)) (.cse1 (<= 1 main_~b~0)) (.cse2 (<= main_~b~0 10))) (or (and (<= 0 main_~y~0) .cse0 (<= main_~y~0 4) .cse1 .cse2) (and .cse0 (= main_~b~0 main_~y~0) (<= 1 main_~y~0) .cse2 (= main_~a~0 main_~x~0)) (and (= main_~y~0 (div main_~b~0 2)) (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) .cse3) (= (* main_~a~0 2) main_~x~0) .cse1 .cse2)))) [2022-04-07 15:20:27,352 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-07 15:20:27,352 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 20 49) the Hoare annotation is: true [2022-04-07 15:20:27,352 INFO L882 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-07 15:20:27,352 INFO L882 garLoopResultBuilder]: For program point L39(lines 39 42) no Hoare annotation was computed. [2022-04-07 15:20:27,352 INFO L882 garLoopResultBuilder]: For program point L39-2(lines 39 42) no Hoare annotation was computed. [2022-04-07 15:20:27,353 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse3 (* main_~b~0 main_~a~0))) (let ((.cse0 (= (+ main_~z~0 (* main_~y~0 main_~x~0)) .cse3)) (.cse1 (<= 1 main_~b~0)) (.cse2 (<= main_~b~0 10))) (or (and (<= 0 main_~y~0) .cse0 (<= main_~y~0 4) .cse1 .cse2) (and .cse0 (= main_~b~0 main_~y~0) (<= 1 main_~y~0) .cse2 (= main_~a~0 main_~x~0)) (and (= main_~y~0 (div main_~b~0 2)) (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) .cse3) (= (* main_~a~0 2) main_~x~0) .cse1 .cse2)))) [2022-04-07 15:20:27,353 INFO L882 garLoopResultBuilder]: For program point L35-1(lines 34 45) no Hoare annotation was computed. [2022-04-07 15:20:27,353 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 15:20:27,353 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-07 15:20:27,353 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 15:20:27,353 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 15:20:27,353 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 15:20:27,353 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 15:20:27,353 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 15:20:27,353 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 12 18) the Hoare annotation is: true [2022-04-07 15:20:27,353 INFO L882 garLoopResultBuilder]: For program point L14(lines 14 15) no Hoare annotation was computed. [2022-04-07 15:20:27,353 INFO L882 garLoopResultBuilder]: For program point L13(lines 13 16) no Hoare annotation was computed. [2022-04-07 15:20:27,353 INFO L882 garLoopResultBuilder]: For program point L13-2(lines 12 18) no Hoare annotation was computed. [2022-04-07 15:20:27,354 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 12 18) no Hoare annotation was computed. [2022-04-07 15:20:27,354 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2022-04-07 15:20:27,356 INFO L719 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2022-04-07 15:20:27,356 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 15:20:27,358 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-07 15:20:27,358 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 15:20:27,367 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-07 15:20:27,367 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-07 15:20:27,367 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-07 15:20:27,367 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 15:20:27,367 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 15:20:27,367 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-07 15:20:27,367 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-07 15:20:27,367 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-07 15:20:27,367 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-07 15:20:27,367 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-07 15:20:27,367 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 15:20:27,367 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 15:20:27,367 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-07 15:20:27,368 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-07 15:20:27,368 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-07 15:20:27,368 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-07 15:20:27,368 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-07 15:20:27,368 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-07 15:20:27,368 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-07 15:20:27,368 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-07 15:20:27,368 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 15:20:27,368 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 15:20:27,368 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-07 15:20:27,368 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-07 15:20:27,368 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-07 15:20:27,368 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-07 15:20:27,368 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-07 15:20:27,372 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-07 15:20:27,373 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-07 15:20:27,373 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-07 15:20:27,373 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 15:20:27,373 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-07 15:20:27,373 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-04-07 15:20:27,373 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 15:20:27,373 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-07 15:20:27,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 03:20:27 BoogieIcfgContainer [2022-04-07 15:20:27,380 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 15:20:27,381 INFO L158 Benchmark]: Toolchain (without parser) took 476402.92ms. Allocated memory was 202.4MB in the beginning and 314.6MB in the end (delta: 112.2MB). Free memory was 150.9MB in the beginning and 183.9MB in the end (delta: -33.0MB). Peak memory consumption was 79.3MB. Max. memory is 8.0GB. [2022-04-07 15:20:27,381 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 202.4MB. Free memory was 167.4MB in the beginning and 167.3MB in the end (delta: 73.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 15:20:27,382 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.17ms. Allocated memory was 202.4MB in the beginning and 314.6MB in the end (delta: 112.2MB). Free memory was 150.7MB in the beginning and 291.1MB in the end (delta: -140.4MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. [2022-04-07 15:20:27,382 INFO L158 Benchmark]: Boogie Preprocessor took 17.92ms. Allocated memory is still 314.6MB. Free memory was 291.1MB in the beginning and 289.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 15:20:27,382 INFO L158 Benchmark]: RCFGBuilder took 266.98ms. Allocated memory is still 314.6MB. Free memory was 289.6MB in the beginning and 277.9MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 15:20:27,382 INFO L158 Benchmark]: TraceAbstraction took 475942.41ms. Allocated memory is still 314.6MB. Free memory was 277.3MB in the beginning and 183.9MB in the end (delta: 93.4MB). Peak memory consumption was 94.0MB. Max. memory is 8.0GB. [2022-04-07 15:20:27,383 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.08ms. Allocated memory is still 202.4MB. Free memory was 167.4MB in the beginning and 167.3MB in the end (delta: 73.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 172.17ms. Allocated memory was 202.4MB in the beginning and 314.6MB in the end (delta: 112.2MB). Free memory was 150.7MB in the beginning and 291.1MB in the end (delta: -140.4MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.92ms. Allocated memory is still 314.6MB. Free memory was 291.1MB in the beginning and 289.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 266.98ms. Allocated memory is still 314.6MB. Free memory was 289.6MB in the beginning and 277.9MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 475942.41ms. Allocated memory is still 314.6MB. Free memory was 277.3MB in the beginning and 183.9MB in the end (delta: 93.4MB). Peak memory consumption was 94.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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: 475.9s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 152.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 15.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 256 SdHoareTripleChecker+Valid, 48.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 243 mSDsluCounter, 1136 SdHoareTripleChecker+Invalid, 48.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 34 IncrementalHoareTripleChecker+Unchecked, 911 mSDsCounter, 171 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1331 IncrementalHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 171 mSolverCounterUnsat, 225 mSDtfsCounter, 1331 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 631 GetRequests, 462 SyntacticMatches, 11 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 53.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=7, InterpolantAutomatonStates: 106, 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, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 35 PreInvPairs, 60 NumberOfFragments, 193 HoareAnnotationTreeSize, 35 FomulaSimplifications, 135 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 1779 FormulaSimplificationTreeSizeReductionInter, 15.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 295.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 Derived loop invariant: (((((0 <= y && z + y * x == b * a) && y <= 4) && 1 <= b) && b <= 10) || ((((z + y * x == b * a && b == y) && 1 <= y) && b <= 10) && a == x)) || ((((y == b / 2 && z + 2 * (-1 * x / -2 * y) == b * a) && a * 2 == x) && 1 <= b) && b <= 10) RESULT: Ultimate proved your program to be correct! [2022-04-07 15:20:27,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...