/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/dijkstra-u_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:17:46,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:17:46,273 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:17:46,305 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:17:46,306 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:17:46,306 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:17:46,307 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:17:46,309 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:17:46,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:17:46,310 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:17:46,314 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:17:46,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:17:46,318 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:17:46,324 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:17:46,325 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:17:46,327 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:17:46,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:17:46,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:17:46,334 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:17:46,335 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:17:46,336 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:17:46,338 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:17:46,338 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:17:46,339 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:17:46,339 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:17:46,341 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:17:46,341 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:17:46,341 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:17:46,342 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:17:46,342 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:17:46,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:17:46,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:17:46,343 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:17:46,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:17:46,344 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:17:46,344 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:17:46,344 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:17:46,345 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:17:46,345 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:17:46,345 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:17:46,346 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:17:46,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:17:46,347 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 12:17:46,374 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:17:46,375 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:17:46,375 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:17:46,375 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:17:46,376 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:17:46,376 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:17:46,376 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:17:46,376 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:17:46,376 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:17:46,377 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:17:46,377 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:17:46,377 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:17:46,377 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:17:46,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:17:46,377 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:17:46,378 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:17:46,378 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:17:46,378 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:17:46,378 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:17:46,378 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:17:46,378 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:17:46,378 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:17:46,378 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:17:46,378 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:17:46,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:17:46,378 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:17:46,379 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:17:46,379 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:17:46,379 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:17:46,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:17:46,379 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:17:46,379 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:17:46,379 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:17:46,379 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 12:17:46,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:17:46,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:17:46,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:17:46,592 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:17:46,593 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:17:46,594 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound50.c [2022-04-27 12:17:46,646 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de25db852/9bfb1930bd074cba8c7808db88c9a27b/FLAGa1c9abe0f [2022-04-27 12:17:46,989 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:17:46,989 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound50.c [2022-04-27 12:17:46,994 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de25db852/9bfb1930bd074cba8c7808db88c9a27b/FLAGa1c9abe0f [2022-04-27 12:17:47,006 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de25db852/9bfb1930bd074cba8c7808db88c9a27b [2022-04-27 12:17:47,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:17:47,009 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:17:47,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:17:47,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:17:47,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:17:47,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:17:47" (1/1) ... [2022-04-27 12:17:47,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28184f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:47, skipping insertion in model container [2022-04-27 12:17:47,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:17:47" (1/1) ... [2022-04-27 12:17:47,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:17:47,028 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:17:47,200 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/dijkstra-u_unwindbound50.c[525,538] [2022-04-27 12:17:47,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:17:47,247 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:17:47,255 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/dijkstra-u_unwindbound50.c[525,538] [2022-04-27 12:17:47,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:17:47,277 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:17:47,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:47 WrapperNode [2022-04-27 12:17:47,278 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:17:47,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:17:47,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:17:47,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:17:47,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:47" (1/1) ... [2022-04-27 12:17:47,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:47" (1/1) ... [2022-04-27 12:17:47,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:47" (1/1) ... [2022-04-27 12:17:47,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:47" (1/1) ... [2022-04-27 12:17:47,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:47" (1/1) ... [2022-04-27 12:17:47,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:47" (1/1) ... [2022-04-27 12:17:47,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:47" (1/1) ... [2022-04-27 12:17:47,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:17:47,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:17:47,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:17:47,311 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:17:47,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:47" (1/1) ... [2022-04-27 12:17:47,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:17:47,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:17:47,334 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 12:17:47,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 12:17:47,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:17:47,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:17:47,366 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:17:47,366 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:17:47,366 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:17:47,366 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:17:47,366 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:17:47,366 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:17:47,366 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:17:47,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:17:47,367 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 12:17:47,367 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:17:47,367 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:17:47,367 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:17:47,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:17:47,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:17:47,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:17:47,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:17:47,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:17:47,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:17:47,410 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:17:47,412 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:17:47,600 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:17:47,605 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:17:47,605 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:17:47,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:17:47 BoogieIcfgContainer [2022-04-27 12:17:47,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:17:47,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:17:47,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:17:47,610 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:17:47,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:17:47" (1/3) ... [2022-04-27 12:17:47,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a294442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:17:47, skipping insertion in model container [2022-04-27 12:17:47,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:47" (2/3) ... [2022-04-27 12:17:47,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a294442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:17:47, skipping insertion in model container [2022-04-27 12:17:47,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:17:47" (3/3) ... [2022-04-27 12:17:47,612 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound50.c [2022-04-27 12:17:47,622 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:17:47,622 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:17:47,657 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:17:47,662 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@36f5c557, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@637cfbba [2022-04-27 12:17:47,662 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:17:47,671 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:17:47,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 12:17:47,675 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:17:47,676 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:17:47,676 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:17:47,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:17:47,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 1 times [2022-04-27 12:17:47,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:17:47,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235015808] [2022-04-27 12:17:47,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:47,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:17:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:47,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:17:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:47,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-27 12:17:47,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-27 12:17:47,821 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-27 12:17:47,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:17:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:47,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:17:47,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:17:47,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:17:47,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-27 12:17:47,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:17:47,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-27 12:17:47,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-27 12:17:47,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-27 12:17:47,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret7 := main(); {42#true} is VALID [2022-04-27 12:17:47,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {42#true} is VALID [2022-04-27 12:17:47,838 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {42#true} is VALID [2022-04-27 12:17:47,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:17:47,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:17:47,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:17:47,840 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-27 12:17:47,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {43#false} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {43#false} is VALID [2022-04-27 12:17:47,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-27 12:17:47,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-27 12:17:47,841 INFO L272 TraceCheckUtils]: 14: Hoare triple {43#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {43#false} is VALID [2022-04-27 12:17:47,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-27 12:17:47,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-27 12:17:47,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-27 12:17:47,842 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-27 12:17:47,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:17:47,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235015808] [2022-04-27 12:17:47,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235015808] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:17:47,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:17:47,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:17:47,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926240473] [2022-04-27 12:17:47,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:17:47,848 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-27 12:17:47,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:17:47,852 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-27 12:17:47,894 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-27 12:17:47,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:17:47,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:17:47,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:17:47,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:17:47,921 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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-27 12:17:50,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:50,739 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2022-04-27 12:17:50,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:17:50,739 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-27 12:17:50,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:17:50,741 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-27 12:17:50,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-27 12:17:50,748 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-27 12:17:50,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-27 12:17:50,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-27 12:17:50,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:17:50,875 INFO L225 Difference]: With dead ends: 70 [2022-04-27 12:17:50,875 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 12:17:50,878 INFO L412 NwaCegarLoop]: 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-27 12:17:50,882 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:17:50,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:17:50,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 12:17:50,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-27 12:17:50,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:17:50,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:17:50,911 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:17:50,912 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:17:50,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:50,918 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-27 12:17:50,918 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-27 12:17:50,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:50,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:50,919 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-27 12:17:50,920 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-27 12:17:50,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:50,923 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-27 12:17:50,923 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-27 12:17:50,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:50,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:50,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:17:50,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:17:50,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:17:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-27 12:17:50,927 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 18 [2022-04-27 12:17:50,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:17:50,927 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-27 12:17:50,927 INFO L496 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-27 12:17:50,927 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-27 12:17:50,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 12:17:50,928 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:17:50,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:17:50,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:17:50,928 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:17:50,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:17:50,929 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 1 times [2022-04-27 12:17:50,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:17:50,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673104379] [2022-04-27 12:17:50,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:50,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:17:50,948 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:17:50,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1802622548] [2022-04-27 12:17:50,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:50,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:17:50,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:17:50,950 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:17:50,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 12:17:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:51,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:17:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:51,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:17:51,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} call ULTIMATE.init(); {274#true} is VALID [2022-04-27 12:17:51,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:51,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:51,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {282#(<= ~counter~0 0)} {274#true} #102#return; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:51,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {282#(<= ~counter~0 0)} call #t~ret7 := main(); {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:51,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {282#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:51,152 INFO L272 TraceCheckUtils]: 6: Hoare triple {282#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:51,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {282#(<= ~counter~0 0)} ~cond := #in~cond; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:51,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#(<= ~counter~0 0)} assume !(0 == ~cond); {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:51,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:51,154 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {282#(<= ~counter~0 0)} {282#(<= ~counter~0 0)} #82#return; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:51,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {282#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:51,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {282#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {316#(<= |main_#t~post5| 0)} is VALID [2022-04-27 12:17:51,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {316#(<= |main_#t~post5| 0)} assume !(#t~post5 < 50);havoc #t~post5; {275#false} is VALID [2022-04-27 12:17:51,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {275#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {275#false} is VALID [2022-04-27 12:17:51,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {275#false} assume !(#t~post6 < 50);havoc #t~post6; {275#false} is VALID [2022-04-27 12:17:51,156 INFO L272 TraceCheckUtils]: 16: Hoare triple {275#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {275#false} is VALID [2022-04-27 12:17:51,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {275#false} ~cond := #in~cond; {275#false} is VALID [2022-04-27 12:17:51,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {275#false} assume 0 == ~cond; {275#false} is VALID [2022-04-27 12:17:51,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {275#false} assume !false; {275#false} is VALID [2022-04-27 12:17:51,157 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-27 12:17:51,157 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:17:51,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:17:51,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673104379] [2022-04-27 12:17:51,157 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:17:51,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802622548] [2022-04-27 12:17:51,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802622548] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:17:51,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:17:51,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 12:17:51,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595484161] [2022-04-27 12:17:51,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:17:51,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 12:17:51,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:17:51,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:17:51,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:17:51,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 12:17:51,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:17:51,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 12:17:51,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 12:17:51,174 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:17:55,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:55,051 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-27 12:17:55,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 12:17:55,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 12:17:55,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:17:55,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:17:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-27 12:17:55,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:17:55,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-27 12:17:55,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-27 12:17:55,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:17:55,141 INFO L225 Difference]: With dead ends: 55 [2022-04-27 12:17:55,141 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 12:17:55,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 12:17:55,142 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:17:55,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:17:55,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 12:17:55,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-27 12:17:55,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:17:55,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:17:55,151 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:17:55,152 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:17:55,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:55,154 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-27 12:17:55,154 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-27 12:17:55,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:55,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:55,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-27 12:17:55,155 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-27 12:17:55,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:55,157 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-27 12:17:55,158 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-27 12:17:55,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:55,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:55,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:17:55,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:17:55,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:17:55,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-27 12:17:55,160 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2022-04-27 12:17:55,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:17:55,161 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-04-27 12:17:55,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:17:55,161 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-27 12:17:55,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 12:17:55,161 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:17:55,162 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:17:55,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 12:17:55,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:17:55,372 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:17:55,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:17:55,372 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 1 times [2022-04-27 12:17:55,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:17:55,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723983699] [2022-04-27 12:17:55,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:55,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:17:55,386 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:17:55,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1823279059] [2022-04-27 12:17:55,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:55,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:17:55,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:17:55,388 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:17:55,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 12:17:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:55,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:17:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:55,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:17:55,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2022-04-27 12:17:55,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {546#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:55,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:55,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#(<= ~counter~0 0)} {546#true} #102#return; {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:55,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#(<= ~counter~0 0)} call #t~ret7 := main(); {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:55,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:55,558 INFO L272 TraceCheckUtils]: 6: Hoare triple {554#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:55,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#(<= ~counter~0 0)} ~cond := #in~cond; {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:55,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#(<= ~counter~0 0)} assume !(0 == ~cond); {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:55,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:55,560 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#(<= ~counter~0 0)} {554#(<= ~counter~0 0)} #82#return; {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:55,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {554#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:55,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {588#(<= ~counter~0 1)} is VALID [2022-04-27 12:17:55,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {588#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {588#(<= ~counter~0 1)} is VALID [2022-04-27 12:17:55,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {588#(<= ~counter~0 1)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {588#(<= ~counter~0 1)} is VALID [2022-04-27 12:17:55,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {588#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {598#(<= |main_#t~post6| 1)} is VALID [2022-04-27 12:17:55,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {598#(<= |main_#t~post6| 1)} assume !(#t~post6 < 50);havoc #t~post6; {547#false} is VALID [2022-04-27 12:17:55,564 INFO L272 TraceCheckUtils]: 17: Hoare triple {547#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {547#false} is VALID [2022-04-27 12:17:55,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {547#false} ~cond := #in~cond; {547#false} is VALID [2022-04-27 12:17:55,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#false} assume 0 == ~cond; {547#false} is VALID [2022-04-27 12:17:55,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {547#false} assume !false; {547#false} is VALID [2022-04-27 12:17:55,564 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-27 12:17:55,565 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:17:55,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:17:55,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723983699] [2022-04-27 12:17:55,565 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:17:55,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823279059] [2022-04-27 12:17:55,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823279059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:17:55,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:17:55,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:17:55,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569349429] [2022-04-27 12:17:55,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:17:55,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-27 12:17:55,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:17:55,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:17:55,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:17:55,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:17:55,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:17:55,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:17:55,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:17:55,581 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:18:00,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:00,894 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-27 12:18:00,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:18:00,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-27 12:18:00,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:18:00,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:18:00,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 12:18:00,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:18:00,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 12:18:00,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-27 12:18:00,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:18:00,957 INFO L225 Difference]: With dead ends: 49 [2022-04-27 12:18:00,957 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 12:18:00,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:18:00,958 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:18:00,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 120 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:18:00,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 12:18:00,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-27 12:18:00,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:18:00,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:18:00,977 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:18:00,978 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:18:00,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:00,980 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-27 12:18:00,980 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-27 12:18:00,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:00,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:00,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 40 states. [2022-04-27 12:18:00,981 INFO L87 Difference]: Start difference. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 40 states. [2022-04-27 12:18:00,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:00,987 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-27 12:18:00,987 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-27 12:18:00,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:00,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:00,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:18:00,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:18:00,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:18:00,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-04-27 12:18:00,989 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 21 [2022-04-27 12:18:00,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:18:00,990 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-04-27 12:18:00,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:18:00,990 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-04-27 12:18:00,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 12:18:00,990 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:18:00,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:18:01,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 12:18:01,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 12:18:01,203 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:18:01,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:18:01,203 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 1 times [2022-04-27 12:18:01,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:18:01,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467917211] [2022-04-27 12:18:01,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:01,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:18:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:01,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:18:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:01,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {835#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {822#true} is VALID [2022-04-27 12:18:01,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-27 12:18:01,387 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-27 12:18:01,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:18:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:01,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-27 12:18:01,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-27 12:18:01,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-27 12:18:01,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-27 12:18:01,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {822#true} call ULTIMATE.init(); {835#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:18:01,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {835#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {822#true} is VALID [2022-04-27 12:18:01,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-27 12:18:01,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-27 12:18:01,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret7 := main(); {822#true} is VALID [2022-04-27 12:18:01,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {822#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {822#true} is VALID [2022-04-27 12:18:01,396 INFO L272 TraceCheckUtils]: 6: Hoare triple {822#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {822#true} is VALID [2022-04-27 12:18:01,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-27 12:18:01,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-27 12:18:01,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-27 12:18:01,398 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-27 12:18:01,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {822#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 12:18:01,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 12:18:01,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 12:18:01,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-27 12:18:01,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-27 12:18:01,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} assume !!(#t~post6 < 50);havoc #t~post6; {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-27 12:18:01,406 INFO L272 TraceCheckUtils]: 17: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {833#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:18:01,407 INFO L290 TraceCheckUtils]: 18: Hoare triple {833#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {834#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:18:01,407 INFO L290 TraceCheckUtils]: 19: Hoare triple {834#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {823#false} is VALID [2022-04-27 12:18:01,407 INFO L290 TraceCheckUtils]: 20: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-27 12:18:01,407 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-27 12:18:01,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:18:01,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467917211] [2022-04-27 12:18:01,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467917211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:18:01,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:18:01,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 12:18:01,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315735327] [2022-04-27 12:18:01,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:18:01,408 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 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-27 12:18:01,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:18:01,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 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-27 12:18:01,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:18:01,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 12:18:01,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:18:01,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 12:18:01,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 12:18:01,428 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 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-27 12:18:10,258 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-27 12:18:11,587 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:18:13,214 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:18:17,988 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-27 12:18:18,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:18,079 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2022-04-27 12:18:18,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 12:18:18,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 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-27 12:18:18,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:18:18,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 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-27 12:18:18,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-27 12:18:18,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 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-27 12:18:18,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-27 12:18:18,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 104 transitions. [2022-04-27 12:18:18,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:18:18,312 INFO L225 Difference]: With dead ends: 72 [2022-04-27 12:18:18,312 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 12:18:18,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:18:18,313 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 37 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:18:18,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 207 Invalid, 2 Unknown, 0 Unchecked, 12.1s Time] [2022-04-27 12:18:18,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 12:18:18,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-27 12:18:18,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:18:18,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:18:18,326 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:18:18,326 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:18:18,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:18,328 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-27 12:18:18,329 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-27 12:18:18,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:18,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:18,330 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-27 12:18:18,330 INFO L87 Difference]: Start difference. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-27 12:18:18,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:18,332 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-27 12:18:18,332 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-27 12:18:18,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:18,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:18,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:18:18,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:18:18,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:18:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2022-04-27 12:18:18,335 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 21 [2022-04-27 12:18:18,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:18:18,335 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2022-04-27 12:18:18,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 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-27 12:18:18,335 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-27 12:18:18,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 12:18:18,336 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:18:18,336 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:18:18,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 12:18:18,336 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:18:18,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:18:18,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1701877900, now seen corresponding path program 1 times [2022-04-27 12:18:18,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:18:18,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801015155] [2022-04-27 12:18:18,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:18,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:18:18,347 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:18:18,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [481163133] [2022-04-27 12:18:18,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:18,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:18:18,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:18:18,348 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:18:18,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 12:18:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:18,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:18:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:18,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:18:18,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1137#true} is VALID [2022-04-27 12:18:18,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {1137#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:18,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {1145#(<= ~counter~0 0)} assume true; {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:18,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1145#(<= ~counter~0 0)} {1137#true} #102#return; {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:18,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {1145#(<= ~counter~0 0)} call #t~ret7 := main(); {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:18,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {1145#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:18,521 INFO L272 TraceCheckUtils]: 6: Hoare triple {1145#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:18,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {1145#(<= ~counter~0 0)} ~cond := #in~cond; {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:18,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {1145#(<= ~counter~0 0)} assume !(0 == ~cond); {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:18,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {1145#(<= ~counter~0 0)} assume true; {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:18,524 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1145#(<= ~counter~0 0)} {1145#(<= ~counter~0 0)} #82#return; {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:18,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {1145#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:18,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {1145#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1179#(<= ~counter~0 1)} is VALID [2022-04-27 12:18:18,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {1179#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {1179#(<= ~counter~0 1)} is VALID [2022-04-27 12:18:18,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {1179#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1179#(<= ~counter~0 1)} is VALID [2022-04-27 12:18:18,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {1179#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1189#(<= |main_#t~post5| 1)} is VALID [2022-04-27 12:18:18,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {1189#(<= |main_#t~post5| 1)} assume !(#t~post5 < 50);havoc #t~post5; {1138#false} is VALID [2022-04-27 12:18:18,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1138#false} is VALID [2022-04-27 12:18:18,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} assume !(#t~post6 < 50);havoc #t~post6; {1138#false} is VALID [2022-04-27 12:18:18,536 INFO L272 TraceCheckUtils]: 19: Hoare triple {1138#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {1138#false} is VALID [2022-04-27 12:18:18,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} ~cond := #in~cond; {1138#false} is VALID [2022-04-27 12:18:18,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} assume 0 == ~cond; {1138#false} is VALID [2022-04-27 12:18:18,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-27 12:18:18,536 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-27 12:18:18,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:18:18,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-27 12:18:18,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} assume 0 == ~cond; {1138#false} is VALID [2022-04-27 12:18:18,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} ~cond := #in~cond; {1138#false} is VALID [2022-04-27 12:18:18,672 INFO L272 TraceCheckUtils]: 19: Hoare triple {1138#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {1138#false} is VALID [2022-04-27 12:18:18,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} assume !(#t~post6 < 50);havoc #t~post6; {1138#false} is VALID [2022-04-27 12:18:18,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1138#false} is VALID [2022-04-27 12:18:18,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {1229#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {1138#false} is VALID [2022-04-27 12:18:18,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {1233#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1229#(< |main_#t~post5| 50)} is VALID [2022-04-27 12:18:18,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {1233#(< ~counter~0 50)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1233#(< ~counter~0 50)} is VALID [2022-04-27 12:18:18,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {1233#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {1233#(< ~counter~0 50)} is VALID [2022-04-27 12:18:18,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {1243#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1233#(< ~counter~0 50)} is VALID [2022-04-27 12:18:18,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {1243#(< ~counter~0 49)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1243#(< ~counter~0 49)} is VALID [2022-04-27 12:18:18,682 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1137#true} {1243#(< ~counter~0 49)} #82#return; {1243#(< ~counter~0 49)} is VALID [2022-04-27 12:18:18,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {1137#true} assume true; {1137#true} is VALID [2022-04-27 12:18:18,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {1137#true} assume !(0 == ~cond); {1137#true} is VALID [2022-04-27 12:18:18,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {1137#true} ~cond := #in~cond; {1137#true} is VALID [2022-04-27 12:18:18,682 INFO L272 TraceCheckUtils]: 6: Hoare triple {1243#(< ~counter~0 49)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1137#true} is VALID [2022-04-27 12:18:18,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {1243#(< ~counter~0 49)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1243#(< ~counter~0 49)} is VALID [2022-04-27 12:18:18,683 INFO L272 TraceCheckUtils]: 4: Hoare triple {1243#(< ~counter~0 49)} call #t~ret7 := main(); {1243#(< ~counter~0 49)} is VALID [2022-04-27 12:18:18,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1243#(< ~counter~0 49)} {1137#true} #102#return; {1243#(< ~counter~0 49)} is VALID [2022-04-27 12:18:18,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {1243#(< ~counter~0 49)} assume true; {1243#(< ~counter~0 49)} is VALID [2022-04-27 12:18:18,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {1137#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1243#(< ~counter~0 49)} is VALID [2022-04-27 12:18:18,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1137#true} is VALID [2022-04-27 12:18:18,685 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-27 12:18:18,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:18:18,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801015155] [2022-04-27 12:18:18,685 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:18:18,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481163133] [2022-04-27 12:18:18,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481163133] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:18:18,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:18:18,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 12:18:18,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391120543] [2022-04-27 12:18:18,685 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:18:18,686 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2022-04-27 12:18:18,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:18:18,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:18:18,709 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-27 12:18:18,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:18:18,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:18:18,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:18:18,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:18:18,710 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:18:23,260 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-27 12:18:32,068 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 7.64s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:18:36,325 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-27 12:18:40,881 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-27 12:18:41,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:41,318 INFO L93 Difference]: Finished difference Result 102 states and 144 transitions. [2022-04-27 12:18:41,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 12:18:41,319 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2022-04-27 12:18:41,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:18:41,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:18:41,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2022-04-27 12:18:41,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:18:41,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2022-04-27 12:18:41,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 131 transitions. [2022-04-27 12:18:41,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:18:41,439 INFO L225 Difference]: With dead ends: 102 [2022-04-27 12:18:41,440 INFO L226 Difference]: Without dead ends: 83 [2022-04-27 12:18:41,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:18:41,441 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 58 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 21 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2022-04-27 12:18:41,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 228 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 70 Invalid, 4 Unknown, 0 Unchecked, 15.6s Time] [2022-04-27 12:18:41,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-27 12:18:41,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2022-04-27 12:18:41,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:18:41,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 79 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 47 states have internal predecessors, (56), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:18:41,474 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 79 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 47 states have internal predecessors, (56), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:18:41,474 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 79 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 47 states have internal predecessors, (56), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:18:41,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:41,477 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2022-04-27 12:18:41,477 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 112 transitions. [2022-04-27 12:18:41,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:41,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:41,478 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 47 states have internal predecessors, (56), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 83 states. [2022-04-27 12:18:41,479 INFO L87 Difference]: Start difference. First operand has 79 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 47 states have internal predecessors, (56), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 83 states. [2022-04-27 12:18:41,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:41,481 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2022-04-27 12:18:41,481 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 112 transitions. [2022-04-27 12:18:41,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:41,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:41,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:18:41,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:18:41,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 47 states have internal predecessors, (56), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:18:41,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 108 transitions. [2022-04-27 12:18:41,485 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 108 transitions. Word has length 23 [2022-04-27 12:18:41,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:18:41,485 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 108 transitions. [2022-04-27 12:18:41,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:18:41,486 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 108 transitions. [2022-04-27 12:18:41,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 12:18:41,486 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:18:41,486 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:18:41,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 12:18:41,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:18:41,706 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:18:41,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:18:41,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1564262277, now seen corresponding path program 1 times [2022-04-27 12:18:41,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:18:41,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733866474] [2022-04-27 12:18:41,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:41,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:18:41,722 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:18:41,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1198257513] [2022-04-27 12:18:41,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:41,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:18:41,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:18:41,732 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:18:41,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 12:18:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:41,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:18:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:41,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:18:41,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {1725#true} call ULTIMATE.init(); {1725#true} is VALID [2022-04-27 12:18:41,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {1725#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1733#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:41,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {1733#(<= ~counter~0 0)} assume true; {1733#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:41,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1733#(<= ~counter~0 0)} {1725#true} #102#return; {1733#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:41,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {1733#(<= ~counter~0 0)} call #t~ret7 := main(); {1733#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:41,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {1733#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1733#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:41,954 INFO L272 TraceCheckUtils]: 6: Hoare triple {1733#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1733#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:41,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {1733#(<= ~counter~0 0)} ~cond := #in~cond; {1733#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:41,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {1733#(<= ~counter~0 0)} assume !(0 == ~cond); {1733#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:41,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {1733#(<= ~counter~0 0)} assume true; {1733#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:41,955 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1733#(<= ~counter~0 0)} {1733#(<= ~counter~0 0)} #82#return; {1733#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:41,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {1733#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1733#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:41,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {1733#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1767#(<= ~counter~0 1)} is VALID [2022-04-27 12:18:41,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {1767#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {1767#(<= ~counter~0 1)} is VALID [2022-04-27 12:18:41,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {1767#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1767#(<= ~counter~0 1)} is VALID [2022-04-27 12:18:41,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {1767#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1777#(<= ~counter~0 2)} is VALID [2022-04-27 12:18:41,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {1777#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {1777#(<= ~counter~0 2)} is VALID [2022-04-27 12:18:41,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {1777#(<= ~counter~0 2)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1777#(<= ~counter~0 2)} is VALID [2022-04-27 12:18:41,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {1777#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1787#(<= |main_#t~post6| 2)} is VALID [2022-04-27 12:18:41,958 INFO L290 TraceCheckUtils]: 19: Hoare triple {1787#(<= |main_#t~post6| 2)} assume !(#t~post6 < 50);havoc #t~post6; {1726#false} is VALID [2022-04-27 12:18:41,959 INFO L272 TraceCheckUtils]: 20: Hoare triple {1726#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {1726#false} is VALID [2022-04-27 12:18:41,959 INFO L290 TraceCheckUtils]: 21: Hoare triple {1726#false} ~cond := #in~cond; {1726#false} is VALID [2022-04-27 12:18:41,959 INFO L290 TraceCheckUtils]: 22: Hoare triple {1726#false} assume 0 == ~cond; {1726#false} is VALID [2022-04-27 12:18:41,959 INFO L290 TraceCheckUtils]: 23: Hoare triple {1726#false} assume !false; {1726#false} is VALID [2022-04-27 12:18:41,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:18:41,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:18:42,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {1726#false} assume !false; {1726#false} is VALID [2022-04-27 12:18:42,113 INFO L290 TraceCheckUtils]: 22: Hoare triple {1726#false} assume 0 == ~cond; {1726#false} is VALID [2022-04-27 12:18:42,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {1726#false} ~cond := #in~cond; {1726#false} is VALID [2022-04-27 12:18:42,113 INFO L272 TraceCheckUtils]: 20: Hoare triple {1726#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {1726#false} is VALID [2022-04-27 12:18:42,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {1815#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {1726#false} is VALID [2022-04-27 12:18:42,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {1819#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1815#(< |main_#t~post6| 50)} is VALID [2022-04-27 12:18:42,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {1819#(< ~counter~0 50)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1819#(< ~counter~0 50)} is VALID [2022-04-27 12:18:42,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {1819#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {1819#(< ~counter~0 50)} is VALID [2022-04-27 12:18:42,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {1829#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1819#(< ~counter~0 50)} is VALID [2022-04-27 12:18:42,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {1829#(< ~counter~0 49)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1829#(< ~counter~0 49)} is VALID [2022-04-27 12:18:42,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {1829#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {1829#(< ~counter~0 49)} is VALID [2022-04-27 12:18:42,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {1839#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1829#(< ~counter~0 49)} is VALID [2022-04-27 12:18:42,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {1839#(< ~counter~0 48)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1839#(< ~counter~0 48)} is VALID [2022-04-27 12:18:42,117 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1725#true} {1839#(< ~counter~0 48)} #82#return; {1839#(< ~counter~0 48)} is VALID [2022-04-27 12:18:42,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {1725#true} assume true; {1725#true} is VALID [2022-04-27 12:18:42,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {1725#true} assume !(0 == ~cond); {1725#true} is VALID [2022-04-27 12:18:42,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {1725#true} ~cond := #in~cond; {1725#true} is VALID [2022-04-27 12:18:42,118 INFO L272 TraceCheckUtils]: 6: Hoare triple {1839#(< ~counter~0 48)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1725#true} is VALID [2022-04-27 12:18:42,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {1839#(< ~counter~0 48)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1839#(< ~counter~0 48)} is VALID [2022-04-27 12:18:42,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {1839#(< ~counter~0 48)} call #t~ret7 := main(); {1839#(< ~counter~0 48)} is VALID [2022-04-27 12:18:42,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1839#(< ~counter~0 48)} {1725#true} #102#return; {1839#(< ~counter~0 48)} is VALID [2022-04-27 12:18:42,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {1839#(< ~counter~0 48)} assume true; {1839#(< ~counter~0 48)} is VALID [2022-04-27 12:18:42,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {1725#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1839#(< ~counter~0 48)} is VALID [2022-04-27 12:18:42,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {1725#true} call ULTIMATE.init(); {1725#true} is VALID [2022-04-27 12:18:42,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:18:42,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:18:42,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733866474] [2022-04-27 12:18:42,120 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:18:42,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198257513] [2022-04-27 12:18:42,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198257513] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:18:42,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:18:42,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 12:18:42,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074732673] [2022-04-27 12:18:42,121 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:18:42,121 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2022-04-27 12:18:42,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:18:42,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:18:42,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:18:42,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 12:18:42,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:18:42,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 12:18:42,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:18:42,148 INFO L87 Difference]: Start difference. First operand 79 states and 108 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:18:45,098 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-27 12:18:47,315 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-27 12:18:50,363 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-27 12:18:52,089 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:18:55,827 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-27 12:19:02,110 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-27 12:19:04,404 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:19:07,322 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-27 12:19:12,048 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-27 12:19:14,234 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-27 12:19:17,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:17,799 INFO L93 Difference]: Finished difference Result 149 states and 204 transitions. [2022-04-27 12:19:17,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 12:19:17,799 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2022-04-27 12:19:17,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:19:17,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:19:17,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 189 transitions. [2022-04-27 12:19:17,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:19:17,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 189 transitions. [2022-04-27 12:19:17,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 189 transitions. [2022-04-27 12:19:17,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:17,960 INFO L225 Difference]: With dead ends: 149 [2022-04-27 12:19:17,960 INFO L226 Difference]: Without dead ends: 133 [2022-04-27 12:19:17,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-27 12:19:17,961 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 148 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 71 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.9s IncrementalHoareTripleChecker+Time [2022-04-27 12:19:17,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 342 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 128 Invalid, 8 Unknown, 0 Unchecked, 25.9s Time] [2022-04-27 12:19:17,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-27 12:19:18,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 124. [2022-04-27 12:19:18,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:19:18,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 124 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 73 states have internal predecessors, (90), 46 states have call successors, (46), 10 states have call predecessors, (46), 9 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-27 12:19:18,009 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 124 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 73 states have internal predecessors, (90), 46 states have call successors, (46), 10 states have call predecessors, (46), 9 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-27 12:19:18,009 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 124 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 73 states have internal predecessors, (90), 46 states have call successors, (46), 10 states have call predecessors, (46), 9 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-27 12:19:18,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:18,014 INFO L93 Difference]: Finished difference Result 133 states and 181 transitions. [2022-04-27 12:19:18,014 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 181 transitions. [2022-04-27 12:19:18,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:18,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:18,016 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 73 states have internal predecessors, (90), 46 states have call successors, (46), 10 states have call predecessors, (46), 9 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand 133 states. [2022-04-27 12:19:18,016 INFO L87 Difference]: Start difference. First operand has 124 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 73 states have internal predecessors, (90), 46 states have call successors, (46), 10 states have call predecessors, (46), 9 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand 133 states. [2022-04-27 12:19:18,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:18,021 INFO L93 Difference]: Finished difference Result 133 states and 181 transitions. [2022-04-27 12:19:18,021 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 181 transitions. [2022-04-27 12:19:18,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:18,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:18,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:19:18,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:19:18,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 73 states have internal predecessors, (90), 46 states have call successors, (46), 10 states have call predecessors, (46), 9 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-27 12:19:18,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 176 transitions. [2022-04-27 12:19:18,026 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 176 transitions. Word has length 24 [2022-04-27 12:19:18,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:19:18,026 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 176 transitions. [2022-04-27 12:19:18,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:19:18,027 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 176 transitions. [2022-04-27 12:19:18,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 12:19:18,027 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:18,027 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:19:18,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 12:19:18,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:18,240 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:18,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:18,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1562772727, now seen corresponding path program 1 times [2022-04-27 12:19:18,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:18,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483314132] [2022-04-27 12:19:18,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:18,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:18,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:19:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:18,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {2572#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2558#true} is VALID [2022-04-27 12:19:18,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {2558#true} assume true; {2558#true} is VALID [2022-04-27 12:19:18,472 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2558#true} {2558#true} #102#return; {2558#true} is VALID [2022-04-27 12:19:18,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:19:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:18,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {2558#true} ~cond := #in~cond; {2558#true} is VALID [2022-04-27 12:19:18,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {2558#true} assume !(0 == ~cond); {2558#true} is VALID [2022-04-27 12:19:18,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {2558#true} assume true; {2558#true} is VALID [2022-04-27 12:19:18,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2558#true} {2558#true} #82#return; {2558#true} is VALID [2022-04-27 12:19:18,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {2558#true} call ULTIMATE.init(); {2572#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:19:18,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {2572#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2558#true} is VALID [2022-04-27 12:19:18,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {2558#true} assume true; {2558#true} is VALID [2022-04-27 12:19:18,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2558#true} {2558#true} #102#return; {2558#true} is VALID [2022-04-27 12:19:18,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {2558#true} call #t~ret7 := main(); {2558#true} is VALID [2022-04-27 12:19:18,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {2558#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2558#true} is VALID [2022-04-27 12:19:18,478 INFO L272 TraceCheckUtils]: 6: Hoare triple {2558#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2558#true} is VALID [2022-04-27 12:19:18,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {2558#true} ~cond := #in~cond; {2558#true} is VALID [2022-04-27 12:19:18,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {2558#true} assume !(0 == ~cond); {2558#true} is VALID [2022-04-27 12:19:18,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {2558#true} assume true; {2558#true} is VALID [2022-04-27 12:19:18,478 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2558#true} {2558#true} #82#return; {2558#true} is VALID [2022-04-27 12:19:18,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {2558#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2567#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:19:18,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {2567#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2567#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:19:18,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {2567#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {2567#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:19:18,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {2567#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2568#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:19:18,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {2568#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2568#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:19:18,483 INFO L290 TraceCheckUtils]: 16: Hoare triple {2568#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 50);havoc #t~post5; {2568#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:19:18,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {2568#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2569#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-27 12:19:18,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {2569#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2569#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-27 12:19:18,485 INFO L290 TraceCheckUtils]: 19: Hoare triple {2569#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} assume !!(#t~post6 < 50);havoc #t~post6; {2569#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-27 12:19:18,486 INFO L272 TraceCheckUtils]: 20: Hoare triple {2569#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2570#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:19:18,486 INFO L290 TraceCheckUtils]: 21: Hoare triple {2570#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2571#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:19:18,486 INFO L290 TraceCheckUtils]: 22: Hoare triple {2571#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2559#false} is VALID [2022-04-27 12:19:18,486 INFO L290 TraceCheckUtils]: 23: Hoare triple {2559#false} assume !false; {2559#false} is VALID [2022-04-27 12:19:18,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:19:18,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:19:18,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483314132] [2022-04-27 12:19:18,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483314132] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:19:18,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99381677] [2022-04-27 12:19:18,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:18,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:18,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:19:18,489 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:19:18,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 12:19:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:18,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 12:19:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:18,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:19:18,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {2558#true} call ULTIMATE.init(); {2558#true} is VALID [2022-04-27 12:19:18,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {2558#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2558#true} is VALID [2022-04-27 12:19:18,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {2558#true} assume true; {2558#true} is VALID [2022-04-27 12:19:18,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2558#true} {2558#true} #102#return; {2558#true} is VALID [2022-04-27 12:19:18,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {2558#true} call #t~ret7 := main(); {2558#true} is VALID [2022-04-27 12:19:18,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {2558#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2558#true} is VALID [2022-04-27 12:19:18,803 INFO L272 TraceCheckUtils]: 6: Hoare triple {2558#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2558#true} is VALID [2022-04-27 12:19:18,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {2558#true} ~cond := #in~cond; {2558#true} is VALID [2022-04-27 12:19:18,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {2558#true} assume !(0 == ~cond); {2558#true} is VALID [2022-04-27 12:19:18,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {2558#true} assume true; {2558#true} is VALID [2022-04-27 12:19:18,803 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2558#true} {2558#true} #82#return; {2558#true} is VALID [2022-04-27 12:19:18,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {2558#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2567#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:19:18,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {2567#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2567#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:19:18,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {2567#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {2567#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:19:18,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {2567#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2618#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:19:18,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {2618#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2618#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:19:18,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {2618#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {2618#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:19:18,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {2618#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2628#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-27 12:19:18,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {2628#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2628#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-27 12:19:18,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {2628#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} assume !!(#t~post6 < 50);havoc #t~post6; {2628#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-27 12:19:18,809 INFO L272 TraceCheckUtils]: 20: Hoare triple {2628#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2638#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:19:18,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {2638#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:19:18,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {2642#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2559#false} is VALID [2022-04-27 12:19:18,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {2559#false} assume !false; {2559#false} is VALID [2022-04-27 12:19:18,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:19:18,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:19:19,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {2559#false} assume !false; {2559#false} is VALID [2022-04-27 12:19:19,014 INFO L290 TraceCheckUtils]: 22: Hoare triple {2642#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2559#false} is VALID [2022-04-27 12:19:19,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {2638#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:19:19,015 INFO L272 TraceCheckUtils]: 20: Hoare triple {2658#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2638#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:19:19,015 INFO L290 TraceCheckUtils]: 19: Hoare triple {2658#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} assume !!(#t~post6 < 50);havoc #t~post6; {2658#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 12:19:19,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {2658#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2658#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 12:19:19,016 INFO L290 TraceCheckUtils]: 17: Hoare triple {2668#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2658#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 12:19:19,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {2668#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} assume !!(#t~post5 < 50);havoc #t~post5; {2668#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-27 12:19:19,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {2668#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2668#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-27 12:19:19,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {2678#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2668#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-27 12:19:19,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {2678#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} assume !!(#t~post5 < 50);havoc #t~post5; {2678#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-27 12:19:19,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {2678#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2678#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-27 12:19:19,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {2558#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2678#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-27 12:19:19,033 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2558#true} {2558#true} #82#return; {2558#true} is VALID [2022-04-27 12:19:19,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {2558#true} assume true; {2558#true} is VALID [2022-04-27 12:19:19,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {2558#true} assume !(0 == ~cond); {2558#true} is VALID [2022-04-27 12:19:19,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {2558#true} ~cond := #in~cond; {2558#true} is VALID [2022-04-27 12:19:19,033 INFO L272 TraceCheckUtils]: 6: Hoare triple {2558#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2558#true} is VALID [2022-04-27 12:19:19,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {2558#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2558#true} is VALID [2022-04-27 12:19:19,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {2558#true} call #t~ret7 := main(); {2558#true} is VALID [2022-04-27 12:19:19,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2558#true} {2558#true} #102#return; {2558#true} is VALID [2022-04-27 12:19:19,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {2558#true} assume true; {2558#true} is VALID [2022-04-27 12:19:19,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {2558#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2558#true} is VALID [2022-04-27 12:19:19,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {2558#true} call ULTIMATE.init(); {2558#true} is VALID [2022-04-27 12:19:19,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:19:19,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99381677] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:19:19,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 12:19:19,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-04-27 12:19:19,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36275971] [2022-04-27 12:19:19,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 12:19:19,034 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-27 12:19:19,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:19:19,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:19:19,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:19,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 12:19:19,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:19:19,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 12:19:19,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-27 12:19:19,105 INFO L87 Difference]: Start difference. First operand 124 states and 176 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:19:24,583 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-27 12:19:26,585 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-27 12:19:28,587 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-27 12:19:30,588 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-27 12:19:32,637 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-27 12:19:34,745 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-27 12:19:37,459 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-27 12:19:40,019 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-27 12:19:42,724 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-27 12:19:45,791 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-27 12:19:47,820 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-27 12:19:50,035 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-27 12:20:01,891 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-27 12:20:05,794 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-27 12:20:08,932 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-27 12:20:14,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:14,961 INFO L93 Difference]: Finished difference Result 198 states and 287 transitions. [2022-04-27 12:20:14,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 12:20:14,962 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-27 12:20:14,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:20:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:20:14,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 144 transitions. [2022-04-27 12:20:14,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:20:14,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 144 transitions. [2022-04-27 12:20:14,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 144 transitions. [2022-04-27 12:20:15,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:20:15,598 INFO L225 Difference]: With dead ends: 198 [2022-04-27 12:20:15,598 INFO L226 Difference]: Without dead ends: 181 [2022-04-27 12:20:15,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2022-04-27 12:20:15,599 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 73 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 183 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.7s IncrementalHoareTripleChecker+Time [2022-04-27 12:20:15,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 162 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 487 Invalid, 15 Unknown, 0 Unchecked, 41.7s Time] [2022-04-27 12:20:15,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-04-27 12:20:15,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 174. [2022-04-27 12:20:15,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:20:15,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 174 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 103 states have internal predecessors, (121), 65 states have call successors, (65), 14 states have call predecessors, (65), 13 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-27 12:20:15,676 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 174 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 103 states have internal predecessors, (121), 65 states have call successors, (65), 14 states have call predecessors, (65), 13 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-27 12:20:15,676 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 174 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 103 states have internal predecessors, (121), 65 states have call successors, (65), 14 states have call predecessors, (65), 13 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-27 12:20:15,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:15,682 INFO L93 Difference]: Finished difference Result 181 states and 256 transitions. [2022-04-27 12:20:15,682 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 256 transitions. [2022-04-27 12:20:15,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:15,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:15,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 103 states have internal predecessors, (121), 65 states have call successors, (65), 14 states have call predecessors, (65), 13 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) Second operand 181 states. [2022-04-27 12:20:15,684 INFO L87 Difference]: Start difference. First operand has 174 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 103 states have internal predecessors, (121), 65 states have call successors, (65), 14 states have call predecessors, (65), 13 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) Second operand 181 states. [2022-04-27 12:20:15,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:15,689 INFO L93 Difference]: Finished difference Result 181 states and 256 transitions. [2022-04-27 12:20:15,689 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 256 transitions. [2022-04-27 12:20:15,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:15,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:15,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:20:15,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:20:15,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 103 states have internal predecessors, (121), 65 states have call successors, (65), 14 states have call predecessors, (65), 13 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-27 12:20:15,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 243 transitions. [2022-04-27 12:20:15,696 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 243 transitions. Word has length 24 [2022-04-27 12:20:15,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:20:15,696 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 243 transitions. [2022-04-27 12:20:15,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:20:15,696 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 243 transitions. [2022-04-27 12:20:15,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 12:20:15,697 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:20:15,697 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1] [2022-04-27 12:20:15,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 12:20:15,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:20:15,911 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:20:15,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:20:15,912 INFO L85 PathProgramCache]: Analyzing trace with hash -45171523, now seen corresponding path program 1 times [2022-04-27 12:20:15,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:20:15,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283098102] [2022-04-27 12:20:15,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:15,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:20:15,921 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:20:15,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [396674486] [2022-04-27 12:20:15,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:15,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:20:15,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:20:15,939 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:20:15,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 12:20:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:16,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:20:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:16,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:20:16,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {3659#true} call ULTIMATE.init(); {3659#true} is VALID [2022-04-27 12:20:16,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {3659#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3659#true} is VALID [2022-04-27 12:20:16,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {3659#true} assume true; {3659#true} is VALID [2022-04-27 12:20:16,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3659#true} {3659#true} #102#return; {3659#true} is VALID [2022-04-27 12:20:16,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {3659#true} call #t~ret7 := main(); {3659#true} is VALID [2022-04-27 12:20:16,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {3659#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {3659#true} is VALID [2022-04-27 12:20:16,236 INFO L272 TraceCheckUtils]: 6: Hoare triple {3659#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {3659#true} is VALID [2022-04-27 12:20:16,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {3659#true} ~cond := #in~cond; {3659#true} is VALID [2022-04-27 12:20:16,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {3659#true} assume !(0 == ~cond); {3659#true} is VALID [2022-04-27 12:20:16,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {3659#true} assume true; {3659#true} is VALID [2022-04-27 12:20:16,236 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3659#true} {3659#true} #82#return; {3659#true} is VALID [2022-04-27 12:20:16,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {3659#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:16,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:16,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:16,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:16,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:16,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:16,239 INFO L272 TraceCheckUtils]: 17: Hoare triple {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {3659#true} is VALID [2022-04-27 12:20:16,239 INFO L290 TraceCheckUtils]: 18: Hoare triple {3659#true} ~cond := #in~cond; {3659#true} is VALID [2022-04-27 12:20:16,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {3659#true} assume !(0 == ~cond); {3659#true} is VALID [2022-04-27 12:20:16,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {3659#true} assume true; {3659#true} is VALID [2022-04-27 12:20:16,240 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3659#true} {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #84#return; {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:16,240 INFO L272 TraceCheckUtils]: 22: Hoare triple {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {3659#true} is VALID [2022-04-27 12:20:16,240 INFO L290 TraceCheckUtils]: 23: Hoare triple {3659#true} ~cond := #in~cond; {3659#true} is VALID [2022-04-27 12:20:16,240 INFO L290 TraceCheckUtils]: 24: Hoare triple {3659#true} assume !(0 == ~cond); {3659#true} is VALID [2022-04-27 12:20:16,240 INFO L290 TraceCheckUtils]: 25: Hoare triple {3659#true} assume true; {3659#true} is VALID [2022-04-27 12:20:16,241 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3659#true} {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #86#return; {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:16,241 INFO L272 TraceCheckUtils]: 27: Hoare triple {3697#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {3746#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:20:16,242 INFO L290 TraceCheckUtils]: 28: Hoare triple {3746#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3750#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:20:16,242 INFO L290 TraceCheckUtils]: 29: Hoare triple {3750#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3660#false} is VALID [2022-04-27 12:20:16,242 INFO L290 TraceCheckUtils]: 30: Hoare triple {3660#false} assume !false; {3660#false} is VALID [2022-04-27 12:20:16,244 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:20:16,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:20:16,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:20:16,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283098102] [2022-04-27 12:20:16,244 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:20:16,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396674486] [2022-04-27 12:20:16,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396674486] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:20:16,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:20:16,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:20:16,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116499841] [2022-04-27 12:20:16,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:20:16,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-04-27 12:20:16,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:20:16,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:20:16,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:20:16,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:20:16,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:20:16,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:20:16,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:20:16,266 INFO L87 Difference]: Start difference. First operand 174 states and 243 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:20:19,436 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-27 12:20:21,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:21,153 INFO L93 Difference]: Finished difference Result 180 states and 247 transitions. [2022-04-27 12:20:21,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:20:21,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-04-27 12:20:21,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:20:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:20:21,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-27 12:20:21,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:20:21,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-27 12:20:21,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-27 12:20:21,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:20:21,231 INFO L225 Difference]: With dead ends: 180 [2022-04-27 12:20:21,231 INFO L226 Difference]: Without dead ends: 152 [2022-04-27 12:20:21,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:20:21,232 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-27 12:20:21,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 154 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-04-27 12:20:21,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-04-27 12:20:21,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-04-27 12:20:21,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:20:21,312 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 12:20:21,318 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 12:20:21,319 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 12:20:21,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:21,325 INFO L93 Difference]: Finished difference Result 152 states and 216 transitions. [2022-04-27 12:20:21,326 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 216 transitions. [2022-04-27 12:20:21,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:21,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:21,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 152 states. [2022-04-27 12:20:21,328 INFO L87 Difference]: Start difference. First operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 152 states. [2022-04-27 12:20:21,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:21,334 INFO L93 Difference]: Finished difference Result 152 states and 216 transitions. [2022-04-27 12:20:21,334 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 216 transitions. [2022-04-27 12:20:21,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:21,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:21,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:20:21,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:20:21,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 12:20:21,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 216 transitions. [2022-04-27 12:20:21,340 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 216 transitions. Word has length 31 [2022-04-27 12:20:21,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:20:21,340 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 216 transitions. [2022-04-27 12:20:21,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:20:21,340 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 216 transitions. [2022-04-27 12:20:21,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 12:20:21,342 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:20:21,342 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:20:21,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 12:20:21,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:20:21,546 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:20:21,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:20:21,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1547125783, now seen corresponding path program 1 times [2022-04-27 12:20:21,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:20:21,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918331422] [2022-04-27 12:20:21,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:21,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:20:21,556 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:20:21,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1532581100] [2022-04-27 12:20:21,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:21,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:20:21,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:20:21,557 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:20:21,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 12:20:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:21,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:20:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:21,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:20:21,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {4555#true} call ULTIMATE.init(); {4555#true} is VALID [2022-04-27 12:20:21,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {4555#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4555#true} is VALID [2022-04-27 12:20:21,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-27 12:20:21,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4555#true} {4555#true} #102#return; {4555#true} is VALID [2022-04-27 12:20:21,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {4555#true} call #t~ret7 := main(); {4555#true} is VALID [2022-04-27 12:20:21,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {4555#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {4555#true} is VALID [2022-04-27 12:20:21,792 INFO L272 TraceCheckUtils]: 6: Hoare triple {4555#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {4555#true} is VALID [2022-04-27 12:20:21,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {4555#true} ~cond := #in~cond; {4555#true} is VALID [2022-04-27 12:20:21,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {4555#true} assume !(0 == ~cond); {4555#true} is VALID [2022-04-27 12:20:21,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-27 12:20:21,793 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4555#true} {4555#true} #82#return; {4555#true} is VALID [2022-04-27 12:20:21,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {4555#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {4593#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:21,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {4593#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4593#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:21,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {4593#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {4593#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:21,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {4593#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4593#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:21,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {4593#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4593#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:21,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {4593#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {4593#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:21,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {4593#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {4593#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:21,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {4593#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4593#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:21,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {4593#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post6 < 50);havoc #t~post6; {4593#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:21,796 INFO L272 TraceCheckUtils]: 20: Hoare triple {4593#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {4555#true} is VALID [2022-04-27 12:20:21,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {4555#true} ~cond := #in~cond; {4555#true} is VALID [2022-04-27 12:20:21,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {4555#true} assume !(0 == ~cond); {4555#true} is VALID [2022-04-27 12:20:21,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-27 12:20:21,797 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4555#true} {4593#(and (= main_~p~0 0) (= main_~h~0 0))} #84#return; {4593#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:21,797 INFO L272 TraceCheckUtils]: 25: Hoare triple {4593#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {4555#true} is VALID [2022-04-27 12:20:21,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {4555#true} ~cond := #in~cond; {4555#true} is VALID [2022-04-27 12:20:21,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {4555#true} assume !(0 == ~cond); {4555#true} is VALID [2022-04-27 12:20:21,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {4555#true} assume true; {4555#true} is VALID [2022-04-27 12:20:21,797 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4555#true} {4593#(and (= main_~p~0 0) (= main_~h~0 0))} #86#return; {4593#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:21,798 INFO L272 TraceCheckUtils]: 30: Hoare triple {4593#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {4651#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:20:21,798 INFO L290 TraceCheckUtils]: 31: Hoare triple {4651#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4655#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:20:21,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {4655#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4556#false} is VALID [2022-04-27 12:20:21,799 INFO L290 TraceCheckUtils]: 33: Hoare triple {4556#false} assume !false; {4556#false} is VALID [2022-04-27 12:20:21,799 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 12:20:21,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:20:21,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:20:21,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918331422] [2022-04-27 12:20:21,799 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:20:21,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532581100] [2022-04-27 12:20:21,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532581100] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:20:21,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:20:21,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:20:21,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290534475] [2022-04-27 12:20:21,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:20:21,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-27 12:20:21,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:20:21,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:20:21,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:20:21,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:20:21,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:20:21,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:20:21,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:20:21,825 INFO L87 Difference]: Start difference. First operand 152 states and 216 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:20:25,979 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-27 12:20:35,070 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-27 12:20:35,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:35,621 INFO L93 Difference]: Finished difference Result 182 states and 241 transitions. [2022-04-27 12:20:35,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:20:35,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-27 12:20:35,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:20:35,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:20:35,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-27 12:20:35,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:20:35,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-27 12:20:35,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-27 12:20:35,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:20:35,723 INFO L225 Difference]: With dead ends: 182 [2022-04-27 12:20:35,723 INFO L226 Difference]: Without dead ends: 177 [2022-04-27 12:20:35,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:20:35,724 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 8 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-27 12:20:35,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 156 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 2 Unknown, 0 Unchecked, 4.6s Time] [2022-04-27 12:20:35,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-04-27 12:20:35,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 170. [2022-04-27 12:20:35,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:20:35,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 12:20:35,792 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 12:20:35,792 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 12:20:35,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:35,797 INFO L93 Difference]: Finished difference Result 177 states and 228 transitions. [2022-04-27 12:20:35,797 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 228 transitions. [2022-04-27 12:20:35,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:35,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:35,798 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 177 states. [2022-04-27 12:20:35,798 INFO L87 Difference]: Start difference. First operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 177 states. [2022-04-27 12:20:35,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:35,803 INFO L93 Difference]: Finished difference Result 177 states and 228 transitions. [2022-04-27 12:20:35,803 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 228 transitions. [2022-04-27 12:20:35,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:35,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:35,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:20:35,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:20:35,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 12:20:35,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 219 transitions. [2022-04-27 12:20:35,808 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 219 transitions. Word has length 34 [2022-04-27 12:20:35,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:20:35,808 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 219 transitions. [2022-04-27 12:20:35,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:20:35,808 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 219 transitions. [2022-04-27 12:20:35,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 12:20:35,808 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:20:35,809 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:20:35,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 12:20:36,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:20:36,019 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:20:36,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:20:36,019 INFO L85 PathProgramCache]: Analyzing trace with hash 821435566, now seen corresponding path program 1 times [2022-04-27 12:20:36,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:20:36,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351429437] [2022-04-27 12:20:36,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:36,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:20:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:36,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:20:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:36,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {5544#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5534#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:36,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {5534#(<= ~counter~0 0)} assume true; {5534#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:36,114 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5534#(<= ~counter~0 0)} {5529#true} #102#return; {5534#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:36,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:20:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:36,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {5529#true} ~cond := #in~cond; {5529#true} is VALID [2022-04-27 12:20:36,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {5529#true} assume !(0 == ~cond); {5529#true} is VALID [2022-04-27 12:20:36,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {5529#true} assume true; {5529#true} is VALID [2022-04-27 12:20:36,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5529#true} {5534#(<= ~counter~0 0)} #82#return; {5534#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:36,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {5529#true} call ULTIMATE.init(); {5544#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:20:36,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {5544#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5534#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:36,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {5534#(<= ~counter~0 0)} assume true; {5534#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:36,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5534#(<= ~counter~0 0)} {5529#true} #102#return; {5534#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:36,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {5534#(<= ~counter~0 0)} call #t~ret7 := main(); {5534#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:36,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {5534#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5534#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:36,122 INFO L272 TraceCheckUtils]: 6: Hoare triple {5534#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5529#true} is VALID [2022-04-27 12:20:36,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {5529#true} ~cond := #in~cond; {5529#true} is VALID [2022-04-27 12:20:36,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {5529#true} assume !(0 == ~cond); {5529#true} is VALID [2022-04-27 12:20:36,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {5529#true} assume true; {5529#true} is VALID [2022-04-27 12:20:36,131 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5529#true} {5534#(<= ~counter~0 0)} #82#return; {5534#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:36,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {5534#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5534#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:36,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {5534#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5539#(<= ~counter~0 1)} is VALID [2022-04-27 12:20:36,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {5539#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {5539#(<= ~counter~0 1)} is VALID [2022-04-27 12:20:36,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {5539#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5539#(<= ~counter~0 1)} is VALID [2022-04-27 12:20:36,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {5539#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5540#(<= ~counter~0 2)} is VALID [2022-04-27 12:20:36,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {5540#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {5540#(<= ~counter~0 2)} is VALID [2022-04-27 12:20:36,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {5540#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5540#(<= ~counter~0 2)} is VALID [2022-04-27 12:20:36,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {5540#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5541#(<= ~counter~0 3)} is VALID [2022-04-27 12:20:36,136 INFO L290 TraceCheckUtils]: 19: Hoare triple {5541#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {5541#(<= ~counter~0 3)} is VALID [2022-04-27 12:20:36,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {5541#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5541#(<= ~counter~0 3)} is VALID [2022-04-27 12:20:36,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {5541#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5542#(<= ~counter~0 4)} is VALID [2022-04-27 12:20:36,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {5542#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {5542#(<= ~counter~0 4)} is VALID [2022-04-27 12:20:36,137 INFO L290 TraceCheckUtils]: 23: Hoare triple {5542#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5542#(<= ~counter~0 4)} is VALID [2022-04-27 12:20:36,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {5542#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5543#(<= |main_#t~post5| 4)} is VALID [2022-04-27 12:20:36,138 INFO L290 TraceCheckUtils]: 25: Hoare triple {5543#(<= |main_#t~post5| 4)} assume !(#t~post5 < 50);havoc #t~post5; {5530#false} is VALID [2022-04-27 12:20:36,138 INFO L290 TraceCheckUtils]: 26: Hoare triple {5530#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5530#false} is VALID [2022-04-27 12:20:36,138 INFO L290 TraceCheckUtils]: 27: Hoare triple {5530#false} assume !!(#t~post6 < 50);havoc #t~post6; {5530#false} is VALID [2022-04-27 12:20:36,138 INFO L272 TraceCheckUtils]: 28: Hoare triple {5530#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5530#false} is VALID [2022-04-27 12:20:36,138 INFO L290 TraceCheckUtils]: 29: Hoare triple {5530#false} ~cond := #in~cond; {5530#false} is VALID [2022-04-27 12:20:36,138 INFO L290 TraceCheckUtils]: 30: Hoare triple {5530#false} assume 0 == ~cond; {5530#false} is VALID [2022-04-27 12:20:36,138 INFO L290 TraceCheckUtils]: 31: Hoare triple {5530#false} assume !false; {5530#false} is VALID [2022-04-27 12:20:36,138 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:20:36,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:20:36,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351429437] [2022-04-27 12:20:36,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351429437] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:20:36,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287581250] [2022-04-27 12:20:36,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:36,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:20:36,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:20:36,140 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:20:36,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 12:20:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:36,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 12:20:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:36,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:20:36,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {5529#true} call ULTIMATE.init(); {5529#true} is VALID [2022-04-27 12:20:36,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {5529#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5534#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:36,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {5534#(<= ~counter~0 0)} assume true; {5534#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:36,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5534#(<= ~counter~0 0)} {5529#true} #102#return; {5534#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:36,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {5534#(<= ~counter~0 0)} call #t~ret7 := main(); {5534#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:36,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {5534#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5534#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:36,399 INFO L272 TraceCheckUtils]: 6: Hoare triple {5534#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5534#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:36,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {5534#(<= ~counter~0 0)} ~cond := #in~cond; {5534#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:36,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {5534#(<= ~counter~0 0)} assume !(0 == ~cond); {5534#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:36,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {5534#(<= ~counter~0 0)} assume true; {5534#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:36,402 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5534#(<= ~counter~0 0)} {5534#(<= ~counter~0 0)} #82#return; {5534#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:36,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {5534#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5534#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:36,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {5534#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5539#(<= ~counter~0 1)} is VALID [2022-04-27 12:20:36,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {5539#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {5539#(<= ~counter~0 1)} is VALID [2022-04-27 12:20:36,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {5539#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5539#(<= ~counter~0 1)} is VALID [2022-04-27 12:20:36,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {5539#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5540#(<= ~counter~0 2)} is VALID [2022-04-27 12:20:36,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {5540#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {5540#(<= ~counter~0 2)} is VALID [2022-04-27 12:20:36,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {5540#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5540#(<= ~counter~0 2)} is VALID [2022-04-27 12:20:36,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {5540#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5541#(<= ~counter~0 3)} is VALID [2022-04-27 12:20:36,405 INFO L290 TraceCheckUtils]: 19: Hoare triple {5541#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {5541#(<= ~counter~0 3)} is VALID [2022-04-27 12:20:36,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {5541#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5541#(<= ~counter~0 3)} is VALID [2022-04-27 12:20:36,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {5541#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5542#(<= ~counter~0 4)} is VALID [2022-04-27 12:20:36,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {5542#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {5542#(<= ~counter~0 4)} is VALID [2022-04-27 12:20:36,407 INFO L290 TraceCheckUtils]: 23: Hoare triple {5542#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5542#(<= ~counter~0 4)} is VALID [2022-04-27 12:20:36,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {5542#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5543#(<= |main_#t~post5| 4)} is VALID [2022-04-27 12:20:36,408 INFO L290 TraceCheckUtils]: 25: Hoare triple {5543#(<= |main_#t~post5| 4)} assume !(#t~post5 < 50);havoc #t~post5; {5530#false} is VALID [2022-04-27 12:20:36,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {5530#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5530#false} is VALID [2022-04-27 12:20:36,408 INFO L290 TraceCheckUtils]: 27: Hoare triple {5530#false} assume !!(#t~post6 < 50);havoc #t~post6; {5530#false} is VALID [2022-04-27 12:20:36,408 INFO L272 TraceCheckUtils]: 28: Hoare triple {5530#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5530#false} is VALID [2022-04-27 12:20:36,408 INFO L290 TraceCheckUtils]: 29: Hoare triple {5530#false} ~cond := #in~cond; {5530#false} is VALID [2022-04-27 12:20:36,408 INFO L290 TraceCheckUtils]: 30: Hoare triple {5530#false} assume 0 == ~cond; {5530#false} is VALID [2022-04-27 12:20:36,408 INFO L290 TraceCheckUtils]: 31: Hoare triple {5530#false} assume !false; {5530#false} is VALID [2022-04-27 12:20:36,408 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:20:36,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:20:36,684 INFO L290 TraceCheckUtils]: 31: Hoare triple {5530#false} assume !false; {5530#false} is VALID [2022-04-27 12:20:36,685 INFO L290 TraceCheckUtils]: 30: Hoare triple {5530#false} assume 0 == ~cond; {5530#false} is VALID [2022-04-27 12:20:36,685 INFO L290 TraceCheckUtils]: 29: Hoare triple {5530#false} ~cond := #in~cond; {5530#false} is VALID [2022-04-27 12:20:36,685 INFO L272 TraceCheckUtils]: 28: Hoare triple {5530#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5530#false} is VALID [2022-04-27 12:20:36,685 INFO L290 TraceCheckUtils]: 27: Hoare triple {5530#false} assume !!(#t~post6 < 50);havoc #t~post6; {5530#false} is VALID [2022-04-27 12:20:36,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {5530#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5530#false} is VALID [2022-04-27 12:20:36,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {5659#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {5530#false} is VALID [2022-04-27 12:20:36,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {5663#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5659#(< |main_#t~post5| 50)} is VALID [2022-04-27 12:20:36,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {5663#(< ~counter~0 50)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5663#(< ~counter~0 50)} is VALID [2022-04-27 12:20:36,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {5663#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {5663#(< ~counter~0 50)} is VALID [2022-04-27 12:20:36,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {5673#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5663#(< ~counter~0 50)} is VALID [2022-04-27 12:20:36,687 INFO L290 TraceCheckUtils]: 20: Hoare triple {5673#(< ~counter~0 49)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5673#(< ~counter~0 49)} is VALID [2022-04-27 12:20:36,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {5673#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {5673#(< ~counter~0 49)} is VALID [2022-04-27 12:20:36,688 INFO L290 TraceCheckUtils]: 18: Hoare triple {5683#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5673#(< ~counter~0 49)} is VALID [2022-04-27 12:20:36,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {5683#(< ~counter~0 48)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5683#(< ~counter~0 48)} is VALID [2022-04-27 12:20:36,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {5683#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {5683#(< ~counter~0 48)} is VALID [2022-04-27 12:20:36,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {5693#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5683#(< ~counter~0 48)} is VALID [2022-04-27 12:20:36,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {5693#(< ~counter~0 47)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5693#(< ~counter~0 47)} is VALID [2022-04-27 12:20:36,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {5693#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {5693#(< ~counter~0 47)} is VALID [2022-04-27 12:20:36,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {5703#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5693#(< ~counter~0 47)} is VALID [2022-04-27 12:20:36,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {5703#(< ~counter~0 46)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5703#(< ~counter~0 46)} is VALID [2022-04-27 12:20:36,692 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5529#true} {5703#(< ~counter~0 46)} #82#return; {5703#(< ~counter~0 46)} is VALID [2022-04-27 12:20:36,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {5529#true} assume true; {5529#true} is VALID [2022-04-27 12:20:36,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {5529#true} assume !(0 == ~cond); {5529#true} is VALID [2022-04-27 12:20:36,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {5529#true} ~cond := #in~cond; {5529#true} is VALID [2022-04-27 12:20:36,692 INFO L272 TraceCheckUtils]: 6: Hoare triple {5703#(< ~counter~0 46)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5529#true} is VALID [2022-04-27 12:20:36,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {5703#(< ~counter~0 46)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5703#(< ~counter~0 46)} is VALID [2022-04-27 12:20:36,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {5703#(< ~counter~0 46)} call #t~ret7 := main(); {5703#(< ~counter~0 46)} is VALID [2022-04-27 12:20:36,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5703#(< ~counter~0 46)} {5529#true} #102#return; {5703#(< ~counter~0 46)} is VALID [2022-04-27 12:20:36,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {5703#(< ~counter~0 46)} assume true; {5703#(< ~counter~0 46)} is VALID [2022-04-27 12:20:36,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {5529#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5703#(< ~counter~0 46)} is VALID [2022-04-27 12:20:36,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {5529#true} call ULTIMATE.init(); {5529#true} is VALID [2022-04-27 12:20:36,694 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:20:36,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287581250] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:20:36,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 12:20:36,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-04-27 12:20:36,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911611354] [2022-04-27 12:20:36,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 12:20:36,695 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2022-04-27 12:20:36,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:20:36,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 12:20:36,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:20:36,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 12:20:36,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:20:36,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 12:20:36,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-04-27 12:20:36,758 INFO L87 Difference]: Start difference. First operand 170 states and 219 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 12:20:40,060 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:20:44,553 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-27 12:20:46,559 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:20:48,812 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-27 12:20:51,207 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-27 12:20:54,755 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-27 12:20:57,935 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-27 12:20:59,941 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-27 12:21:02,330 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-27 12:21:05,497 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:21:07,844 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-27 12:21:09,914 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-27 12:21:12,126 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-27 12:21:14,132 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-27 12:21:30,563 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-27 12:21:32,566 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-27 12:21:34,608 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-27 12:21:36,614 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:21:38,825 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-27 12:21:40,326 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:21:42,749 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-27 12:21:48,109 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:21:49,676 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:21:52,333 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-27 12:21:54,340 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-27 12:21:56,957 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-27 12:22:02,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:02,832 INFO L93 Difference]: Finished difference Result 350 states and 447 transitions. [2022-04-27 12:22:02,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-27 12:22:02,832 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2022-04-27 12:22:02,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:22:02,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 12:22:02,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 256 transitions. [2022-04-27 12:22:02,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 12:22:02,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 256 transitions. [2022-04-27 12:22:02,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 256 transitions. [2022-04-27 12:22:03,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:22:03,098 INFO L225 Difference]: With dead ends: 350 [2022-04-27 12:22:03,098 INFO L226 Difference]: Without dead ends: 310 [2022-04-27 12:22:03,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=716, Unknown=0, NotChecked=0, Total=992 [2022-04-27 12:22:03,099 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 190 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 124 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 70.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 70.5s IncrementalHoareTripleChecker+Time [2022-04-27 12:22:03,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 199 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 440 Invalid, 22 Unknown, 0 Unchecked, 70.5s Time] [2022-04-27 12:22:03,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-04-27 12:22:03,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 289. [2022-04-27 12:22:03,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:22:03,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 310 states. Second operand has 289 states, 171 states have (on average 1.1695906432748537) internal successors, (200), 179 states have internal predecessors, (200), 87 states have call successors, (87), 31 states have call predecessors, (87), 30 states have return successors, (81), 78 states have call predecessors, (81), 81 states have call successors, (81) [2022-04-27 12:22:03,223 INFO L74 IsIncluded]: Start isIncluded. First operand 310 states. Second operand has 289 states, 171 states have (on average 1.1695906432748537) internal successors, (200), 179 states have internal predecessors, (200), 87 states have call successors, (87), 31 states have call predecessors, (87), 30 states have return successors, (81), 78 states have call predecessors, (81), 81 states have call successors, (81) [2022-04-27 12:22:03,223 INFO L87 Difference]: Start difference. First operand 310 states. Second operand has 289 states, 171 states have (on average 1.1695906432748537) internal successors, (200), 179 states have internal predecessors, (200), 87 states have call successors, (87), 31 states have call predecessors, (87), 30 states have return successors, (81), 78 states have call predecessors, (81), 81 states have call successors, (81) [2022-04-27 12:22:03,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:03,230 INFO L93 Difference]: Finished difference Result 310 states and 388 transitions. [2022-04-27 12:22:03,230 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 388 transitions. [2022-04-27 12:22:03,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:22:03,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:22:03,232 INFO L74 IsIncluded]: Start isIncluded. First operand has 289 states, 171 states have (on average 1.1695906432748537) internal successors, (200), 179 states have internal predecessors, (200), 87 states have call successors, (87), 31 states have call predecessors, (87), 30 states have return successors, (81), 78 states have call predecessors, (81), 81 states have call successors, (81) Second operand 310 states. [2022-04-27 12:22:03,232 INFO L87 Difference]: Start difference. First operand has 289 states, 171 states have (on average 1.1695906432748537) internal successors, (200), 179 states have internal predecessors, (200), 87 states have call successors, (87), 31 states have call predecessors, (87), 30 states have return successors, (81), 78 states have call predecessors, (81), 81 states have call successors, (81) Second operand 310 states. [2022-04-27 12:22:03,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:03,238 INFO L93 Difference]: Finished difference Result 310 states and 388 transitions. [2022-04-27 12:22:03,239 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 388 transitions. [2022-04-27 12:22:03,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:22:03,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:22:03,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:22:03,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:22:03,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 171 states have (on average 1.1695906432748537) internal successors, (200), 179 states have internal predecessors, (200), 87 states have call successors, (87), 31 states have call predecessors, (87), 30 states have return successors, (81), 78 states have call predecessors, (81), 81 states have call successors, (81) [2022-04-27 12:22:03,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 368 transitions. [2022-04-27 12:22:03,247 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 368 transitions. Word has length 32 [2022-04-27 12:22:03,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:22:03,247 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 368 transitions. [2022-04-27 12:22:03,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 12:22:03,247 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 368 transitions. [2022-04-27 12:22:03,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 12:22:03,248 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:22:03,248 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:22:03,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-27 12:22:03,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 12:22:03,464 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:22:03,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:22:03,464 INFO L85 PathProgramCache]: Analyzing trace with hash -271152338, now seen corresponding path program 2 times [2022-04-27 12:22:03,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:22:03,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337629612] [2022-04-27 12:22:03,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:22:03,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:22:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:22:03,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:22:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:22:03,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {7340#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7324#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:03,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {7324#(<= ~counter~0 0)} assume true; {7324#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:03,642 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7324#(<= ~counter~0 0)} {7319#true} #102#return; {7324#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:03,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:22:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:22:03,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {7319#true} ~cond := #in~cond; {7319#true} is VALID [2022-04-27 12:22:03,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {7319#true} assume !(0 == ~cond); {7319#true} is VALID [2022-04-27 12:22:03,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {7319#true} assume true; {7319#true} is VALID [2022-04-27 12:22:03,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7319#true} {7324#(<= ~counter~0 0)} #82#return; {7324#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:03,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {7319#true} call ULTIMATE.init(); {7340#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:22:03,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {7340#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7324#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:03,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {7324#(<= ~counter~0 0)} assume true; {7324#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:03,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7324#(<= ~counter~0 0)} {7319#true} #102#return; {7324#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:03,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {7324#(<= ~counter~0 0)} call #t~ret7 := main(); {7324#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:03,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {7324#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {7324#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:03,650 INFO L272 TraceCheckUtils]: 6: Hoare triple {7324#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {7319#true} is VALID [2022-04-27 12:22:03,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {7319#true} ~cond := #in~cond; {7319#true} is VALID [2022-04-27 12:22:03,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {7319#true} assume !(0 == ~cond); {7319#true} is VALID [2022-04-27 12:22:03,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {7319#true} assume true; {7319#true} is VALID [2022-04-27 12:22:03,651 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7319#true} {7324#(<= ~counter~0 0)} #82#return; {7324#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:03,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {7324#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {7324#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:03,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {7324#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7329#(<= ~counter~0 1)} is VALID [2022-04-27 12:22:03,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {7329#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {7329#(<= ~counter~0 1)} is VALID [2022-04-27 12:22:03,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {7329#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7329#(<= ~counter~0 1)} is VALID [2022-04-27 12:22:03,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {7329#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7330#(<= ~counter~0 2)} is VALID [2022-04-27 12:22:03,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {7330#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {7330#(<= ~counter~0 2)} is VALID [2022-04-27 12:22:03,654 INFO L290 TraceCheckUtils]: 17: Hoare triple {7330#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7330#(<= ~counter~0 2)} is VALID [2022-04-27 12:22:03,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {7330#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7331#(<= ~counter~0 3)} is VALID [2022-04-27 12:22:03,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {7331#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {7331#(<= ~counter~0 3)} is VALID [2022-04-27 12:22:03,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {7331#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7331#(<= ~counter~0 3)} is VALID [2022-04-27 12:22:03,655 INFO L290 TraceCheckUtils]: 21: Hoare triple {7331#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7332#(<= ~counter~0 4)} is VALID [2022-04-27 12:22:03,655 INFO L290 TraceCheckUtils]: 22: Hoare triple {7332#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {7332#(<= ~counter~0 4)} is VALID [2022-04-27 12:22:03,656 INFO L290 TraceCheckUtils]: 23: Hoare triple {7332#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7332#(<= ~counter~0 4)} is VALID [2022-04-27 12:22:03,656 INFO L290 TraceCheckUtils]: 24: Hoare triple {7332#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7333#(<= ~counter~0 5)} is VALID [2022-04-27 12:22:03,657 INFO L290 TraceCheckUtils]: 25: Hoare triple {7333#(<= ~counter~0 5)} assume !!(#t~post5 < 50);havoc #t~post5; {7333#(<= ~counter~0 5)} is VALID [2022-04-27 12:22:03,657 INFO L290 TraceCheckUtils]: 26: Hoare triple {7333#(<= ~counter~0 5)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7333#(<= ~counter~0 5)} is VALID [2022-04-27 12:22:03,657 INFO L290 TraceCheckUtils]: 27: Hoare triple {7333#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7334#(<= ~counter~0 6)} is VALID [2022-04-27 12:22:03,658 INFO L290 TraceCheckUtils]: 28: Hoare triple {7334#(<= ~counter~0 6)} assume !!(#t~post5 < 50);havoc #t~post5; {7334#(<= ~counter~0 6)} is VALID [2022-04-27 12:22:03,658 INFO L290 TraceCheckUtils]: 29: Hoare triple {7334#(<= ~counter~0 6)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7334#(<= ~counter~0 6)} is VALID [2022-04-27 12:22:03,659 INFO L290 TraceCheckUtils]: 30: Hoare triple {7334#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7335#(<= ~counter~0 7)} is VALID [2022-04-27 12:22:03,659 INFO L290 TraceCheckUtils]: 31: Hoare triple {7335#(<= ~counter~0 7)} assume !!(#t~post5 < 50);havoc #t~post5; {7335#(<= ~counter~0 7)} is VALID [2022-04-27 12:22:03,659 INFO L290 TraceCheckUtils]: 32: Hoare triple {7335#(<= ~counter~0 7)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7335#(<= ~counter~0 7)} is VALID [2022-04-27 12:22:03,660 INFO L290 TraceCheckUtils]: 33: Hoare triple {7335#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7336#(<= ~counter~0 8)} is VALID [2022-04-27 12:22:03,660 INFO L290 TraceCheckUtils]: 34: Hoare triple {7336#(<= ~counter~0 8)} assume !!(#t~post5 < 50);havoc #t~post5; {7336#(<= ~counter~0 8)} is VALID [2022-04-27 12:22:03,660 INFO L290 TraceCheckUtils]: 35: Hoare triple {7336#(<= ~counter~0 8)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7336#(<= ~counter~0 8)} is VALID [2022-04-27 12:22:03,661 INFO L290 TraceCheckUtils]: 36: Hoare triple {7336#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7337#(<= ~counter~0 9)} is VALID [2022-04-27 12:22:03,661 INFO L290 TraceCheckUtils]: 37: Hoare triple {7337#(<= ~counter~0 9)} assume !!(#t~post5 < 50);havoc #t~post5; {7337#(<= ~counter~0 9)} is VALID [2022-04-27 12:22:03,662 INFO L290 TraceCheckUtils]: 38: Hoare triple {7337#(<= ~counter~0 9)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7337#(<= ~counter~0 9)} is VALID [2022-04-27 12:22:03,662 INFO L290 TraceCheckUtils]: 39: Hoare triple {7337#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7338#(<= ~counter~0 10)} is VALID [2022-04-27 12:22:03,663 INFO L290 TraceCheckUtils]: 40: Hoare triple {7338#(<= ~counter~0 10)} assume !!(#t~post5 < 50);havoc #t~post5; {7338#(<= ~counter~0 10)} is VALID [2022-04-27 12:22:03,663 INFO L290 TraceCheckUtils]: 41: Hoare triple {7338#(<= ~counter~0 10)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7338#(<= ~counter~0 10)} is VALID [2022-04-27 12:22:03,663 INFO L290 TraceCheckUtils]: 42: Hoare triple {7338#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7339#(<= |main_#t~post5| 10)} is VALID [2022-04-27 12:22:03,664 INFO L290 TraceCheckUtils]: 43: Hoare triple {7339#(<= |main_#t~post5| 10)} assume !(#t~post5 < 50);havoc #t~post5; {7320#false} is VALID [2022-04-27 12:22:03,664 INFO L290 TraceCheckUtils]: 44: Hoare triple {7320#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7320#false} is VALID [2022-04-27 12:22:03,664 INFO L290 TraceCheckUtils]: 45: Hoare triple {7320#false} assume !!(#t~post6 < 50);havoc #t~post6; {7320#false} is VALID [2022-04-27 12:22:03,664 INFO L272 TraceCheckUtils]: 46: Hoare triple {7320#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {7320#false} is VALID [2022-04-27 12:22:03,664 INFO L290 TraceCheckUtils]: 47: Hoare triple {7320#false} ~cond := #in~cond; {7320#false} is VALID [2022-04-27 12:22:03,664 INFO L290 TraceCheckUtils]: 48: Hoare triple {7320#false} assume 0 == ~cond; {7320#false} is VALID [2022-04-27 12:22:03,664 INFO L290 TraceCheckUtils]: 49: Hoare triple {7320#false} assume !false; {7320#false} is VALID [2022-04-27 12:22:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:22:03,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:22:03,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337629612] [2022-04-27 12:22:03,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337629612] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:22:03,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980226860] [2022-04-27 12:22:03,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:22:03,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:22:03,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:22:03,666 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:22:03,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 12:22:03,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-27 12:22:03,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:22:03,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 12:22:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:22:03,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:22:03,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {7319#true} call ULTIMATE.init(); {7319#true} is VALID [2022-04-27 12:22:03,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {7319#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7319#true} is VALID [2022-04-27 12:22:03,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {7319#true} assume true; {7319#true} is VALID [2022-04-27 12:22:03,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7319#true} {7319#true} #102#return; {7319#true} is VALID [2022-04-27 12:22:03,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {7319#true} call #t~ret7 := main(); {7319#true} is VALID [2022-04-27 12:22:03,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {7319#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {7319#true} is VALID [2022-04-27 12:22:03,846 INFO L272 TraceCheckUtils]: 6: Hoare triple {7319#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {7319#true} is VALID [2022-04-27 12:22:03,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {7319#true} ~cond := #in~cond; {7319#true} is VALID [2022-04-27 12:22:03,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {7319#true} assume !(0 == ~cond); {7319#true} is VALID [2022-04-27 12:22:03,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {7319#true} assume true; {7319#true} is VALID [2022-04-27 12:22:03,846 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7319#true} {7319#true} #82#return; {7319#true} is VALID [2022-04-27 12:22:03,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {7319#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {7319#true} is VALID [2022-04-27 12:22:03,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {7319#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7319#true} is VALID [2022-04-27 12:22:03,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {7319#true} assume !!(#t~post5 < 50);havoc #t~post5; {7319#true} is VALID [2022-04-27 12:22:03,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {7319#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7319#true} is VALID [2022-04-27 12:22:03,846 INFO L290 TraceCheckUtils]: 15: Hoare triple {7319#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7319#true} is VALID [2022-04-27 12:22:03,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {7319#true} assume !!(#t~post5 < 50);havoc #t~post5; {7319#true} is VALID [2022-04-27 12:22:03,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {7319#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7319#true} is VALID [2022-04-27 12:22:03,855 INFO L290 TraceCheckUtils]: 18: Hoare triple {7319#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7319#true} is VALID [2022-04-27 12:22:03,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {7319#true} assume !!(#t~post5 < 50);havoc #t~post5; {7319#true} is VALID [2022-04-27 12:22:03,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {7319#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7319#true} is VALID [2022-04-27 12:22:03,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {7319#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7319#true} is VALID [2022-04-27 12:22:03,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {7319#true} assume !!(#t~post5 < 50);havoc #t~post5; {7319#true} is VALID [2022-04-27 12:22:03,855 INFO L290 TraceCheckUtils]: 23: Hoare triple {7319#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7319#true} is VALID [2022-04-27 12:22:03,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {7319#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7319#true} is VALID [2022-04-27 12:22:03,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {7319#true} assume !!(#t~post5 < 50);havoc #t~post5; {7319#true} is VALID [2022-04-27 12:22:03,856 INFO L290 TraceCheckUtils]: 26: Hoare triple {7319#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7319#true} is VALID [2022-04-27 12:22:03,856 INFO L290 TraceCheckUtils]: 27: Hoare triple {7319#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7319#true} is VALID [2022-04-27 12:22:03,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {7319#true} assume !!(#t~post5 < 50);havoc #t~post5; {7319#true} is VALID [2022-04-27 12:22:03,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {7319#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7319#true} is VALID [2022-04-27 12:22:03,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {7319#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7319#true} is VALID [2022-04-27 12:22:03,856 INFO L290 TraceCheckUtils]: 31: Hoare triple {7319#true} assume !!(#t~post5 < 50);havoc #t~post5; {7319#true} is VALID [2022-04-27 12:22:03,856 INFO L290 TraceCheckUtils]: 32: Hoare triple {7319#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7319#true} is VALID [2022-04-27 12:22:03,856 INFO L290 TraceCheckUtils]: 33: Hoare triple {7319#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7319#true} is VALID [2022-04-27 12:22:03,856 INFO L290 TraceCheckUtils]: 34: Hoare triple {7319#true} assume !!(#t~post5 < 50);havoc #t~post5; {7319#true} is VALID [2022-04-27 12:22:03,856 INFO L290 TraceCheckUtils]: 35: Hoare triple {7319#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7319#true} is VALID [2022-04-27 12:22:03,856 INFO L290 TraceCheckUtils]: 36: Hoare triple {7319#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7319#true} is VALID [2022-04-27 12:22:03,856 INFO L290 TraceCheckUtils]: 37: Hoare triple {7319#true} assume !!(#t~post5 < 50);havoc #t~post5; {7319#true} is VALID [2022-04-27 12:22:03,856 INFO L290 TraceCheckUtils]: 38: Hoare triple {7319#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7319#true} is VALID [2022-04-27 12:22:03,856 INFO L290 TraceCheckUtils]: 39: Hoare triple {7319#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7319#true} is VALID [2022-04-27 12:22:03,856 INFO L290 TraceCheckUtils]: 40: Hoare triple {7319#true} assume !!(#t~post5 < 50);havoc #t~post5; {7319#true} is VALID [2022-04-27 12:22:03,856 INFO L290 TraceCheckUtils]: 41: Hoare triple {7319#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7319#true} is VALID [2022-04-27 12:22:03,858 INFO L290 TraceCheckUtils]: 42: Hoare triple {7319#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7470#(<= (+ |main_#t~post5| 1) ~counter~0)} is VALID [2022-04-27 12:22:03,859 INFO L290 TraceCheckUtils]: 43: Hoare triple {7470#(<= (+ |main_#t~post5| 1) ~counter~0)} assume !(#t~post5 < 50);havoc #t~post5; {7474#(<= 51 ~counter~0)} is VALID [2022-04-27 12:22:03,859 INFO L290 TraceCheckUtils]: 44: Hoare triple {7474#(<= 51 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7478#(<= 51 |main_#t~post6|)} is VALID [2022-04-27 12:22:03,860 INFO L290 TraceCheckUtils]: 45: Hoare triple {7478#(<= 51 |main_#t~post6|)} assume !!(#t~post6 < 50);havoc #t~post6; {7320#false} is VALID [2022-04-27 12:22:03,860 INFO L272 TraceCheckUtils]: 46: Hoare triple {7320#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {7320#false} is VALID [2022-04-27 12:22:03,860 INFO L290 TraceCheckUtils]: 47: Hoare triple {7320#false} ~cond := #in~cond; {7320#false} is VALID [2022-04-27 12:22:03,860 INFO L290 TraceCheckUtils]: 48: Hoare triple {7320#false} assume 0 == ~cond; {7320#false} is VALID [2022-04-27 12:22:03,860 INFO L290 TraceCheckUtils]: 49: Hoare triple {7320#false} assume !false; {7320#false} is VALID [2022-04-27 12:22:03,860 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-04-27 12:22:03,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:22:03,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980226860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:22:03,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:22:03,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2022-04-27 12:22:03,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629599743] [2022-04-27 12:22:03,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:22:03,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 50 [2022-04-27 12:22:03,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:22:03,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-27 12:22:03,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:22:03,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:22:03,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:22:03,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:22:03,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-04-27 12:22:03,877 INFO L87 Difference]: Start difference. First operand 289 states and 368 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-27 12:22:10,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:10,838 INFO L93 Difference]: Finished difference Result 326 states and 417 transitions. [2022-04-27 12:22:10,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:22:10,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 50 [2022-04-27 12:22:10,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:22:10,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-27 12:22:10,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-27 12:22:10,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-27 12:22:10,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-27 12:22:10,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-27 12:22:10,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:22:10,913 INFO L225 Difference]: With dead ends: 326 [2022-04-27 12:22:10,913 INFO L226 Difference]: Without dead ends: 286 [2022-04-27 12:22:10,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-04-27 12:22:10,914 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:22:10,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:22:10,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-04-27 12:22:11,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 281. [2022-04-27 12:22:11,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:22:11,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 286 states. Second operand has 281 states, 164 states have (on average 1.1646341463414633) internal successors, (191), 171 states have internal predecessors, (191), 86 states have call successors, (86), 31 states have call predecessors, (86), 30 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-27 12:22:11,029 INFO L74 IsIncluded]: Start isIncluded. First operand 286 states. Second operand has 281 states, 164 states have (on average 1.1646341463414633) internal successors, (191), 171 states have internal predecessors, (191), 86 states have call successors, (86), 31 states have call predecessors, (86), 30 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-27 12:22:11,030 INFO L87 Difference]: Start difference. First operand 286 states. Second operand has 281 states, 164 states have (on average 1.1646341463414633) internal successors, (191), 171 states have internal predecessors, (191), 86 states have call successors, (86), 31 states have call predecessors, (86), 30 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-27 12:22:11,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:11,035 INFO L93 Difference]: Finished difference Result 286 states and 363 transitions. [2022-04-27 12:22:11,035 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 363 transitions. [2022-04-27 12:22:11,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:22:11,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:22:11,037 INFO L74 IsIncluded]: Start isIncluded. First operand has 281 states, 164 states have (on average 1.1646341463414633) internal successors, (191), 171 states have internal predecessors, (191), 86 states have call successors, (86), 31 states have call predecessors, (86), 30 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) Second operand 286 states. [2022-04-27 12:22:11,037 INFO L87 Difference]: Start difference. First operand has 281 states, 164 states have (on average 1.1646341463414633) internal successors, (191), 171 states have internal predecessors, (191), 86 states have call successors, (86), 31 states have call predecessors, (86), 30 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) Second operand 286 states. [2022-04-27 12:22:11,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:11,043 INFO L93 Difference]: Finished difference Result 286 states and 363 transitions. [2022-04-27 12:22:11,043 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 363 transitions. [2022-04-27 12:22:11,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:22:11,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:22:11,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:22:11,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:22:11,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 164 states have (on average 1.1646341463414633) internal successors, (191), 171 states have internal predecessors, (191), 86 states have call successors, (86), 31 states have call predecessors, (86), 30 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-27 12:22:11,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 357 transitions. [2022-04-27 12:22:11,050 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 357 transitions. Word has length 50 [2022-04-27 12:22:11,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:22:11,051 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 357 transitions. [2022-04-27 12:22:11,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-27 12:22:11,051 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 357 transitions. [2022-04-27 12:22:11,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-27 12:22:11,052 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:22:11,052 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:22:11,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 12:22:11,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:22:11,267 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:22:11,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:22:11,268 INFO L85 PathProgramCache]: Analyzing trace with hash 109392637, now seen corresponding path program 1 times [2022-04-27 12:22:11,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:22:11,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165932268] [2022-04-27 12:22:11,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:22:11,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:22:11,279 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:22:11,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [433051218] [2022-04-27 12:22:11,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:22:11,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:22:11,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:22:11,281 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:22:11,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process