/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/divbin2_valuebound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 13:17:28,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 13:17:28,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 13:17:28,459 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 13:17:28,459 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 13:17:28,460 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 13:17:28,461 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 13:17:28,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 13:17:28,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 13:17:28,471 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 13:17:28,472 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 13:17:28,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 13:17:28,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 13:17:28,477 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 13:17:28,478 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 13:17:28,479 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 13:17:28,480 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 13:17:28,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 13:17:28,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 13:17:28,492 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 13:17:28,494 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 13:17:28,495 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 13:17:28,496 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 13:17:28,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 13:17:28,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 13:17:28,506 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 13:17:28,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 13:17:28,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 13:17:28,509 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 13:17:28,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 13:17:28,510 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 13:17:28,511 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 13:17:28,512 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 13:17:28,513 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 13:17:28,513 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 13:17:28,514 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 13:17:28,514 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 13:17:28,515 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 13:17:28,515 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 13:17:28,515 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 13:17:28,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 13:17:28,517 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 13:17:28,518 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 13:17:28,548 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 13:17:28,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 13:17:28,549 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 13:17:28,549 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 13:17:28,549 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 13:17:28,550 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 13:17:28,550 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 13:17:28,550 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 13:17:28,550 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 13:17:28,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 13:17:28,551 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 13:17:28,551 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 13:17:28,551 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 13:17:28,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 13:17:28,551 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 13:17:28,551 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 13:17:28,551 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 13:17:28,552 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 13:17:28,552 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 13:17:28,552 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 13:17:28,552 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 13:17:28,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 13:17:28,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 13:17:28,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 13:17:28,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 13:17:28,553 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 13:17:28,553 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 13:17:28,553 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 13:17:28,553 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 13:17:28,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 13:17:28,553 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 13:17:28,554 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 13:17:28,554 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 13:17:28,554 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 13:17:28,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 13:17:28,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 13:17:28,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 13:17:28,834 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 13:17:28,835 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 13:17:28,836 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound2.i [2022-04-07 13:17:28,899 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55e701a49/35bea057fc8c4cf6b11a146ef05546b7/FLAG3d47dd30e [2022-04-07 13:17:29,302 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 13:17:29,302 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound2.i [2022-04-07 13:17:29,308 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55e701a49/35bea057fc8c4cf6b11a146ef05546b7/FLAG3d47dd30e [2022-04-07 13:17:29,324 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55e701a49/35bea057fc8c4cf6b11a146ef05546b7 [2022-04-07 13:17:29,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 13:17:29,328 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 13:17:29,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 13:17:29,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 13:17:29,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 13:17:29,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 01:17:29" (1/1) ... [2022-04-07 13:17:29,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ae6de06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:17:29, skipping insertion in model container [2022-04-07 13:17:29,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 01:17:29" (1/1) ... [2022-04-07 13:17:29,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 13:17:29,353 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 13:17:29,505 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/divbin2_valuebound2.i[951,964] [2022-04-07 13:17:29,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 13:17:29,526 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 13:17:29,538 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/divbin2_valuebound2.i[951,964] [2022-04-07 13:17:29,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 13:17:29,556 INFO L208 MainTranslator]: Completed translation [2022-04-07 13:17:29,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:17:29 WrapperNode [2022-04-07 13:17:29,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 13:17:29,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 13:17:29,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 13:17:29,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 13:17:29,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:17:29" (1/1) ... [2022-04-07 13:17:29,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:17:29" (1/1) ... [2022-04-07 13:17:29,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:17:29" (1/1) ... [2022-04-07 13:17:29,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:17:29" (1/1) ... [2022-04-07 13:17:29,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:17:29" (1/1) ... [2022-04-07 13:17:29,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:17:29" (1/1) ... [2022-04-07 13:17:29,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:17:29" (1/1) ... [2022-04-07 13:17:29,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 13:17:29,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 13:17:29,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 13:17:29,587 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 13:17:29,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:17:29" (1/1) ... [2022-04-07 13:17:29,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 13:17:29,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:17:29,627 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 13:17:29,628 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 13:17:29,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 13:17:29,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 13:17:29,654 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 13:17:29,654 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 13:17:29,654 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 13:17:29,654 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 13:17:29,655 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 13:17:29,655 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 13:17:29,655 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 13:17:29,655 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 13:17:29,655 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 13:17:29,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 13:17:29,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 13:17:29,655 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 13:17:29,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 13:17:29,656 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 13:17:29,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 13:17:29,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 13:17:29,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 13:17:29,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 13:17:29,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 13:17:29,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 13:17:29,711 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 13:17:29,713 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 13:17:29,902 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 13:17:29,908 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 13:17:29,908 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 13:17:29,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 01:17:29 BoogieIcfgContainer [2022-04-07 13:17:29,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 13:17:29,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 13:17:29,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 13:17:29,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 13:17:29,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 01:17:29" (1/3) ... [2022-04-07 13:17:29,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@168377c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 01:17:29, skipping insertion in model container [2022-04-07 13:17:29,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:17:29" (2/3) ... [2022-04-07 13:17:29,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@168377c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 01:17:29, skipping insertion in model container [2022-04-07 13:17:29,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 01:17:29" (3/3) ... [2022-04-07 13:17:29,932 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_valuebound2.i [2022-04-07 13:17:29,937 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 13:17:29,937 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 13:17:30,029 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 13:17:30,035 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 13:17:30,035 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 13:17:30,075 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 13:17:30,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 13:17:30,079 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:17:30,079 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:17:30,080 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:17:30,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:17:30,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1171333446, now seen corresponding path program 1 times [2022-04-07 13:17:30,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:17:30,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280224537] [2022-04-07 13:17:30,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:17:30,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:17:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:17:30,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 13:17:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:17:30,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(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(10, 2); {33#true} is VALID [2022-04-07 13:17:30,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-07 13:17:30,314 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #84#return; {33#true} is VALID [2022-04-07 13:17:30,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 13:17:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:17:30,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-07 13:17:30,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-07 13:17:30,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-07 13:17:30,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #78#return; {34#false} is VALID [2022-04-07 13:17:30,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 13:17:30,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(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(10, 2); {33#true} is VALID [2022-04-07 13:17:30,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-07 13:17:30,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #84#return; {33#true} is VALID [2022-04-07 13:17:30,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret2 := main(); {33#true} is VALID [2022-04-07 13:17:30,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {33#true} is VALID [2022-04-07 13:17:30,342 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 2 then 1 else 0)); {33#true} is VALID [2022-04-07 13:17:30,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-07 13:17:30,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-07 13:17:30,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-07 13:17:30,343 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #78#return; {34#false} is VALID [2022-04-07 13:17:30,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#false} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {34#false} is VALID [2022-04-07 13:17:30,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-07 13:17:30,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-07 13:17:30,345 INFO L272 TraceCheckUtils]: 14: Hoare triple {34#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {34#false} is VALID [2022-04-07 13:17:30,345 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-07 13:17:30,346 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-07 13:17:30,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-07 13:17:30,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:17:30,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:17:30,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280224537] [2022-04-07 13:17:30,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280224537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:17:30,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:17:30,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 13:17:30,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144831825] [2022-04-07 13:17:30,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:17:30,357 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-07 13:17:30,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:17:30,362 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:17:30,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:17:30,402 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 13:17:30,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:17:30,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 13:17:30,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 13:17:30,432 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:17:30,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:17:30,560 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-07 13:17:30,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 13:17:30,561 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-07 13:17:30,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:17:30,562 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:17:30,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-07 13:17:30,572 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:17:30,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-07 13:17:30,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-07 13:17:30,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:17:30,668 INFO L225 Difference]: With dead ends: 51 [2022-04-07 13:17:30,668 INFO L226 Difference]: Without dead ends: 25 [2022-04-07 13:17:30,671 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 13:17:30,675 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 13:17:30,676 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 13:17:30,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-07 13:17:30,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-07 13:17:30,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:17:30,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 13:17:30,707 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 13:17:30,708 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 13:17:30,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:17:30,712 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-07 13:17:30,712 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-07 13:17:30,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:17:30,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:17:30,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-07 13:17:30,713 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-07 13:17:30,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:17:30,716 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-07 13:17:30,716 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-07 13:17:30,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:17:30,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:17:30,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:17:30,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:17:30,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 13:17:30,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-07 13:17:30,721 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 18 [2022-04-07 13:17:30,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:17:30,721 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-07 13:17:30,723 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:17:30,723 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-07 13:17:30,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-07 13:17:30,724 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:17:30,724 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:17:30,724 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 13:17:30,725 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:17:30,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:17:30,725 INFO L85 PathProgramCache]: Analyzing trace with hash -73515422, now seen corresponding path program 1 times [2022-04-07 13:17:30,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:17:30,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122480515] [2022-04-07 13:17:30,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:17:30,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:17:30,755 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:17:30,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1880526327] [2022-04-07 13:17:30,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:17:30,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:17:30,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:17:30,763 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 13:17:30,778 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 13:17:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:17:30,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-07 13:17:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:17:30,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:17:31,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {195#true} call ULTIMATE.init(); {195#true} is VALID [2022-04-07 13:17:31,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {195#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(10, 2); {195#true} is VALID [2022-04-07 13:17:31,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {195#true} assume true; {195#true} is VALID [2022-04-07 13:17:31,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {195#true} {195#true} #84#return; {195#true} is VALID [2022-04-07 13:17:31,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {195#true} call #t~ret2 := main(); {195#true} is VALID [2022-04-07 13:17:31,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {195#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {195#true} is VALID [2022-04-07 13:17:31,295 INFO L272 TraceCheckUtils]: 6: Hoare triple {195#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 2 then 1 else 0)); {195#true} is VALID [2022-04-07 13:17:31,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {195#true} ~cond := #in~cond; {195#true} is VALID [2022-04-07 13:17:31,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {195#true} assume !(0 == ~cond); {195#true} is VALID [2022-04-07 13:17:31,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {195#true} assume true; {195#true} is VALID [2022-04-07 13:17:31,297 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {195#true} {195#true} #78#return; {195#true} is VALID [2022-04-07 13:17:31,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {195#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {233#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 13:17:31,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {233#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {233#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 13:17:31,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {233#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {240#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 13:17:31,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {240#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {240#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 13:17:31,301 INFO L272 TraceCheckUtils]: 15: Hoare triple {240#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {247#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:17:31,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {247#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {251#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:17:31,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {251#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {196#false} is VALID [2022-04-07 13:17:31,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {196#false} assume !false; {196#false} is VALID [2022-04-07 13:17:31,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:17:31,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:17:31,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:17:31,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122480515] [2022-04-07 13:17:31,304 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:17:31,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880526327] [2022-04-07 13:17:31,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880526327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:17:31,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:17:31,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 13:17:31,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017506156] [2022-04-07 13:17:31,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:17:31,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-04-07 13:17:31,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:17:31,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:17:31,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:17:31,334 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 13:17:31,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:17:31,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 13:17:31,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-07 13:17:31,336 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:17:31,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:17:31,553 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-07 13:17:31,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 13:17:31,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-04-07 13:17:31,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:17:31,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:17:31,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-07 13:17:31,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:17:31,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-07 13:17:31,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-07 13:17:31,602 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 13:17:31,603 INFO L225 Difference]: With dead ends: 37 [2022-04-07 13:17:31,604 INFO L226 Difference]: Without dead ends: 34 [2022-04-07 13:17:31,604 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-07 13:17:31,605 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 13:17:31,606 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 92 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 13:17:31,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-07 13:17:31,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-07 13:17:31,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:17:31,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 13:17:31,618 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 13:17:31,621 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 13:17:31,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:17:31,625 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-07 13:17:31,626 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-07 13:17:31,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:17:31,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:17:31,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-07 13:17:31,627 INFO L87 Difference]: Start difference. First operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-07 13:17:31,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:17:31,632 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-07 13:17:31,632 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-07 13:17:31,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:17:31,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:17:31,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:17:31,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:17:31,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 13:17:31,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-07 13:17:31,636 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 19 [2022-04-07 13:17:31,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:17:31,637 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-07 13:17:31,637 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:17:31,637 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-07 13:17:31,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 13:17:31,638 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:17:31,638 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:17:31,666 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 13:17:31,851 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 13:17:31,851 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:17:31,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:17:31,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1211706883, now seen corresponding path program 1 times [2022-04-07 13:17:31,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:17:31,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125417700] [2022-04-07 13:17:31,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:17:31,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:17:31,867 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:17:31,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [310901475] [2022-04-07 13:17:31,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:17:31,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:17:31,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:17:31,870 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 13:17:31,875 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 13:17:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:17:31,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-07 13:17:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:17:31,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:17:32,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {425#true} call ULTIMATE.init(); {425#true} is VALID [2022-04-07 13:17:32,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#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(10, 2); {425#true} is VALID [2022-04-07 13:17:32,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {425#true} assume true; {425#true} is VALID [2022-04-07 13:17:32,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {425#true} {425#true} #84#return; {425#true} is VALID [2022-04-07 13:17:32,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {425#true} call #t~ret2 := main(); {425#true} is VALID [2022-04-07 13:17:32,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {425#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {425#true} is VALID [2022-04-07 13:17:32,469 INFO L272 TraceCheckUtils]: 6: Hoare triple {425#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 2 then 1 else 0)); {425#true} is VALID [2022-04-07 13:17:32,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {425#true} ~cond := #in~cond; {451#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 13:17:32,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {451#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {455#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 13:17:32,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {455#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {455#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 13:17:32,478 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {455#(not (= |assume_abort_if_not_#in~cond| 0))} {425#true} #78#return; {462#(<= (mod main_~A~0 4294967296) 2)} is VALID [2022-04-07 13:17:32,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {462#(<= (mod main_~A~0 4294967296) 2)} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {466#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-07 13:17:32,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {466#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} assume !false; {466#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-07 13:17:32,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {466#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {473#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-07 13:17:32,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {473#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} assume !false; {473#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-07 13:17:32,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {473#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {473#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-07 13:17:32,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {473#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} assume !false; {473#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-07 13:17:32,485 INFO L272 TraceCheckUtils]: 17: Hoare triple {473#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {486#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:17:32,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {486#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {490#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:17:32,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {490#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {426#false} is VALID [2022-04-07 13:17:32,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {426#false} assume !false; {426#false} is VALID [2022-04-07 13:17:32,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:17:32,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:17:33,062 INFO L290 TraceCheckUtils]: 20: Hoare triple {426#false} assume !false; {426#false} is VALID [2022-04-07 13:17:33,062 INFO L290 TraceCheckUtils]: 19: Hoare triple {490#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {426#false} is VALID [2022-04-07 13:17:33,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {486#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {490#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:17:33,065 INFO L272 TraceCheckUtils]: 17: Hoare triple {506#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {486#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:17:33,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {506#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !false; {506#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-07 13:17:33,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {506#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {506#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-07 13:17:33,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {506#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !false; {506#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-07 13:17:33,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {519#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {506#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-07 13:17:33,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {519#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} assume !false; {519#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-07 13:17:33,068 INFO L290 TraceCheckUtils]: 11: Hoare triple {425#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {519#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-07 13:17:33,068 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {425#true} {425#true} #78#return; {425#true} is VALID [2022-04-07 13:17:33,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {425#true} assume true; {425#true} is VALID [2022-04-07 13:17:33,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {425#true} assume !(0 == ~cond); {425#true} is VALID [2022-04-07 13:17:33,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {425#true} ~cond := #in~cond; {425#true} is VALID [2022-04-07 13:17:33,069 INFO L272 TraceCheckUtils]: 6: Hoare triple {425#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 2 then 1 else 0)); {425#true} is VALID [2022-04-07 13:17:33,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {425#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {425#true} is VALID [2022-04-07 13:17:33,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {425#true} call #t~ret2 := main(); {425#true} is VALID [2022-04-07 13:17:33,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {425#true} {425#true} #84#return; {425#true} is VALID [2022-04-07 13:17:33,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {425#true} assume true; {425#true} is VALID [2022-04-07 13:17:33,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#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(10, 2); {425#true} is VALID [2022-04-07 13:17:33,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {425#true} call ULTIMATE.init(); {425#true} is VALID [2022-04-07 13:17:33,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:17:33,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:17:33,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125417700] [2022-04-07 13:17:33,070 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:17:33,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310901475] [2022-04-07 13:17:33,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310901475] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 13:17:33,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 13:17:33,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-07 13:17:33,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951880136] [2022-04-07 13:17:33,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:17:33,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-07 13:17:33,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:17:33,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:17:35,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 20 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 13:17:35,136 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 13:17:35,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:17:35,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 13:17:35,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-07 13:17:35,137 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:17:35,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:17:35,313 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-07 13:17:35,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 13:17:35,313 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-07 13:17:35,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:17:35,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:17:35,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-07 13:17:35,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:17:35,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-07 13:17:35,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-07 13:17:36,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:17:36,368 INFO L225 Difference]: With dead ends: 42 [2022-04-07 13:17:36,368 INFO L226 Difference]: Without dead ends: 40 [2022-04-07 13:17:36,369 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-07 13:17:36,370 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 13:17:36,370 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 98 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 16 Unchecked, 0.0s Time] [2022-04-07 13:17:36,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-07 13:17:36,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-07 13:17:36,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:17:36,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 13:17:36,379 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 13:17:36,379 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 13:17:36,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:17:36,381 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-07 13:17:36,381 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-04-07 13:17:36,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:17:36,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:17:36,382 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-07 13:17:36,383 INFO L87 Difference]: Start difference. First operand has 40 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-07 13:17:36,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:17:36,385 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-07 13:17:36,385 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-04-07 13:17:36,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:17:36,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:17:36,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:17:36,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:17:36,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 13:17:36,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-04-07 13:17:36,387 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 21 [2022-04-07 13:17:36,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:17:36,388 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-04-07 13:17:36,388 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:17:36,388 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-04-07 13:17:36,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 13:17:36,389 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:17:36,389 INFO L499 BasicCegarLoop]: trace histogram [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 13:17:36,415 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 13:17:36,592 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 13:17:36,592 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:17:36,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:17:36,593 INFO L85 PathProgramCache]: Analyzing trace with hash 947727214, now seen corresponding path program 1 times [2022-04-07 13:17:36,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:17:36,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612711244] [2022-04-07 13:17:36,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:17:36,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:17:36,619 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:17:36,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1174891178] [2022-04-07 13:17:36,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:17:36,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:17:36,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:17:36,636 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 13:17:36,668 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 13:17:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:17:36,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 13:17:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:17:36,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:17:36,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {755#true} call ULTIMATE.init(); {755#true} is VALID [2022-04-07 13:17:36,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {755#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(10, 2); {755#true} is VALID [2022-04-07 13:17:36,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {755#true} assume true; {755#true} is VALID [2022-04-07 13:17:36,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {755#true} {755#true} #84#return; {755#true} is VALID [2022-04-07 13:17:36,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {755#true} call #t~ret2 := main(); {755#true} is VALID [2022-04-07 13:17:36,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {755#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {755#true} is VALID [2022-04-07 13:17:36,833 INFO L272 TraceCheckUtils]: 6: Hoare triple {755#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 2 then 1 else 0)); {755#true} is VALID [2022-04-07 13:17:36,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {755#true} ~cond := #in~cond; {755#true} is VALID [2022-04-07 13:17:36,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {755#true} assume !(0 == ~cond); {755#true} is VALID [2022-04-07 13:17:36,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {755#true} assume true; {755#true} is VALID [2022-04-07 13:17:36,833 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {755#true} {755#true} #78#return; {755#true} is VALID [2022-04-07 13:17:36,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {755#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {793#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-07 13:17:36,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {793#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {793#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-07 13:17:36,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {793#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {793#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-07 13:17:36,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {793#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {793#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-07 13:17:36,836 INFO L272 TraceCheckUtils]: 15: Hoare triple {793#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {755#true} is VALID [2022-04-07 13:17:36,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {755#true} ~cond := #in~cond; {755#true} is VALID [2022-04-07 13:17:36,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {755#true} assume !(0 == ~cond); {755#true} is VALID [2022-04-07 13:17:36,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {755#true} assume true; {755#true} is VALID [2022-04-07 13:17:36,837 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {755#true} {793#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #80#return; {793#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-07 13:17:36,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {793#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {756#false} is VALID [2022-04-07 13:17:36,838 INFO L290 TraceCheckUtils]: 21: Hoare triple {756#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {756#false} is VALID [2022-04-07 13:17:36,838 INFO L290 TraceCheckUtils]: 22: Hoare triple {756#false} assume !false; {756#false} is VALID [2022-04-07 13:17:36,838 INFO L272 TraceCheckUtils]: 23: Hoare triple {756#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {756#false} is VALID [2022-04-07 13:17:36,838 INFO L290 TraceCheckUtils]: 24: Hoare triple {756#false} ~cond := #in~cond; {756#false} is VALID [2022-04-07 13:17:36,838 INFO L290 TraceCheckUtils]: 25: Hoare triple {756#false} assume 0 == ~cond; {756#false} is VALID [2022-04-07 13:17:36,838 INFO L290 TraceCheckUtils]: 26: Hoare triple {756#false} assume !false; {756#false} is VALID [2022-04-07 13:17:36,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:17:36,839 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:17:36,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:17:36,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612711244] [2022-04-07 13:17:36,839 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:17:36,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174891178] [2022-04-07 13:17:36,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174891178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:17:36,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:17:36,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 13:17:36,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027188277] [2022-04-07 13:17:36,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:17:36,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-07 13:17:36,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:17:36,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 13:17:36,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:17:36,862 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 13:17:36,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:17:36,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 13:17:36,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 13:17:36,863 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 13:17:36,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:17:36,915 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2022-04-07 13:17:36,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 13:17:36,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-07 13:17:36,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:17:36,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 13:17:36,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-07 13:17:36,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 13:17:36,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-07 13:17:36,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2022-04-07 13:17:36,963 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 13:17:36,964 INFO L225 Difference]: With dead ends: 51 [2022-04-07 13:17:36,964 INFO L226 Difference]: Without dead ends: 33 [2022-04-07 13:17:36,965 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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 13:17:36,965 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 13:17:36,966 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 13:17:36,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-07 13:17:36,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-07 13:17:36,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:17:36,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 13:17:36,972 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 13:17:36,972 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 13:17:36,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:17:36,974 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-07 13:17:36,974 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-07 13:17:36,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:17:36,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:17:36,975 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-04-07 13:17:36,975 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-04-07 13:17:36,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:17:36,977 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-07 13:17:36,977 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-07 13:17:36,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:17:36,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:17:36,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:17:36,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:17:36,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 13:17:36,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-07 13:17:36,979 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 27 [2022-04-07 13:17:36,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:17:36,980 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-07 13:17:36,980 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 13:17:36,980 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-07 13:17:36,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 13:17:36,981 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:17:36,981 INFO L499 BasicCegarLoop]: trace histogram [2, 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 13:17:37,010 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 13:17:37,207 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 13:17:37,208 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:17:37,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:17:37,208 INFO L85 PathProgramCache]: Analyzing trace with hash 608527918, now seen corresponding path program 1 times [2022-04-07 13:17:37,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:17:37,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324582686] [2022-04-07 13:17:37,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:17:37,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:17:37,224 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:17:37,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [582442953] [2022-04-07 13:17:37,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:17:37,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:17:37,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:17:37,226 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 13:17:37,229 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 13:17:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:17:37,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 13:17:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:17:37,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:17:37,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {1019#true} call ULTIMATE.init(); {1019#true} is VALID [2022-04-07 13:17:37,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {1019#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(10, 2); {1019#true} is VALID [2022-04-07 13:17:37,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {1019#true} assume true; {1019#true} is VALID [2022-04-07 13:17:37,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1019#true} {1019#true} #84#return; {1019#true} is VALID [2022-04-07 13:17:37,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {1019#true} call #t~ret2 := main(); {1019#true} is VALID [2022-04-07 13:17:37,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {1019#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {1019#true} is VALID [2022-04-07 13:17:37,515 INFO L272 TraceCheckUtils]: 6: Hoare triple {1019#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 2 then 1 else 0)); {1019#true} is VALID [2022-04-07 13:17:37,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {1019#true} ~cond := #in~cond; {1019#true} is VALID [2022-04-07 13:17:37,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {1019#true} assume !(0 == ~cond); {1019#true} is VALID [2022-04-07 13:17:37,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {1019#true} assume true; {1019#true} is VALID [2022-04-07 13:17:37,516 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1019#true} {1019#true} #78#return; {1019#true} is VALID [2022-04-07 13:17:37,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {1019#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1019#true} is VALID [2022-04-07 13:17:37,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {1019#true} assume !false; {1019#true} is VALID [2022-04-07 13:17:37,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {1019#true} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1019#true} is VALID [2022-04-07 13:17:37,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {1019#true} assume !false; {1019#true} is VALID [2022-04-07 13:17:37,516 INFO L290 TraceCheckUtils]: 15: Hoare triple {1019#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1019#true} is VALID [2022-04-07 13:17:37,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {1019#true} assume !false; {1019#true} is VALID [2022-04-07 13:17:37,517 INFO L272 TraceCheckUtils]: 17: Hoare triple {1019#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1019#true} is VALID [2022-04-07 13:17:37,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {1019#true} ~cond := #in~cond; {1078#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:17:37,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {1078#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1082#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:17:37,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {1082#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1082#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:17:37,522 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1082#(not (= |__VERIFIER_assert_#in~cond| 0))} {1019#true} #80#return; {1089#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-07 13:17:37,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {1089#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !(~b~0 % 4294967296 != ~B~0 % 4294967296); {1089#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-07 13:17:37,524 INFO L272 TraceCheckUtils]: 23: Hoare triple {1089#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1096#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-07 13:17:37,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {1096#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1100#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-07 13:17:37,525 INFO L290 TraceCheckUtils]: 25: Hoare triple {1100#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {1020#false} is VALID [2022-04-07 13:17:37,525 INFO L290 TraceCheckUtils]: 26: Hoare triple {1020#false} assume !false; {1020#false} is VALID [2022-04-07 13:17:37,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-07 13:17:37,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:17:38,480 INFO L290 TraceCheckUtils]: 26: Hoare triple {1020#false} assume !false; {1020#false} is VALID [2022-04-07 13:17:38,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {1110#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1020#false} is VALID [2022-04-07 13:17:38,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {1082#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1110#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 13:17:38,482 INFO L272 TraceCheckUtils]: 23: Hoare triple {1089#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1082#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:17:38,483 INFO L290 TraceCheckUtils]: 22: Hoare triple {1089#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !(~b~0 % 4294967296 != ~B~0 % 4294967296); {1089#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-07 13:17:38,484 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1082#(not (= |__VERIFIER_assert_#in~cond| 0))} {1019#true} #80#return; {1089#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-07 13:17:38,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {1082#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1082#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:17:38,485 INFO L290 TraceCheckUtils]: 19: Hoare triple {1132#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1082#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:17:38,485 INFO L290 TraceCheckUtils]: 18: Hoare triple {1019#true} ~cond := #in~cond; {1132#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 13:17:38,485 INFO L272 TraceCheckUtils]: 17: Hoare triple {1019#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1019#true} is VALID [2022-04-07 13:17:38,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {1019#true} assume !false; {1019#true} is VALID [2022-04-07 13:17:38,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {1019#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1019#true} is VALID [2022-04-07 13:17:38,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {1019#true} assume !false; {1019#true} is VALID [2022-04-07 13:17:38,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {1019#true} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1019#true} is VALID [2022-04-07 13:17:38,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {1019#true} assume !false; {1019#true} is VALID [2022-04-07 13:17:38,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {1019#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1019#true} is VALID [2022-04-07 13:17:38,486 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1019#true} {1019#true} #78#return; {1019#true} is VALID [2022-04-07 13:17:38,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {1019#true} assume true; {1019#true} is VALID [2022-04-07 13:17:38,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {1019#true} assume !(0 == ~cond); {1019#true} is VALID [2022-04-07 13:17:38,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {1019#true} ~cond := #in~cond; {1019#true} is VALID [2022-04-07 13:17:38,487 INFO L272 TraceCheckUtils]: 6: Hoare triple {1019#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 2 then 1 else 0)); {1019#true} is VALID [2022-04-07 13:17:38,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {1019#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {1019#true} is VALID [2022-04-07 13:17:38,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {1019#true} call #t~ret2 := main(); {1019#true} is VALID [2022-04-07 13:17:38,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1019#true} {1019#true} #84#return; {1019#true} is VALID [2022-04-07 13:17:38,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {1019#true} assume true; {1019#true} is VALID [2022-04-07 13:17:38,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {1019#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(10, 2); {1019#true} is VALID [2022-04-07 13:17:38,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {1019#true} call ULTIMATE.init(); {1019#true} is VALID [2022-04-07 13:17:38,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-07 13:17:38,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:17:38,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324582686] [2022-04-07 13:17:38,488 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:17:38,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582442953] [2022-04-07 13:17:38,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582442953] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:17:38,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 13:17:38,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-04-07 13:17:38,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205186907] [2022-04-07 13:17:38,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 13:17:38,489 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-04-07 13:17:38,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:17:38,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 13:17:38,522 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 13:17:38,522 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 13:17:38,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:17:38,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 13:17:38,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-07 13:17:38,523 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 13:17:40,733 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 13:17:40,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:17:40,985 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-07 13:17:40,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 13:17:40,985 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-04-07 13:17:40,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:17:40,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 13:17:40,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-04-07 13:17:40,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 13:17:40,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-04-07 13:17:40,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 35 transitions. [2022-04-07 13:17:41,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:17:41,021 INFO L225 Difference]: With dead ends: 39 [2022-04-07 13:17:41,021 INFO L226 Difference]: Without dead ends: 32 [2022-04-07 13:17:41,021 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-07 13:17:41,022 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-07 13:17:41,022 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 97 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-07 13:17:41,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-07 13:17:41,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-07 13:17:41,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:17:41,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 13:17:41,028 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 13:17:41,028 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 13:17:41,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:17:41,029 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-07 13:17:41,030 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-07 13:17:41,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:17:41,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:17:41,030 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 32 states. [2022-04-07 13:17:41,030 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 32 states. [2022-04-07 13:17:41,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:17:41,032 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-07 13:17:41,032 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-07 13:17:41,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:17:41,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:17:41,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:17:41,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:17:41,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 13:17:41,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-04-07 13:17:41,034 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 27 [2022-04-07 13:17:41,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:17:41,035 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-04-07 13:17:41,035 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 13:17:41,035 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-07 13:17:41,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 13:17:41,036 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:17:41,036 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:17:41,062 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 13:17:41,251 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 13:17:41,251 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:17:41,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:17:41,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1574040585, now seen corresponding path program 1 times [2022-04-07 13:17:41,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:17:41,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921855104] [2022-04-07 13:17:41,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:17:41,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:17:41,265 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:17:41,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [839394415] [2022-04-07 13:17:41,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:17:41,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:17:41,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:17:41,266 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 13:17:41,280 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 13:17:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:17:41,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-07 13:17:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:17:41,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:17:42,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {1354#true} call ULTIMATE.init(); {1354#true} is VALID [2022-04-07 13:17:42,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {1354#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(10, 2); {1354#true} is VALID [2022-04-07 13:17:42,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {1354#true} assume true; {1354#true} is VALID [2022-04-07 13:17:42,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1354#true} {1354#true} #84#return; {1354#true} is VALID [2022-04-07 13:17:42,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {1354#true} call #t~ret2 := main(); {1354#true} is VALID [2022-04-07 13:17:42,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {1354#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {1354#true} is VALID [2022-04-07 13:17:42,394 INFO L272 TraceCheckUtils]: 6: Hoare triple {1354#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 2 then 1 else 0)); {1354#true} is VALID [2022-04-07 13:17:42,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {1354#true} ~cond := #in~cond; {1380#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 13:17:42,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {1380#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1384#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 13:17:42,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {1384#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1384#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 13:17:42,397 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1384#(not (= |assume_abort_if_not_#in~cond| 0))} {1354#true} #78#return; {1391#(<= (mod main_~A~0 4294967296) 2)} is VALID [2022-04-07 13:17:42,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {1391#(<= (mod main_~A~0 4294967296) 2)} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1395#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-07 13:17:42,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {1395#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} assume !false; {1395#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-07 13:17:42,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {1395#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1402#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-07 13:17:42,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {1402#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} assume !false; {1402#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} is VALID [2022-04-07 13:17:42,399 INFO L290 TraceCheckUtils]: 15: Hoare triple {1402#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0) (<= (mod main_~A~0 4294967296) 2))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1409#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-07 13:17:42,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {1409#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !false; {1409#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-07 13:17:42,400 INFO L272 TraceCheckUtils]: 17: Hoare triple {1409#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1354#true} is VALID [2022-04-07 13:17:42,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {1354#true} ~cond := #in~cond; {1354#true} is VALID [2022-04-07 13:17:42,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {1354#true} assume !(0 == ~cond); {1354#true} is VALID [2022-04-07 13:17:42,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {1354#true} assume true; {1354#true} is VALID [2022-04-07 13:17:42,401 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1354#true} {1409#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} #80#return; {1409#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-07 13:17:42,402 INFO L290 TraceCheckUtils]: 22: Hoare triple {1409#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1431#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (< (mod main_~r~0 4294967296) 2) (= main_~q~0 0))} is VALID [2022-04-07 13:17:42,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {1431#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (< (mod main_~r~0 4294967296) 2) (= main_~q~0 0))} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1435#(and (= main_~b~0 1) (<= 1 (mod (+ main_~b~0 main_~r~0) 4294967296)) (< (mod (+ main_~b~0 main_~r~0) 4294967296) 2) (= main_~A~0 (+ main_~b~0 main_~r~0)) (= main_~q~0 1))} is VALID [2022-04-07 13:17:42,404 INFO L290 TraceCheckUtils]: 24: Hoare triple {1435#(and (= main_~b~0 1) (<= 1 (mod (+ main_~b~0 main_~r~0) 4294967296)) (< (mod (+ main_~b~0 main_~r~0) 4294967296) 2) (= main_~A~0 (+ main_~b~0 main_~r~0)) (= main_~q~0 1))} assume !false; {1435#(and (= main_~b~0 1) (<= 1 (mod (+ main_~b~0 main_~r~0) 4294967296)) (< (mod (+ main_~b~0 main_~r~0) 4294967296) 2) (= main_~A~0 (+ main_~b~0 main_~r~0)) (= main_~q~0 1))} is VALID [2022-04-07 13:17:42,406 INFO L272 TraceCheckUtils]: 25: Hoare triple {1435#(and (= main_~b~0 1) (<= 1 (mod (+ main_~b~0 main_~r~0) 4294967296)) (< (mod (+ main_~b~0 main_~r~0) 4294967296) 2) (= main_~A~0 (+ main_~b~0 main_~r~0)) (= main_~q~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1442#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:17:42,406 INFO L290 TraceCheckUtils]: 26: Hoare triple {1442#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1446#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:17:42,406 INFO L290 TraceCheckUtils]: 27: Hoare triple {1446#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1355#false} is VALID [2022-04-07 13:17:42,407 INFO L290 TraceCheckUtils]: 28: Hoare triple {1355#false} assume !false; {1355#false} is VALID [2022-04-07 13:17:42,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:17:42,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:17:53,305 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~b~0 4294967296))) (or (= (mod c_main_~A~0 4294967296) (mod (+ (* (div .cse0 2) (* c_main_~q~0 2)) c_main_~r~0) 4294967296)) (<= .cse0 (mod c_main_~r~0 4294967296)))) is different from true [2022-04-07 13:18:06,035 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (* c_main_~b~0 2) 4294967296)) (.cse0 (mod c_main_~r~0 4294967296))) (or (not (<= (mod c_main_~b~0 4294967296) .cse0)) (= (mod c_main_~A~0 4294967296) (mod (+ (* (div .cse1 2) (* c_main_~q~0 2)) c_main_~r~0) 4294967296)) (<= .cse1 .cse0))) is different from true [2022-04-07 13:18:16,878 INFO L290 TraceCheckUtils]: 28: Hoare triple {1355#false} assume !false; {1355#false} is VALID [2022-04-07 13:18:16,879 INFO L290 TraceCheckUtils]: 27: Hoare triple {1446#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1355#false} is VALID [2022-04-07 13:18:16,879 INFO L290 TraceCheckUtils]: 26: Hoare triple {1442#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1446#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:18:16,880 INFO L272 TraceCheckUtils]: 25: Hoare triple {1462#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1442#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:18:16,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {1462#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !false; {1462#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-07 13:18:18,887 WARN L290 TraceCheckUtils]: 23: Hoare triple {1462#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1462#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is UNKNOWN [2022-04-07 13:18:21,033 WARN L290 TraceCheckUtils]: 22: Hoare triple {1472#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1462#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is UNKNOWN [2022-04-07 13:18:21,034 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1354#true} {1472#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} #80#return; {1472#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} is VALID [2022-04-07 13:18:21,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {1354#true} assume true; {1354#true} is VALID [2022-04-07 13:18:21,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {1354#true} assume !(0 == ~cond); {1354#true} is VALID [2022-04-07 13:18:21,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {1354#true} ~cond := #in~cond; {1354#true} is VALID [2022-04-07 13:18:21,034 INFO L272 TraceCheckUtils]: 17: Hoare triple {1472#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1354#true} is VALID [2022-04-07 13:18:21,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {1472#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} assume !false; {1472#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} is VALID [2022-04-07 13:18:21,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {1494#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1472#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} is VALID [2022-04-07 13:18:21,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {1494#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !false; {1494#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-07 13:18:23,168 WARN L290 TraceCheckUtils]: 13: Hoare triple {1501#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1494#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is UNKNOWN [2022-04-07 13:18:23,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {1501#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} assume !false; {1501#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-07 13:18:23,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {1354#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1501#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-07 13:18:23,171 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1354#true} {1354#true} #78#return; {1354#true} is VALID [2022-04-07 13:18:23,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {1354#true} assume true; {1354#true} is VALID [2022-04-07 13:18:23,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {1354#true} assume !(0 == ~cond); {1354#true} is VALID [2022-04-07 13:18:23,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {1354#true} ~cond := #in~cond; {1354#true} is VALID [2022-04-07 13:18:23,172 INFO L272 TraceCheckUtils]: 6: Hoare triple {1354#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 2 then 1 else 0)); {1354#true} is VALID [2022-04-07 13:18:23,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {1354#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {1354#true} is VALID [2022-04-07 13:18:23,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {1354#true} call #t~ret2 := main(); {1354#true} is VALID [2022-04-07 13:18:23,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1354#true} {1354#true} #84#return; {1354#true} is VALID [2022-04-07 13:18:23,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {1354#true} assume true; {1354#true} is VALID [2022-04-07 13:18:23,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {1354#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(10, 2); {1354#true} is VALID [2022-04-07 13:18:23,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {1354#true} call ULTIMATE.init(); {1354#true} is VALID [2022-04-07 13:18:23,172 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-04-07 13:18:23,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:18:23,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921855104] [2022-04-07 13:18:23,173 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:18:23,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839394415] [2022-04-07 13:18:23,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839394415] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:18:23,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 13:18:23,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2022-04-07 13:18:23,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846623905] [2022-04-07 13:18:23,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 13:18:23,174 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 29 [2022-04-07 13:18:23,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:18:23,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 13:18:29,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 42 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-07 13:18:29,397 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-07 13:18:29,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:18:29,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-07 13:18:29,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=142, Unknown=3, NotChecked=50, Total=240 [2022-04-07 13:18:29,398 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 13:18:40,813 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 13:18:43,168 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 13:18:45,303 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 13:18:49,775 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 13:18:52,034 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:18:54,538 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 13:18:56,884 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 13:18:59,227 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 13:19:06,159 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:19:08,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:19:08,620 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-04-07 13:19:08,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-07 13:19:08,620 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 29 [2022-04-07 13:19:08,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:19:08,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 13:19:08,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2022-04-07 13:19:08,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 13:19:08,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2022-04-07 13:19:08,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 73 transitions. [2022-04-07 13:19:12,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 71 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 13:19:12,817 INFO L225 Difference]: With dead ends: 69 [2022-04-07 13:19:12,817 INFO L226 Difference]: Without dead ends: 59 [2022-04-07 13:19:12,818 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=62, Invalid=215, Unknown=3, NotChecked=62, Total=342 [2022-04-07 13:19:12,818 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 14 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2022-04-07 13:19:12,819 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 191 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 190 Invalid, 9 Unknown, 76 Unchecked, 20.5s Time] [2022-04-07 13:19:12,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-07 13:19:12,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2022-04-07 13:19:12,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:19:12,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 48 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 13:19:12,835 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 48 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 13:19:12,836 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 48 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 13:19:12,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:19:12,838 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2022-04-07 13:19:12,838 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-04-07 13:19:12,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:19:12,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:19:12,839 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 59 states. [2022-04-07 13:19:12,839 INFO L87 Difference]: Start difference. First operand has 48 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 59 states. [2022-04-07 13:19:12,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:19:12,841 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2022-04-07 13:19:12,841 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-04-07 13:19:12,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:19:12,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:19:12,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:19:12,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:19:12,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 13:19:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2022-04-07 13:19:12,844 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 29 [2022-04-07 13:19:12,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:19:12,844 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2022-04-07 13:19:12,844 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 13:19:12,844 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-04-07 13:19:12,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-07 13:19:12,845 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:19:12,845 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:19:12,852 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 13:19:13,049 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 13:19:13,050 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:19:13,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:19:13,050 INFO L85 PathProgramCache]: Analyzing trace with hash -414186241, now seen corresponding path program 2 times [2022-04-07 13:19:13,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:19:13,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658125740] [2022-04-07 13:19:13,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:19:13,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:19:13,064 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:19:13,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1315320800] [2022-04-07 13:19:13,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 13:19:13,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:19:13,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:19:13,066 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 13:19:13,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process